{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AWRJD56KXF35SMQW5KK5AQPPEC","short_pith_number":"pith:AWRJD56K","schema_version":"1.0","canonical_sha256":"05a291f7cab977d93216ea95d041ef20830efb9671766b1a13ff11d30805a5b6","source":{"kind":"arxiv","id":"2305.04638","version":1},"attestation_state":"computed","paper":{"title":"Learning Good Interventions in Causal Graphs via Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ayush Sawarni, Gaurav Sinha, Rahul Madhavan, Siddharth Barman","submitted_at":"2023-05-08T11:35:22Z","abstract_excerpt":"We study the causal bandit problem that entails identifying a near-optimal intervention from a specified set $A$ of (possibly non-atomic) interventions over a given causal graph. Here, an optimal intervention in ${A}$ is one that maximizes the expected value for a designated reward variable in the graph, and we use the standard notion of simple regret to quantify near optimality. Considering Bernoulli random variables and for causal graphs on $N$ vertices with constant in-degree, prior work has achieved a worst case guarantee of $\\widetilde{O} (N/\\sqrt{T})$ for simple regret. The current work "},"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":"2305.04638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-08T11:35:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3ef56486e64787722578f6363814274941263bdc532d7d6c5f22137fc3cec30c","abstract_canon_sha256":"2ce2d76236ac6fec0350fe463502ee650790853b546a4cf6ddb2f01f33b50c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:52.228115Z","signature_b64":"P0BGB6pQSlBzCvRA+tPZBpCYLY22jzsOf3Jgc/leLPfayqwyZI45lQcqKqlTr+FKlv+46gUeIu3lbk1DO8TICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05a291f7cab977d93216ea95d041ef20830efb9671766b1a13ff11d30805a5b6","last_reissued_at":"2026-07-05T06:07:52.227712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:52.227712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Good Interventions in Causal Graphs via Covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ayush Sawarni, Gaurav Sinha, Rahul Madhavan, Siddharth Barman","submitted_at":"2023-05-08T11:35:22Z","abstract_excerpt":"We study the causal bandit problem that entails identifying a near-optimal intervention from a specified set $A$ of (possibly non-atomic) interventions over a given causal graph. Here, an optimal intervention in ${A}$ is one that maximizes the expected value for a designated reward variable in the graph, and we use the standard notion of simple regret to quantify near optimality. Considering Bernoulli random variables and for causal graphs on $N$ vertices with constant in-degree, prior work has achieved a worst case guarantee of $\\widetilde{O} (N/\\sqrt{T})$ for simple regret. The current work "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04638","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/2305.04638/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.04638","created_at":"2026-07-05T06:07:52.227764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04638v1","created_at":"2026-07-05T06:07:52.227764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04638","created_at":"2026-07-05T06:07:52.227764+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWRJD56KXF35","created_at":"2026-07-05T06:07:52.227764+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWRJD56KXF35SMQW","created_at":"2026-07-05T06:07:52.227764+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWRJD56K","created_at":"2026-07-05T06:07:52.227764+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/AWRJD56KXF35SMQW5KK5AQPPEC","json":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC.json","graph_json":"https://pith.science/api/pith-number/AWRJD56KXF35SMQW5KK5AQPPEC/graph.json","events_json":"https://pith.science/api/pith-number/AWRJD56KXF35SMQW5KK5AQPPEC/events.json","paper":"https://pith.science/paper/AWRJD56K"},"agent_actions":{"view_html":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC","download_json":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC.json","view_paper":"https://pith.science/paper/AWRJD56K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04638&json=true","fetch_graph":"https://pith.science/api/pith-number/AWRJD56KXF35SMQW5KK5AQPPEC/graph.json","fetch_events":"https://pith.science/api/pith-number/AWRJD56KXF35SMQW5KK5AQPPEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC/action/storage_attestation","attest_author":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC/action/author_attestation","sign_citation":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC/action/citation_signature","submit_replication":"https://pith.science/pith/AWRJD56KXF35SMQW5KK5AQPPEC/action/replication_record"}},"created_at":"2026-07-05T06:07:52.227764+00:00","updated_at":"2026-07-05T06:07:52.227764+00:00"}