{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KAOXTZXJQLGPHJTQ7R46CZJQSC","short_pith_number":"pith:KAOXTZXJ","canonical_record":{"source":{"id":"1509.02151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-07T19:35:42Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f21f75bea75d603ad152e52f8a1264841e3def6b3203abce4e8b1f192f93446c","abstract_canon_sha256":"86a176769189d46e6681349362c22a6d318eeda8797fbc1117bdccbae07268e5"},"schema_version":"1.0"},"canonical_sha256":"501d79e6e982ccf3a670fc79e1653090b2e7fa4651db03203bcb79e7e5c3479f","source":{"kind":"arxiv","id":"1509.02151","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02151","created_at":"2026-05-18T01:33:41Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02151v2","created_at":"2026-05-18T01:33:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02151","created_at":"2026-05-18T01:33:41Z"},{"alias_kind":"pith_short_12","alias_value":"KAOXTZXJQLGP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAOXTZXJQLGPHJTQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAOXTZXJ","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KAOXTZXJQLGPHJTQ7R46CZJQSC","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-07T19:35:42Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f21f75bea75d603ad152e52f8a1264841e3def6b3203abce4e8b1f192f93446c","abstract_canon_sha256":"86a176769189d46e6681349362c22a6d318eeda8797fbc1117bdccbae07268e5"},"schema_version":"1.0"},"canonical_sha256":"501d79e6e982ccf3a670fc79e1653090b2e7fa4651db03203bcb79e7e5c3479f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:41.545926Z","signature_b64":"1qrWxmBQ4l8+LsbJc+UlCUYN/BXpD6c7MLUAjftUn/aCRMW4RKNYM1QL+PbnfjSTkX7Q5jMecNa1J8zhhKZAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"501d79e6e982ccf3a670fc79e1653090b2e7fa4651db03203bcb79e7e5c3479f","last_reissued_at":"2026-05-18T01:33:41.545285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:41.545285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02151","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-18T01:33:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYLFTua9rzvs5EG31ShmxSrVo9Vd4auvqvrwZD6vUdMdemt8pnlwSoZiHWp3CF8NjzXbcxMhC4sOM45zBV/HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:01:41.027268Z"},"content_sha256":"59b7f3558e090b1f61afe27bc5df66cf63b329883d87ccaaa6044ded7d478ffe","schema_version":"1.0","event_id":"sha256:59b7f3558e090b1f61afe27bc5df66cf63b329883d87ccaaa6044ded7d478ffe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KAOXTZXJQLGPHJTQ7R46CZJQSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Andreas Stuhlm\\\"uller, Daniel Ritchie, Noah D. Goodman","submitted_at":"2015-09-07T19:35:42Z","abstract_excerpt":"Lightweight, source-to-source transformation approaches to implementing MCMC for probabilistic programming languages are popular for their simplicity, support of existing deterministic code, and ability to execute on existing fast runtimes. However, they are also slow, requiring a complete re-execution of the program on every Metropolis Hastings proposal. We present a new extension to the lightweight approach, C3, which enables efficient, incrementalized re-execution of MH proposals. C3 is based on two core ideas: transforming probabilistic programs into continuation passing style (CPS), and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02151","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-18T01:33:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcqEKIqY/33xt1//upvkHVHyVNFm6FnLbkNbvaQ+q7UNqKKuNXcCoATRNFKtyb46O3jEqW2HdBmgQ+VpPnxpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:01:41.028014Z"},"content_sha256":"0fdd2e06a7ef05c401d193e0febd1a488049e4a7f4ff9b906e4998222dd3c949","schema_version":"1.0","event_id":"sha256:0fdd2e06a7ef05c401d193e0febd1a488049e4a7f4ff9b906e4998222dd3c949"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC/bundle.json","state_url":"https://pith.science/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC/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-23T14:01:41Z","links":{"resolver":"https://pith.science/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC","bundle":"https://pith.science/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC/bundle.json","state":"https://pith.science/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAOXTZXJQLGPHJTQ7R46CZJQSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KAOXTZXJQLGPHJTQ7R46CZJQSC","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":"86a176769189d46e6681349362c22a6d318eeda8797fbc1117bdccbae07268e5","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-07T19:35:42Z","title_canon_sha256":"f21f75bea75d603ad152e52f8a1264841e3def6b3203abce4e8b1f192f93446c"},"schema_version":"1.0","source":{"id":"1509.02151","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02151","created_at":"2026-05-18T01:33:41Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02151v2","created_at":"2026-05-18T01:33:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02151","created_at":"2026-05-18T01:33:41Z"},{"alias_kind":"pith_short_12","alias_value":"KAOXTZXJQLGP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAOXTZXJQLGPHJTQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAOXTZXJ","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:0fdd2e06a7ef05c401d193e0febd1a488049e4a7f4ff9b906e4998222dd3c949","target":"graph","created_at":"2026-05-18T01:33:41Z","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":"Lightweight, source-to-source transformation approaches to implementing MCMC for probabilistic programming languages are popular for their simplicity, support of existing deterministic code, and ability to execute on existing fast runtimes. However, they are also slow, requiring a complete re-execution of the program on every Metropolis Hastings proposal. We present a new extension to the lightweight approach, C3, which enables efficient, incrementalized re-execution of MH proposals. C3 is based on two core ideas: transforming probabilistic programs into continuation passing style (CPS), and c","authors_text":"Andreas Stuhlm\\\"uller, Daniel Ritchie, Noah D. Goodman","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-07T19:35:42Z","title":"C3: Lightweight Incrementalized MCMC for Probabilistic Programs using Continuations and Callsite Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02151","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:59b7f3558e090b1f61afe27bc5df66cf63b329883d87ccaaa6044ded7d478ffe","target":"record","created_at":"2026-05-18T01:33:41Z","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":"86a176769189d46e6681349362c22a6d318eeda8797fbc1117bdccbae07268e5","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-07T19:35:42Z","title_canon_sha256":"f21f75bea75d603ad152e52f8a1264841e3def6b3203abce4e8b1f192f93446c"},"schema_version":"1.0","source":{"id":"1509.02151","kind":"arxiv","version":2}},"canonical_sha256":"501d79e6e982ccf3a670fc79e1653090b2e7fa4651db03203bcb79e7e5c3479f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"501d79e6e982ccf3a670fc79e1653090b2e7fa4651db03203bcb79e7e5c3479f","first_computed_at":"2026-05-18T01:33:41.545285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:41.545285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1qrWxmBQ4l8+LsbJc+UlCUYN/BXpD6c7MLUAjftUn/aCRMW4RKNYM1QL+PbnfjSTkX7Q5jMecNa1J8zhhKZAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:41.545926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02151","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b7f3558e090b1f61afe27bc5df66cf63b329883d87ccaaa6044ded7d478ffe","sha256:0fdd2e06a7ef05c401d193e0febd1a488049e4a7f4ff9b906e4998222dd3c949"],"state_sha256":"589db3b6c054059bd80da13131d59bfe5fab14c723214783fed20cbf24bef520"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEqkGdBnjtBNiC3MXV0Di1ZgWAH2aup7quZcPLymcvG0YYlZeRafefecc01SgBeHMgvcGsgqP/+zjSH2L6QaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T14:01:41.031772Z","bundle_sha256":"18033d0249bc767ca8d31f294342ad8c55ae2ae2f152903724dbc3a6a6fd907d"}}