{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RQOZ4F5B66PXQQ33QT5KFS3NGX","short_pith_number":"pith:RQOZ4F5B","canonical_record":{"source":{"id":"1709.03625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T23:43:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8873175230713c935901cd1f9fa3a21e24e1e19b8c23ca35dfd8c8ca5d459bb2","abstract_canon_sha256":"c0975df7bc9d8edf9c85a4de6bd0dea3160c0bed1e4862c243142495e248932c"},"schema_version":"1.0"},"canonical_sha256":"8c1d9e17a1f79f78437b84faa2cb6d35fe514de22682112861d26fa12c52109d","source":{"kind":"arxiv","id":"1709.03625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03625","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03625v2","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03625","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"RQOZ4F5B66PX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQOZ4F5B66PXQQ33","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQOZ4F5B","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RQOZ4F5B66PXQQ33QT5KFS3NGX","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T23:43:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"8873175230713c935901cd1f9fa3a21e24e1e19b8c23ca35dfd8c8ca5d459bb2","abstract_canon_sha256":"c0975df7bc9d8edf9c85a4de6bd0dea3160c0bed1e4862c243142495e248932c"},"schema_version":"1.0"},"canonical_sha256":"8c1d9e17a1f79f78437b84faa2cb6d35fe514de22682112861d26fa12c52109d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.750875Z","signature_b64":"KsngS/BKjdEjOJsn5+wUx7Bifjik5UyHoITJhR07Wsl5IfJmo3HDc3qzAArhDHiFu3E5DugTO+A8jC+8IIpGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c1d9e17a1f79f78437b84faa2cb6d35fe514de22682112861d26fa12c52109d","last_reissued_at":"2026-05-18T00:09:05.750355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.750355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03625","source_version":2,"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:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DhFzhRoZhrq1qia9l6EC52wYcYZdvNTbMJCJbYnvth8SR0tgqwMzavGO3XHZ5YtDDkdOEQs0bRyPlEbKiqf2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:39:21.099589Z"},"content_sha256":"271f3fb404fa3edcbb550bfd4bad7165e5432693a92ece3043ca6bf6d359d45d","schema_version":"1.0","event_id":"sha256:271f3fb404fa3edcbb550bfd4bad7165e5432693a92ece3043ca6bf6d359d45d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RQOZ4F5B66PXQQ33QT5KFS3NGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budgeted Experiment Design for Causal Structure Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"AmirEmad Ghassami, Elias Bareinboim, Negar Kiyavash, Saber Salehkaleybar","submitted_at":"2017-09-11T23:43:30Z","abstract_excerpt":"We study the problem of causal structure learning when the experimenter is limited to perform at most $k$ non-adaptive experiments of size $1$. We formulate the problem of finding the best intervention target set as an optimization problem, which aims to maximize the average number of edges whose directions are resolved. We prove that the corresponding objective function is submodular and a greedy algorithm suffices to achieve $(1-\\frac{1}{e})$-approximation of the optimal value. We further present an accelerated variant of the greedy algorithm, which can lead to orders of magnitude performanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03625","kind":"arxiv","version":2},"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:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTymUEEUZLnYXFib6rknGtf/4byeMpOI+z6UdjlJVvYE3Mh+a3/vws/UVuQOIoRWvEJK/Ayq5/N+QrqzZIkZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:39:21.100311Z"},"content_sha256":"d27d7d8c180a379d72d93291f2d04df8e0b0851f7b0b11b996f4a9081de96dd9","schema_version":"1.0","event_id":"sha256:d27d7d8c180a379d72d93291f2d04df8e0b0851f7b0b11b996f4a9081de96dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX/bundle.json","state_url":"https://pith.science/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX/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-07T01:39:21Z","links":{"resolver":"https://pith.science/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX","bundle":"https://pith.science/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX/bundle.json","state":"https://pith.science/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQOZ4F5B66PXQQ33QT5KFS3NGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RQOZ4F5B66PXQQ33QT5KFS3NGX","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":"c0975df7bc9d8edf9c85a4de6bd0dea3160c0bed1e4862c243142495e248932c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T23:43:30Z","title_canon_sha256":"8873175230713c935901cd1f9fa3a21e24e1e19b8c23ca35dfd8c8ca5d459bb2"},"schema_version":"1.0","source":{"id":"1709.03625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03625","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03625v2","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03625","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"RQOZ4F5B66PX","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQOZ4F5B66PXQQ33","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQOZ4F5B","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d27d7d8c180a379d72d93291f2d04df8e0b0851f7b0b11b996f4a9081de96dd9","target":"graph","created_at":"2026-05-18T00:09:05Z","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 study the problem of causal structure learning when the experimenter is limited to perform at most $k$ non-adaptive experiments of size $1$. We formulate the problem of finding the best intervention target set as an optimization problem, which aims to maximize the average number of edges whose directions are resolved. We prove that the corresponding objective function is submodular and a greedy algorithm suffices to achieve $(1-\\frac{1}{e})$-approximation of the optimal value. We further present an accelerated variant of the greedy algorithm, which can lead to orders of magnitude performanc","authors_text":"AmirEmad Ghassami, Elias Bareinboim, Negar Kiyavash, Saber Salehkaleybar","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T23:43:30Z","title":"Budgeted Experiment Design for Causal Structure Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03625","kind":"arxiv","version":2},"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:271f3fb404fa3edcbb550bfd4bad7165e5432693a92ece3043ca6bf6d359d45d","target":"record","created_at":"2026-05-18T00:09:05Z","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":"c0975df7bc9d8edf9c85a4de6bd0dea3160c0bed1e4862c243142495e248932c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T23:43:30Z","title_canon_sha256":"8873175230713c935901cd1f9fa3a21e24e1e19b8c23ca35dfd8c8ca5d459bb2"},"schema_version":"1.0","source":{"id":"1709.03625","kind":"arxiv","version":2}},"canonical_sha256":"8c1d9e17a1f79f78437b84faa2cb6d35fe514de22682112861d26fa12c52109d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c1d9e17a1f79f78437b84faa2cb6d35fe514de22682112861d26fa12c52109d","first_computed_at":"2026-05-18T00:09:05.750355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:05.750355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KsngS/BKjdEjOJsn5+wUx7Bifjik5UyHoITJhR07Wsl5IfJmo3HDc3qzAArhDHiFu3E5DugTO+A8jC+8IIpGDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:05.750875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:271f3fb404fa3edcbb550bfd4bad7165e5432693a92ece3043ca6bf6d359d45d","sha256:d27d7d8c180a379d72d93291f2d04df8e0b0851f7b0b11b996f4a9081de96dd9"],"state_sha256":"168b79f9c46ecac6e39f55bcc32cf49446ea2d8c8f1478ddebd84d00351dce0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxEH4ZQBt1jMeNWl2zDyl9pfGHW9HYQ6ZUIFyqZYewAygJ7Lw6cBa3SuHHkMJkcOw03sgsrifrieHDvGdcVqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:39:21.104282Z","bundle_sha256":"ecd95041dcfa16b6ba7cb1bdef2222c9e5dad7a8491d47f747a515719845229e"}}