{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G2Z5DFTHBWXIM4ZWDHLIEM3XN7","short_pith_number":"pith:G2Z5DFTH","canonical_record":{"source":{"id":"1806.02282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T16:22:33Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"946a06e5d8dcf34bf21532dea7f142c988c20dee5f7cf8da84ede382e7e2663f","abstract_canon_sha256":"5dbc6c9bda41d7bf3085341b57d394b234830c6e330f1485a11b85cb74791662"},"schema_version":"1.0"},"canonical_sha256":"36b3d196670dae86733619d68233776fdebdb5679b92410feabda955e8dba7a3","source":{"kind":"arxiv","id":"1806.02282","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02282","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02282v3","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02282","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"G2Z5DFTHBWXI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G2Z5DFTHBWXIM4ZW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G2Z5DFTH","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G2Z5DFTHBWXIM4ZWDHLIEM3XN7","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T16:22:33Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"946a06e5d8dcf34bf21532dea7f142c988c20dee5f7cf8da84ede382e7e2663f","abstract_canon_sha256":"5dbc6c9bda41d7bf3085341b57d394b234830c6e330f1485a11b85cb74791662"},"schema_version":"1.0"},"canonical_sha256":"36b3d196670dae86733619d68233776fdebdb5679b92410feabda955e8dba7a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:06.668514Z","signature_b64":"fuUGJhpqk4FZPCtxJwuWLndJ2SU74yTTvXA3617FLhzTFRijop80eGjj/JgdNHUwOV9JrhYb0Bi1rtMuR4eJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b3d196670dae86733619d68233776fdebdb5679b92410feabda955e8dba7a3","last_reissued_at":"2026-05-17T23:48:06.668038Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:06.668038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02282","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/zjAG6+FJgohdiYlj6Rcmst7+j3HB/Aqpsok/MCiYKIsrHBaI41KhbSGyZjj64ZPVFpGRAV6eH88KWmQC3CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:44:40.987868Z"},"content_sha256":"6732478b415787c7dabbda853fee38b6601a0949eed01ed1c0785e2a804e63d3","schema_version":"1.0","event_id":"sha256:6732478b415787c7dabbda853fee38b6601a0949eed01ed1c0785e2a804e63d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G2Z5DFTHBWXIM4ZWDHLIEM3XN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding the bandit in a graph: Sequential search-and-stop","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Michal Valko, Pierre Perrault, Vianney Perchet","submitted_at":"2018-06-06T16:22:33Z","abstract_excerpt":"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 realizin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02282","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HaltUyuXnCnwaByInESYL8u1SaP0PxTjF2GUn3ymLa+oxkS3e9pQcPWYjzCyDlA1nUlwkmZvwSP/t4xzej1ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:44:40.988565Z"},"content_sha256":"81081bf01edaa1b8e8cc48034192f60cff0f77a11a3ed7464434142177b86c0c","schema_version":"1.0","event_id":"sha256:81081bf01edaa1b8e8cc48034192f60cff0f77a11a3ed7464434142177b86c0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7/bundle.json","state_url":"https://pith.science/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:44:40Z","links":{"resolver":"https://pith.science/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7","bundle":"https://pith.science/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7/bundle.json","state":"https://pith.science/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2Z5DFTHBWXIM4ZWDHLIEM3XN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G2Z5DFTHBWXIM4ZWDHLIEM3XN7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5dbc6c9bda41d7bf3085341b57d394b234830c6e330f1485a11b85cb74791662","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T16:22:33Z","title_canon_sha256":"946a06e5d8dcf34bf21532dea7f142c988c20dee5f7cf8da84ede382e7e2663f"},"schema_version":"1.0","source":{"id":"1806.02282","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02282","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02282v3","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02282","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"G2Z5DFTHBWXI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G2Z5DFTHBWXIM4ZW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G2Z5DFTH","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:81081bf01edaa1b8e8cc48034192f60cff0f77a11a3ed7464434142177b86c0c","target":"graph","created_at":"2026-05-17T23:48:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"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 realizin","authors_text":"Michal Valko, Pierre Perrault, Vianney Perchet","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T16:22:33Z","title":"Finding the bandit in a graph: Sequential search-and-stop"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02282","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6732478b415787c7dabbda853fee38b6601a0949eed01ed1c0785e2a804e63d3","target":"record","created_at":"2026-05-17T23:48:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5dbc6c9bda41d7bf3085341b57d394b234830c6e330f1485a11b85cb74791662","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T16:22:33Z","title_canon_sha256":"946a06e5d8dcf34bf21532dea7f142c988c20dee5f7cf8da84ede382e7e2663f"},"schema_version":"1.0","source":{"id":"1806.02282","kind":"arxiv","version":3}},"canonical_sha256":"36b3d196670dae86733619d68233776fdebdb5679b92410feabda955e8dba7a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36b3d196670dae86733619d68233776fdebdb5679b92410feabda955e8dba7a3","first_computed_at":"2026-05-17T23:48:06.668038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:06.668038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fuUGJhpqk4FZPCtxJwuWLndJ2SU74yTTvXA3617FLhzTFRijop80eGjj/JgdNHUwOV9JrhYb0Bi1rtMuR4eJAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:06.668514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02282","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6732478b415787c7dabbda853fee38b6601a0949eed01ed1c0785e2a804e63d3","sha256:81081bf01edaa1b8e8cc48034192f60cff0f77a11a3ed7464434142177b86c0c"],"state_sha256":"f9fc243bb5acf1f4f49ab0ca392d7ddf32f865f0e27fcca8a4303263ca5e116d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jnbwAvY3TAM42bT/TW6859EzPrgNQUhynWbb4nsEMCAF4mi0e8ToshAwsv8j2tDHRkkPTxKPmQTYDQhE83wBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:44:40.992210Z","bundle_sha256":"c15793a83bb3f202db63acbb86f27392fbbc658a57aa25696cec6df0f4a9550c"}}