{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6YQMLSF6M23GJTVQHCGJ3HDPAC","short_pith_number":"pith:6YQMLSF6","schema_version":"1.0","canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","source":{"kind":"arxiv","id":"1806.02252","version":1},"attestation_state":"computed","paper":{"title":"Causal Bandits with Propagating Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Shinji Ito, Takuro Fukunaga","submitted_at":"2018-06-06T15:39:20Z","abstract_excerpt":"Bandit is a framework for designing sequential experiments. In each experiment, a learner selects an arm $A \\in \\mathcal{A}$ and obtains an observation corresponding to $A$. Theoretically, the tight regret lower-bound for the general bandit is polynomial with respect to the number of arms $|\\mathcal{A}|$. This makes bandit incapable of handling an exponentially large number of arms, hence the bandit problem with side-information is often considered to overcome this lower bound. Recently, a bandit framework over a causal graph was introduced, where the structure of the causal graph is available"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.02252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-06T15:39:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4a4b2242456c955e1796ac939fb30a7a0076d986a200722df56f7cd4643b266f","abstract_canon_sha256":"95e827c294fed2877faafe2ebdabb9eb439faab0cfe1d02f8da0c4fa90539485"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:02.118192Z","signature_b64":"YD0cC6gJ6+weA60ooUEl82AfmCF66Awe7NGuZYnfN4e8x9F6/TeQ8hkpF5tH3hWA0zoGspHgIhzX4pSSQ0KIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f620c5c8be66b664ceb0388c9d9c6f00acec68f8e5efe1279acc3378cd8384f7","last_reissued_at":"2026-05-18T00:14:02.117464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:02.117464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Causal Bandits with Propagating Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Ken-ichi Kawarabayashi, Naonori Kakimura, Shinji Ito, Takuro Fukunaga","submitted_at":"2018-06-06T15:39:20Z","abstract_excerpt":"Bandit is a framework for designing sequential experiments. In each experiment, a learner selects an arm $A \\in \\mathcal{A}$ and obtains an observation corresponding to $A$. Theoretically, the tight regret lower-bound for the general bandit is polynomial with respect to the number of arms $|\\mathcal{A}|$. This makes bandit incapable of handling an exponentially large number of arms, hence the bandit problem with side-information is often considered to overcome this lower bound. Recently, a bandit framework over a causal graph was introduced, where the structure of the causal graph is available"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02252","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.02252","created_at":"2026-05-18T00:14:02.117576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02252v1","created_at":"2026-05-18T00:14:02.117576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02252","created_at":"2026-05-18T00:14:02.117576+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YQMLSF6M23G","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YQMLSF6M23GJTVQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YQMLSF6","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC","json":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC.json","graph_json":"https://pith.science/api/pith-number/6YQMLSF6M23GJTVQHCGJ3HDPAC/graph.json","events_json":"https://pith.science/api/pith-number/6YQMLSF6M23GJTVQHCGJ3HDPAC/events.json","paper":"https://pith.science/paper/6YQMLSF6"},"agent_actions":{"view_html":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC","download_json":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC.json","view_paper":"https://pith.science/paper/6YQMLSF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02252&json=true","fetch_graph":"https://pith.science/api/pith-number/6YQMLSF6M23GJTVQHCGJ3HDPAC/graph.json","fetch_events":"https://pith.science/api/pith-number/6YQMLSF6M23GJTVQHCGJ3HDPAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/action/storage_attestation","attest_author":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/action/author_attestation","sign_citation":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/action/citation_signature","submit_replication":"https://pith.science/pith/6YQMLSF6M23GJTVQHCGJ3HDPAC/action/replication_record"}},"created_at":"2026-05-18T00:14:02.117576+00:00","updated_at":"2026-05-18T00:14:02.117576+00:00"}