{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N6LTKRUTTV3C4LKWLZRLJYEEQE","short_pith_number":"pith:N6LTKRUT","schema_version":"1.0","canonical_sha256":"6f973546939d762e2d565e62b4e084813ac34156c876974f52ee176f4b823e0f","source":{"kind":"arxiv","id":"1711.02246","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.02246","created_at":"2026-05-18T00:31:08.449883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02246v1","created_at":"2026-05-18T00:31:08.449883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02246","created_at":"2026-05-18T00:31:08.449883+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6LTKRUTTV3C","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6LTKRUTTV3C4LKW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6LTKRUT","created_at":"2026-05-18T12:31:31.346846+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/N6LTKRUTTV3C4LKWLZRLJYEEQE","json":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE.json","graph_json":"https://pith.science/api/pith-number/N6LTKRUTTV3C4LKWLZRLJYEEQE/graph.json","events_json":"https://pith.science/api/pith-number/N6LTKRUTTV3C4LKWLZRLJYEEQE/events.json","paper":"https://pith.science/paper/N6LTKRUT"},"agent_actions":{"view_html":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE","download_json":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE.json","view_paper":"https://pith.science/paper/N6LTKRUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02246&json=true","fetch_graph":"https://pith.science/api/pith-number/N6LTKRUTTV3C4LKWLZRLJYEEQE/graph.json","fetch_events":"https://pith.science/api/pith-number/N6LTKRUTTV3C4LKWLZRLJYEEQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/action/storage_attestation","attest_author":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/action/author_attestation","sign_citation":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/action/citation_signature","submit_replication":"https://pith.science/pith/N6LTKRUTTV3C4LKWLZRLJYEEQE/action/replication_record"}},"created_at":"2026-05-18T00:31:08.449883+00:00","updated_at":"2026-05-18T00:31:08.449883+00:00"}