{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N6LTKRUTTV3C4LKWLZRLJYEEQE","short_pith_number":"pith:N6LTKRUT","canonical_record":{"source":{"id":"1711.02246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-07T01:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"8ba702b22b2df867d60719bca24ec56733dc00a7a6f0c9aa5e9e905890fd02ff","abstract_canon_sha256":"41ed0cc460a31145b9de4b39fd01574ec098d903b621f8e9b10f34513cbbfd2d"},"schema_version":"1.0"},"canonical_sha256":"6f973546939d762e2d565e62b4e084813ac34156c876974f52ee176f4b823e0f","source":{"kind":"arxiv","id":"1711.02246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02246","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02246v1","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02246","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"pith_short_12","alias_value":"N6LTKRUTTV3C","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N6LTKRUTTV3C4LKW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N6LTKRUT","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N6LTKRUTTV3C4LKWLZRLJYEEQE","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-07T01:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"8ba702b22b2df867d60719bca24ec56733dc00a7a6f0c9aa5e9e905890fd02ff","abstract_canon_sha256":"41ed0cc460a31145b9de4b39fd01574ec098d903b621f8e9b10f34513cbbfd2d"},"schema_version":"1.0"},"canonical_sha256":"6f973546939d762e2d565e62b4e084813ac34156c876974f52ee176f4b823e0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:08.450453Z","signature_b64":"BRCJjcdTi5gf+aIuigtYcfdGg/sSbSXQ/l1E9R1tNizP/jyx95z8FqD8W3f65bBxrye7QrQuxlXCF+R345W0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f973546939d762e2d565e62b4e084813ac34156c876974f52ee176f4b823e0f","last_reissued_at":"2026-05-18T00:31:08.449782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:08.449782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02246","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-05-18T00:31:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qkgxnf19ucHJesTlM7V2Q2umn9iSBd6lYhgYZWLlGd3Hy0BSDgJZCruxLVWvWKrTU+nh56dC3I8Hfj3+HrbeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:50:36.660913Z"},"content_sha256":"27cc9e92422ba7e4802eb4b9e895abe870e9ac08d9ae21511b416e1095e97990","schema_version":"1.0","event_id":"sha256:27cc9e92422ba7e4802eb4b9e895abe870e9ac08d9ae21511b416e1095e97990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N6LTKRUTTV3C4LKWLZRLJYEEQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Theory of Slicing for Probabilistic Control-Flow Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Anindya Banerjee, Torben Amtoft","submitted_at":"2017-11-07T01:21:33Z","abstract_excerpt":"We present a theory for slicing probabilistic imperative programs -- containing random assignments, and ``observe'' statements (for conditioning) -- represented as probabilistic control-flow graphs (pCFGs) whose nodes modify probability distributions.\n  We show that such a representation allows direct adaptation of standard machinery such as data and control dependence, postdominators, relevant variables, etc to the probabilistic setting. We separate the specification of slicing from its implementation: first we develop syntactic conditions that a slice must satisfy; next we prove that any suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02246","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"},"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:31:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NteVEZbldPPOi4h/U/7xSJOBhHFUajgV12/DRrGV3h1MPMTladHBdGVN8+f9DyTxYYp1ujYQTQTueXwVHRotDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:50:36.661440Z"},"content_sha256":"acdd02793783e913c4bafc828569717adc1368a4bcd80752997dfc31ce784287","schema_version":"1.0","event_id":"sha256:acdd02793783e913c4bafc828569717adc1368a4bcd80752997dfc31ce784287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/bundle.json","state_url":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/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-31T19:50:36Z","links":{"resolver":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE","bundle":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/bundle.json","state":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N6LTKRUTTV3C4LKWLZRLJYEEQE","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":"41ed0cc460a31145b9de4b39fd01574ec098d903b621f8e9b10f34513cbbfd2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-07T01:21:33Z","title_canon_sha256":"8ba702b22b2df867d60719bca24ec56733dc00a7a6f0c9aa5e9e905890fd02ff"},"schema_version":"1.0","source":{"id":"1711.02246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02246","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02246v1","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02246","created_at":"2026-05-18T00:31:08Z"},{"alias_kind":"pith_short_12","alias_value":"N6LTKRUTTV3C","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N6LTKRUTTV3C4LKW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N6LTKRUT","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:acdd02793783e913c4bafc828569717adc1368a4bcd80752997dfc31ce784287","target":"graph","created_at":"2026-05-18T00:31:08Z","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 present a theory for slicing probabilistic imperative programs -- containing random assignments, and ``observe'' statements (for conditioning) -- represented as probabilistic control-flow graphs (pCFGs) whose nodes modify probability distributions.\n  We show that such a representation allows direct adaptation of standard machinery such as data and control dependence, postdominators, relevant variables, etc to the probabilistic setting. We separate the specification of slicing from its implementation: first we develop syntactic conditions that a slice must satisfy; next we prove that any suc","authors_text":"Anindya Banerjee, Torben Amtoft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-07T01:21:33Z","title":"A Theory of Slicing for Probabilistic Control-Flow Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02246","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:27cc9e92422ba7e4802eb4b9e895abe870e9ac08d9ae21511b416e1095e97990","target":"record","created_at":"2026-05-18T00:31:08Z","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":"41ed0cc460a31145b9de4b39fd01574ec098d903b621f8e9b10f34513cbbfd2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-11-07T01:21:33Z","title_canon_sha256":"8ba702b22b2df867d60719bca24ec56733dc00a7a6f0c9aa5e9e905890fd02ff"},"schema_version":"1.0","source":{"id":"1711.02246","kind":"arxiv","version":1}},"canonical_sha256":"6f973546939d762e2d565e62b4e084813ac34156c876974f52ee176f4b823e0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f973546939d762e2d565e62b4e084813ac34156c876974f52ee176f4b823e0f","first_computed_at":"2026-05-18T00:31:08.449782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:08.449782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BRCJjcdTi5gf+aIuigtYcfdGg/sSbSXQ/l1E9R1tNizP/jyx95z8FqD8W3f65bBxrye7QrQuxlXCF+R345W0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:08.450453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27cc9e92422ba7e4802eb4b9e895abe870e9ac08d9ae21511b416e1095e97990","sha256:acdd02793783e913c4bafc828569717adc1368a4bcd80752997dfc31ce784287"],"state_sha256":"fcf19526e67537656aebb2fb42d5c103751ce4c25cdec5a272644376e76124ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paKI9RU1o7sCrFyPl0xYqskrYPwAcxmd7TV9/v5MSUBiEvNiTvP2X3LOgAWKKIsxAPTVsj5Zs7SA4zC1ApwjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:50:36.665053Z","bundle_sha256":"142ec9bc56936654f0b7d55e7dce613e534027af9d2fb9a630c5bef0f6dbfb5e"}}