{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:67PL5PUERUM4GOWKR2R5BLPG4U","short_pith_number":"pith:67PL5PUE","canonical_record":{"source":{"id":"1701.02789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-10T21:26:03Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b64bdcef147a7f4edb877ed12fbd3a5efa053099ac7b4ed65ba17b7b410ca91a","abstract_canon_sha256":"6f5e3f121cd28fcbaea83502d7df948afba7b74660b65836d9d036430d750c6b"},"schema_version":"1.0"},"canonical_sha256":"f7debebe848d19c33aca8ea3d0ade6e51385fa6cb36a8fe59976cb02ab259002","source":{"kind":"arxiv","id":"1701.02789","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02789","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02789v3","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02789","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"67PL5PUERUM4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67PL5PUERUM4GOWK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67PL5PUE","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:67PL5PUERUM4GOWKR2R5BLPG4U","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-10T21:26:03Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"b64bdcef147a7f4edb877ed12fbd3a5efa053099ac7b4ed65ba17b7b410ca91a","abstract_canon_sha256":"6f5e3f121cd28fcbaea83502d7df948afba7b74660b65836d9d036430d750c6b"},"schema_version":"1.0"},"canonical_sha256":"f7debebe848d19c33aca8ea3d0ade6e51385fa6cb36a8fe59976cb02ab259002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:59.513845Z","signature_b64":"GiqFlvttHxfRTZvbQBlFvYrRCGpNF5Mj/OurhY+wBzYpDIcO4RUeCswo6iCK7QAptTB+OO4MeXpwgZJlgJkdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7debebe848d19c33aca8ea3d0ade6e51385fa6cb36a8fe59976cb02ab259002","last_reissued_at":"2026-05-18T00:48:59.513241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:59.513241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02789","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-18T00:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onsJs2v70xPR4ISiIGHCiu/LpjU8J+WkmZV3JNrmsHgBMNjNPNTL6kwLZ4RMc1mCmgKQlv2OLVP1QK2Rh9UxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:09:35.911083Z"},"content_sha256":"80fa77bc87738e21d4cb03ffd3b066eb30b98f8e0e1a0d519ea05911440b98dc","schema_version":"1.0","event_id":"sha256:80fa77bc87738e21d4cb03ffd3b066eb30b98f8e0e1a0d519ea05911440b98dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:67PL5PUERUM4GOWKR2R5BLPG4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying Best Interventions through Online Importance Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Rajat Sen, Sanjay Shakkottai","submitted_at":"2017-01-10T21:26:03Z","abstract_excerpt":"Motivated by applications in computational advertising and systems biology, we consider the problem of identifying the best out of several possible soft interventions at a source node $V$ in an acyclic causal directed graph, to maximize the expected value of a target node $Y$ (located downstream of $V$). Our setting imposes a fixed total budget for sampling under various interventions, along with cost constraints on different types of interventions. We pose this as a best arm identification bandit problem with $K$ arms where each arm is a soft intervention at $V,$ and leverage the information "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02789","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-18T00:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwdcLsWQCNsPl8plEjs4wPGJxVJ7WmC0mBVumw1Um9EGLDQMEQXdCjV0hfjqQyaeJDc+gfXRjM5k4HViP94fDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:09:35.911436Z"},"content_sha256":"9add42d84748b17d46fc6517ea90e7e1dd755f7f7b08fc6a4df398cbc65b4e0e","schema_version":"1.0","event_id":"sha256:9add42d84748b17d46fc6517ea90e7e1dd755f7f7b08fc6a4df398cbc65b4e0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67PL5PUERUM4GOWKR2R5BLPG4U/bundle.json","state_url":"https://pith.science/pith/67PL5PUERUM4GOWKR2R5BLPG4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67PL5PUERUM4GOWKR2R5BLPG4U/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-05-31T21:09:35Z","links":{"resolver":"https://pith.science/pith/67PL5PUERUM4GOWKR2R5BLPG4U","bundle":"https://pith.science/pith/67PL5PUERUM4GOWKR2R5BLPG4U/bundle.json","state":"https://pith.science/pith/67PL5PUERUM4GOWKR2R5BLPG4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67PL5PUERUM4GOWKR2R5BLPG4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:67PL5PUERUM4GOWKR2R5BLPG4U","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":"6f5e3f121cd28fcbaea83502d7df948afba7b74660b65836d9d036430d750c6b","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-10T21:26:03Z","title_canon_sha256":"b64bdcef147a7f4edb877ed12fbd3a5efa053099ac7b4ed65ba17b7b410ca91a"},"schema_version":"1.0","source":{"id":"1701.02789","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02789","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02789v3","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02789","created_at":"2026-05-18T00:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"67PL5PUERUM4","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67PL5PUERUM4GOWK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67PL5PUE","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:9add42d84748b17d46fc6517ea90e7e1dd755f7f7b08fc6a4df398cbc65b4e0e","target":"graph","created_at":"2026-05-18T00:48:59Z","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":"Motivated by applications in computational advertising and systems biology, we consider the problem of identifying the best out of several possible soft interventions at a source node $V$ in an acyclic causal directed graph, to maximize the expected value of a target node $Y$ (located downstream of $V$). Our setting imposes a fixed total budget for sampling under various interventions, along with cost constraints on different types of interventions. We pose this as a best arm identification bandit problem with $K$ arms where each arm is a soft intervention at $V,$ and leverage the information ","authors_text":"Alexandros G. Dimakis, Karthikeyan Shanmugam, Rajat Sen, Sanjay Shakkottai","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-10T21:26:03Z","title":"Identifying Best Interventions through Online Importance Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02789","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:80fa77bc87738e21d4cb03ffd3b066eb30b98f8e0e1a0d519ea05911440b98dc","target":"record","created_at":"2026-05-18T00:48:59Z","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":"6f5e3f121cd28fcbaea83502d7df948afba7b74660b65836d9d036430d750c6b","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-10T21:26:03Z","title_canon_sha256":"b64bdcef147a7f4edb877ed12fbd3a5efa053099ac7b4ed65ba17b7b410ca91a"},"schema_version":"1.0","source":{"id":"1701.02789","kind":"arxiv","version":3}},"canonical_sha256":"f7debebe848d19c33aca8ea3d0ade6e51385fa6cb36a8fe59976cb02ab259002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7debebe848d19c33aca8ea3d0ade6e51385fa6cb36a8fe59976cb02ab259002","first_computed_at":"2026-05-18T00:48:59.513241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:59.513241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GiqFlvttHxfRTZvbQBlFvYrRCGpNF5Mj/OurhY+wBzYpDIcO4RUeCswo6iCK7QAptTB+OO4MeXpwgZJlgJkdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:59.513845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02789","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80fa77bc87738e21d4cb03ffd3b066eb30b98f8e0e1a0d519ea05911440b98dc","sha256:9add42d84748b17d46fc6517ea90e7e1dd755f7f7b08fc6a4df398cbc65b4e0e"],"state_sha256":"c290b042eacc59c593df1aa980286d188888de466ec4ae0ff65d3aa16a16e132"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0C1dzIHUPkucv5BfRu3ipjweCgqZlpIfdCOs3xdcp6+ZRdtpSBkWK/TyYsZkKKxW5SxOglc2btOM8DbphPqxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:09:35.913645Z","bundle_sha256":"718fa36e22c952416b75d52b20dbc88d98bd907dab3f7f54d9c81324080bfe92"}}