{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IGJQEJ5M5LO3MEMN23OC5ERHRJ","short_pith_number":"pith:IGJQEJ5M","canonical_record":{"source":{"id":"2503.07824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-03-10T20:11:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3324e5141fa27ea147e0b5baff48e311f3d3fd47be9000be0b40a16938c7cc93","abstract_canon_sha256":"44a8feebbea19c9bd576bebfa1c839ce4027df4402ace7565eb9171545b921c4"},"schema_version":"1.0"},"canonical_sha256":"41930227aceaddb6118dd6dc2e92278a76ccb67e719f4b0dd9fbbd617f653759","source":{"kind":"arxiv","id":"2503.07824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.07824","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"2503.07824v1","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07824","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"IGJQEJ5M5LO3","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_16","alias_value":"IGJQEJ5M5LO3MEMN","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_8","alias_value":"IGJQEJ5M","created_at":"2026-07-05T10:28:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IGJQEJ5M5LO3MEMN23OC5ERHRJ","target":"record","payload":{"canonical_record":{"source":{"id":"2503.07824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-03-10T20:11:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3324e5141fa27ea147e0b5baff48e311f3d3fd47be9000be0b40a16938c7cc93","abstract_canon_sha256":"44a8feebbea19c9bd576bebfa1c839ce4027df4402ace7565eb9171545b921c4"},"schema_version":"1.0"},"canonical_sha256":"41930227aceaddb6118dd6dc2e92278a76ccb67e719f4b0dd9fbbd617f653759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:44.547279Z","signature_b64":"kNzXScfj/QcLfHbi89B7+eLyaWQNkFRwgSITFWDydSZy6fEyIaKjfXlleYloVVWxHkHNgPgL2lqQvMYcqZ4EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41930227aceaddb6118dd6dc2e92278a76ccb67e719f4b0dd9fbbd617f653759","last_reissued_at":"2026-07-05T10:28:44.546782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:44.546782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.07824","source_version":1,"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-07-05T10:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1v7PVcCmh7tNDtACxhpqoisQDQjdmRc49Gk5i/Ch7cm8EEemKOEDlht1XO3C9EeWXw4GM3qYLo/fWNRfXbsQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:14:29.154423Z"},"content_sha256":"6769226c4e6465d171d9b0c2189fa11c8f98a4d81bcf6b8f69c3ee44be4242b4","schema_version":"1.0","event_id":"sha256:6769226c4e6465d171d9b0c2189fa11c8f98a4d81bcf6b8f69c3ee44be4242b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IGJQEJ5M5LO3MEMN23OC5ERHRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pure Exploration with Feedback Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aldo Pacchiano, Alessio Russo, Yichen Song","submitted_at":"2025-03-10T20:11:59Z","abstract_excerpt":"We study the sample complexity of pure exploration in an online learning problem with a feedback graph. This graph dictates the feedback available to the learner, covering scenarios between full-information, pure bandit feedback, and settings with no feedback on the chosen action. While variants of this problem have been investigated for regret minimization, no prior work has addressed the pure exploration setting, which is the focus of our study. We derive an instance-specific lower bound on the sample complexity of learning the best action with fixed confidence, even when the feedback graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07824","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.07824/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AI2Td5RtAzk8q/1Zcw5uVJ3XHYXs3lz0rlgQzNEBMy5yZonoHkA9UCb7mcA51+gt3BvygexOrgYWjnlx5VtZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:14:29.154946Z"},"content_sha256":"80a835a84395f3afc47ca6407f9e045de3cc3afa443cd45963be1c9227897aef","schema_version":"1.0","event_id":"sha256:80a835a84395f3afc47ca6407f9e045de3cc3afa443cd45963be1c9227897aef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ/bundle.json","state_url":"https://pith.science/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ/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-08-05T00:14:29Z","links":{"resolver":"https://pith.science/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ","bundle":"https://pith.science/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ/bundle.json","state":"https://pith.science/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGJQEJ5M5LO3MEMN23OC5ERHRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IGJQEJ5M5LO3MEMN23OC5ERHRJ","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":"44a8feebbea19c9bd576bebfa1c839ce4027df4402ace7565eb9171545b921c4","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-03-10T20:11:59Z","title_canon_sha256":"3324e5141fa27ea147e0b5baff48e311f3d3fd47be9000be0b40a16938c7cc93"},"schema_version":"1.0","source":{"id":"2503.07824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.07824","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"2503.07824v1","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.07824","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"IGJQEJ5M5LO3","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_16","alias_value":"IGJQEJ5M5LO3MEMN","created_at":"2026-07-05T10:28:44Z"},{"alias_kind":"pith_short_8","alias_value":"IGJQEJ5M","created_at":"2026-07-05T10:28:44Z"}],"graph_snapshots":[{"event_id":"sha256:80a835a84395f3afc47ca6407f9e045de3cc3afa443cd45963be1c9227897aef","target":"graph","created_at":"2026-07-05T10:28:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.07824/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the sample complexity of pure exploration in an online learning problem with a feedback graph. This graph dictates the feedback available to the learner, covering scenarios between full-information, pure bandit feedback, and settings with no feedback on the chosen action. While variants of this problem have been investigated for regret minimization, no prior work has addressed the pure exploration setting, which is the focus of our study. We derive an instance-specific lower bound on the sample complexity of learning the best action with fixed confidence, even when the feedback graph ","authors_text":"Aldo Pacchiano, Alessio Russo, Yichen Song","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-03-10T20:11:59Z","title":"Pure Exploration with Feedback Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.07824","kind":"arxiv","version":1},"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:6769226c4e6465d171d9b0c2189fa11c8f98a4d81bcf6b8f69c3ee44be4242b4","target":"record","created_at":"2026-07-05T10:28:44Z","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":"44a8feebbea19c9bd576bebfa1c839ce4027df4402ace7565eb9171545b921c4","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-03-10T20:11:59Z","title_canon_sha256":"3324e5141fa27ea147e0b5baff48e311f3d3fd47be9000be0b40a16938c7cc93"},"schema_version":"1.0","source":{"id":"2503.07824","kind":"arxiv","version":1}},"canonical_sha256":"41930227aceaddb6118dd6dc2e92278a76ccb67e719f4b0dd9fbbd617f653759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41930227aceaddb6118dd6dc2e92278a76ccb67e719f4b0dd9fbbd617f653759","first_computed_at":"2026-07-05T10:28:44.546782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:44.546782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kNzXScfj/QcLfHbi89B7+eLyaWQNkFRwgSITFWDydSZy6fEyIaKjfXlleYloVVWxHkHNgPgL2lqQvMYcqZ4EDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:44.547279Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.07824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6769226c4e6465d171d9b0c2189fa11c8f98a4d81bcf6b8f69c3ee44be4242b4","sha256:80a835a84395f3afc47ca6407f9e045de3cc3afa443cd45963be1c9227897aef"],"state_sha256":"d212880ce2bc823669e03a69875f1c4114e532f7bbb847bff67eaeb97f77db59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8Jz+o485wb2d5mmyyeo5g1j63cYajkgcKknWvMZkw0+E23KlekLzi024ZAbUbNBylhiMMGgqQ6EMt5PYhWfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:14:29.159355Z","bundle_sha256":"94834a7d13e06635e5d620ba45a8d46595eef8c85b4b0538c4b5addaab9ded10"}}