{"id":"paperswithcode-paper-1806.02282","name":"finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282","tags":["paperswithcode-import","external-catalog","paperswithcode","paper","Multi-Armed Bandits"],"task":"agents","type":"collection","evals":[],"owner":"paperswithcode","stars":0,"formats":["paperswithcode","paper","json","pdf-link"],"hosting":{"status":"blocked","storageProvider":"local","hostedFiles":0,"totalFiles":0,"hostedFilesAuthority":"live-serve-decision","hosted":false,"downloadable":false,"readyFileCount":0,"serveAuthority":"live-serve-decision","completeRunnable":false,"authority":"postgres-executable-state-snapshot","authorityDigest":null,"downloadReady":false,"mirroredFiles":0,"mirroredBytes":0,"runReady":false,"verified":false},"license":"cc-by-sa-4.0-metadata","summary":"Finding the bandit in a graph: Sequential search-and-stop","version":"1806.02282","modality":"paper","upstream":{"gated":false,"tasks":["Multi-Armed Bandits"],"pdfUrl":"http://arxiv.org/pdf/1806.02282v3.pdf","repoId":"paper:1806.02282","arxivId":"1806.02282","authors":["Pierre Perrault","Vianney Perchet","Michal Valko"],"methods":[],"private":false,"repoUrl":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","disabled":false,"provider":"paperswithcode","repoType":"paper","revision":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","fetchedAt":"2026-07-01T20:29:31.805Z","conference":"","importMode":"external-catalog","licenseRaw":"cc-by-sa-4.0-metadata","openreviewId":"","archiveDataset":"pwc-archive/papers-with-abstracts"},"versions":[{"commit":"https://paperswithcode.com/paper","version":"1806.02282","releasedAt":"2018-06-06T00:00:00.000Z","scanStatus":"pending","manifestDigest":"external-not-mirrored"}],"citations":0,"createdAt":"2018-06-06T00:00:00.000Z","framework":"paperswithcode","publisher":"Papers with Code","sizeBytes":1,"sourceUrl":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","updatedAt":"2018-06-06T00:00:00.000Z","scanStatus":"pending","visibility":"public","description":"External Papers with Code paper metadata for 1806.02282. We consider the problem where an agent wants to find a hidden object that is randomly located in some vertex of a directed acyclic graph (DAG) according to a fixed but possibly unknown distribution. The agent can only examine vertices whose in-neighbors have already been examined. In this paper, we address a learning setting where we allow the agent to stop before having found the object and restart searching on a new independent instance of the same problem. Our goal is to maximize the total number of hidden objects found given a time budget. The agent can thus skip an instance after realizing that it would spend too much time on it. Our contributions are both to the search theory and multi-armed bandits. If the distribution is known, we provide a quasi-optimal and efficient stationary strategy. If the distribution is unknown, we additionally show how to sequentially approximate it and, at the same time, act near-optimally in order to collect as many hidden objects as possible. Tasks: Multi-Armed Bandits. Hugging Bay stores this as research and task metadata only; papers, PDFs, and code remain upstream.","mirrorCount":0,"safetyNotes":["External metadata imported from paperswithcode on 2026-07-01T20:29:31.805Z.","This record is searchable and linkable, but Hugging Bay does not host its files.","Use the upstream source URL until a source-specific legal and mirror review approves local hosting."],"releaseGates":{"scan":"pending","files":"pending","license":"pending","metadata":"passed","signature":"pending","provenance":"passed"},"downloadCount":1,"cardCompleteness":92,"verificationStatus":"pending","requestedVisibility":"public","repo":"paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282","files":[],"fileCount":0,"hostedFileCount":0,"externalFileCount":0,"communityReviewSummary":{"count":0,"averageRating":0,"verifiedRuns":0,"selfReportedVerifiedRuns":0,"verificationQualification":"quarantined-untrusted-evidence","verificationTrustImpact":"none","helpfulCount":0,"reportCount":0,"reportedReviews":0,"distribution":{"1":0,"2":0,"3":0,"4":0,"5":0},"toolCounts":{},"categoryAverages":{},"categoryCounts":{},"benchmarkEvidence":{"count":0,"verifiedCount":0,"benchmarkCount":0,"performanceCount":0,"hardwareCounts":{},"topMetrics":[],"recent":[]},"recent":[]},"publicDownloadableFileCount":0,"publicFileCount":0,"displayOnly":true,"authorizationRequired":true,"eligibilitySnapshotAt":"2026-11-21T17:55:50.821Z","webUrl":"https://huggingbay.xyz/artifact/paperswithcode-paper-1806.02282","listedFileLowerBound":0,"hostingStatus":"blocked","signals":{"size":{"known":false,"bytes":0,"label":"unknown","reason":"upstream file sizes are not indexed yet"},"demand":{"mirrorRequests":0,"upstreamDownloads":1,"upstreamStars":0,"label":"1 upstream downloads","basis":"upstream-downloads"},"trust":{"score":0,"level":"unknown","label":"Unknown","qualification":"recorded-state-unknown","trustImpact":"none","checks":[{"id":"license","label":"License","status":"fail","detail":"cc-by-sa-4.0-metadata"},{"id":"provenance","label":"Provenance","status":"pass","detail":"paper:1806.02282"},{"id":"scan","label":"Scan","status":"warn","detail":"pending"},{"id":"hosting","label":"Hosted files","status":"warn","detail":"external metadata only"},{"id":"manifest","label":"Byte manifest integrity","status":"warn","detail":"not final yet"}],"strengths":["Provenance: paper:1806.02282"],"gaps":["License: cc-by-sa-4.0-metadata","Scan: pending","Hosted files: external metadata only","Byte manifest integrity: not final yet"]},"readiness":{"score":0,"level":"unknown","hostedFinal":false,"hostedFiles":0,"externalFiles":0,"totalFiles":0},"action":{"id":"open-source","label":"Open official source","detail":"Use the official immutable source while Hugging Bay evidence remains incomplete.","href":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential"}},"mirrorCompletion":{"status":"external","hostedFiles":0,"totalFiles":0,"externalFiles":0,"hostedBytes":0,"externalBytes":1,"lowRiskExternalFiles":0,"overFileCapFiles":0,"overBatchCapFiles":0,"directMirrorExternalFiles":0,"directMirrorExternalBytes":0,"currentLimits":{"maxMirrorFileBytes":536870912,"maxMirrorTotalBytes":1073741824,"maxMirrorFiles":8,"maxDirectMirrorFileBytes":8589934592,"maxDirectMirrorTotalBytes":17179869184},"directMirrorExternalSamples":[],"largestExternalFiles":[]},"licenseLabel":"cc-by-sa-4.0-metadata","licenseState":"known","recommendedFile":null,"modelSizeTruth":true,"torrent":null,"torrentUrl":null,"magnetUri":null,"downloadUrl":null,"landingUrl":null,"manifestUrl":null,"localKitUrl":null,"licenseClarity":{"license":"cc-by-sa-4.0-metadata","commercialUse":"conditional","confidence":"high","obligations":["Credit the creator, retain the copyright and license notice, link the license, and indicate whether changes were made.","Distribute adaptations under the same license (or a license the original license permits as compatible)."],"summary":"cc-by-sa-4.0-metadata: commercial use is permitted with attribution; adaptations must use the same or a permitted compatible license.","redistribution":"Credit the creator, retain the copyright and license notice, link the license, and indicate whether changes were made. Distribute adaptations under the same license (or a license the original license permits as compatible).","notes":"Not legal advice."},"licenseObligationsDigest":null,"licenseUpstreamRecord":{"declaredLicense":"cc-by-sa-4.0-metadata","upstreamLicenseRaw":"cc-by-sa-4.0-metadata","sourceUrl":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","upstream":{"gated":false,"tasks":["Multi-Armed Bandits"],"pdfUrl":"http://arxiv.org/pdf/1806.02282v3.pdf","repoId":"paper:1806.02282","arxivId":"1806.02282","authors":["Pierre Perrault","Vianney Perchet","Michal Valko"],"methods":[],"private":false,"repoUrl":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","disabled":false,"provider":"paperswithcode","repoType":"paper","revision":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","fetchedAt":"2026-07-01T20:29:31.805Z","conference":"","importMode":"external-catalog","licenseRaw":"cc-by-sa-4.0-metadata","openreviewId":"","archiveDataset":"pwc-archive/papers-with-abstracts"}},"gateStatus":"ungated","downloadable":false,"downloadStatus":"BLOCKED","reasonCodes":["incomplete-manifest","no-tested-run-plan","unverified-bytes"],"reason":"Files withheld — not faked. This model is listed, but we haven't confirmed its download files, so no download URLs are published. What's missing: file manifest — not final; downloadable files — 0 confirmed; run plan — not tested.","serveEvaluatedAt":"2026-11-21T17:56:59.338Z","serveEvaluationId":"serve-df254a1707ec32b969e7a86efd443a61642da708faf522ef5e4ca8f94e43bbfc","readiness":"blocked","downloadReady":false,"mirroredBytes":0,"readinessCheckedAt":"2026-11-21T17:56:59.486Z","readinessSource":"file-check","serveExplanation":{"downloadable":false,"downloadStatus":"BLOCKED","reasonCodes":["incomplete-manifest","no-tested-run-plan","unverified-bytes"],"reason":"Files withheld — not faked. This model is listed, but we haven't confirmed its download files, so no download URLs are published. What's missing: file manifest — not final; downloadable files — 0 confirmed; run plan — not tested.","serveEvaluatedAt":"2026-11-21T17:56:59.338Z","serveEvaluationId":"serve-df254a1707ec32b969e7a86efd443a61642da708faf522ef5e4ca8f94e43bbfc","readiness":"blocked","downloadReady":false,"hostedFileCount":0,"mirroredBytes":0,"readinessCheckedAt":"2026-11-21T17:56:59.338Z","readinessSource":"file-check","degraded":false,"stale":false},"commandsAvailable":false,"runReady":false,"attribution":"Cataloged open AI model · https://huggingbay.xyz/artifact/paperswithcode-paper-1806.02282","decentralizedDistribution":{"protocol":"bittorrent-magnet-metadata","verifiedFallbacks":0,"pendingReviewRequests":0,"reviewRequired":true,"policy":"Peer-assisted fallbacks are metadata only until Hugging Bay review confirms source, license, provenance, and safety. Gated/private bypasses are not allowed."},"hosted":false,"modelState":{"state":"not_hosted","word":"Not hosted here","sentence":"Files are not hosted here yet. Open the model to ask for them."},"pageFacts":{"id":"paperswithcode-paper-1806.02282","repo":"paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282","type":"collection","purpose":"collection artifact for agents","license":{"id":"cc-by-sa-4.0-metadata","label":"cc-by-sa-4.0-metadata","state":"known","url":"https://spdx.org/licenses/CC-by-sa-4.0-metadata.html","source":"spdx","hostedFile":false,"commercialUse":"conditional","terms":"cc-by-sa-4.0-metadata: commercial use is permitted with attribution; adaptations must use the same or a permitted compatible license."},"task":{"id":"agents","label":"agents"},"size":{"bytes":0,"label":"unknown","known":false,"repositoryLabel":"Full repo upstream","hostedKnown":false,"hostedBytes":0,"hostedLabel":"size unknown","hostedSummary":"availability unknown","hostedIsSubset":false,"downloadBytes":0,"downloadLabel":"","recommended":null,"parameters":null,"sentence":"Hosted here: availability unknown. The full repository size is not recorded."},"files":{"hosted":0,"total":0,"label":"0 hosted of 0 listed"},"download":{"status":"blocked","gated":"serve","label":"Downloadable files: 0 confirmed","url":""},"released":{"iso":"2018-06-06","label":"Jun 6, 2018","upstream":true,"factLabel":"Released"},"updated":{"iso":"2018-06-06","label":"Jun 6, 2018","factLabel":"Updated at source"},"source":{"provider":"paperswithcode","label":"paperswithcode","url":"https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential","repoId":"paper:1806.02282"},"languages":[],"baseModel":{"ref":"","url":"","resolveUrl":""},"paperIds":[],"arxivIds":[],"sameAs":["https://paperswithcode.com/paper/finding-the-bandit-in-a-graph-sequential"],"creator":{"@type":"Organization","name":"Papers with Code"},"scholarlyArticles":[],"scanStatus":"pending","faq":[{"id":"what-is-it","question":"What is paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282?","answer":"paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282 is a collection artifact for agents published by Papers with Code, released Jun 6, 2018. Finding the bandit in a graph: Sequential search-and-stop"},{"id":"license","question":"What license does paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282 use, and can I use it commercially?","answer":"It is released under the cc-by-sa-4.0-metadata license. Commercial use is allowed with conditions. cc-by-sa-4.0-metadata: commercial use is permitted with attribution; adaptations must use the same or a permitted compatible license."},{"id":"size","question":"How big is paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282?","answer":"Hosted here: availability unknown. The full repository size is not recorded."},{"id":"download","question":"Where can I download paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282?","answer":"This model is listed, but we haven't confirmed its download files, so we won't offer a download button we can't stand behind. The record lists 0 files."},{"id":"safety","question":"Has paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282 been scanned for unsafe files?","answer":"Source scan status: pending. A scan checks the files for known-bad signatures; it does not mean the model is safe. The machine-readable verdict is at /api/artifacts/paperswithcode-paper-1806.02282/safety on Hugging Bay."},{"id":"fit-unknown","question":"Will paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282 run on my computer?","answer":"We can’t check the fit; we don’t know your machine. We don’t have your machine’s specs, so no check ran and no verdict is shown. Answer two quick questions and we’ll estimate, from the memory you tell us, whether it fits your machine. Or skip it; you can still download; fit isn’t checked."}]},"guidedDownloadCard":{"schemaVersion":"hugging-bay.guided-download-card/v2","artifactId":"paperswithcode-paper-1806.02282","repo":"paperswithcode/finding-the-bandit-in-a-graph-sequential-search-and-stop-1806.02282","serveState":"BLOCKED","downloadReady":false,"reasonCodes":["manifest_not_final","files_unconfirmed","run_plan_untested"],"withheld":{"active":true,"reasonCodes":["manifest_not_final","files_unconfirmed","run_plan_untested"]},"wasmRun":null,"bytesOnStorage":false,"file":null,"noHostedWeights":true,"notSingleFile":false,"download":{"available":false,"url":null},"otherFiles":[],"run":{"available":false,"reason":"no-runnable-file","lmStudioUrl":"https://lmstudio.ai/","terminalCommand":null,"verificationMessage":null},"paused":{"active":false},"blocked":{"active":true,"reason":"page-facts-not-hosted","message":"Files withheld. Not faked."},"unconfirmed":{"active":false},"licenseGate":{"active":false},"checks":{"license":null,"licenseLabel":null,"fingerprintMatches":false,"hostedFiles":0,"totalFiles":0},"policyVersion":"hugging-bay.guided-download-card/v2","evaluatedAt":"2026-11-21T17:56:59.490Z","readiness":"blocked","downloadable":false,"downloadStatus":"BLOCKED","hostedFileCount":0,"mirroredBytes":0,"readinessCheckedAt":"2026-11-21T17:56:59.490Z","readinessSource":"file-check","degraded":false,"stale":false,"hosted":false,"hostingStatus":"blocked","publicDownloadableFileCount":0,"serve_verdict":{"can_download":false,"bytes_verified":false,"signature":"unsigned","freshness":"current","checked_at":"2026-11-21T17:56:59.490Z","evidence_url":"/api/manifests/paperswithcode-paper-1806.02282"}},"howToRun":{"schema":"hugging-bay.how-to-run.v1","available":false,"runtime":null,"command":null,"file":null,"minimumRamGb":null,"downloadUrl":null,"downloadCommand":null,"verifyCommand":null,"downloadUrlNote":"Stable URL. Each GET re-checks the file and redirects to a signed link that lasts at most 300 seconds; open it again for a fresh link.","filesUrl":"https://huggingbay.xyz/api/v1/artifacts/paperswithcode-paper-1806.02282/files","tested":false,"note":"No single hosted file is recorded for this model yet. minimumRamGb is an estimate from the file size (file at most 0.6 x memory), not a measurement."},"canIRun":true,"runTested":false,"degraded":false,"stale":false,"contentControls":{"state":"not assessed","basis":"no_explicit_uploader_evidence","matchedTerms":[],"assessedAt":null},"contentControlsLabel":"Content controls: not assessed.","contentControlsAttribution":{"upstream":{"provider":"paperswithcode","repoId":"paper:1806.02282"}},"runs_here":{"schema_version":1,"artifact_id":"paperswithcode-paper-1806.02282","records":[],"next_cursor":null},"hardware_fit":{"schema":"hugging-bay.hardware-fit.v1","artifactId":"paperswithcode-paper-1806.02282","revision":"","claim":"estimated_physical_memory_capacity","runnableAuthority":false,"representations":[],"reason":"immutable_revision_unavailable"},"note":{"summary":"Downloadable doesn't mean tested: this record says whether the exact file can be downloaded now, not that the model is complete or that it runs.","downloadable":false},"serve_verdict":{"can_download":false,"bytes_verified":false,"signature":"unsigned","freshness":"current","checked_at":"2026-11-21T17:56:59.486Z","evidence_url":"/api/manifests/paperswithcode-paper-1806.02282"}}