{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RXUDGOYDVZUWF67EI5DIIUHKQY","short_pith_number":"pith:RXUDGOYD","canonical_record":{"source":{"id":"1805.06562","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-17T00:55:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"060526778583430805d8629777daa5988ecd7e80e56453de080039e648c7b230","abstract_canon_sha256":"08b7515f37a359b4e9d790c572e6aeb3651a94653e66c43c34fc19a0696c1e69"},"schema_version":"1.0"},"canonical_sha256":"8de8333b03ae6962fbe447468450ea863bb3b5bd4c5445e47e0814a92a5ad109","source":{"kind":"arxiv","id":"1805.06562","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06562","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06562v5","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06562","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"RXUDGOYDVZUW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXUDGOYDVZUWF67E","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXUDGOYD","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RXUDGOYDVZUWF67EI5DIIUHKQY","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06562","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-17T00:55:43Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"060526778583430805d8629777daa5988ecd7e80e56453de080039e648c7b230","abstract_canon_sha256":"08b7515f37a359b4e9d790c572e6aeb3651a94653e66c43c34fc19a0696c1e69"},"schema_version":"1.0"},"canonical_sha256":"8de8333b03ae6962fbe447468450ea863bb3b5bd4c5445e47e0814a92a5ad109","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:46.577107Z","signature_b64":"U/3RF1uISymEJt/X3V1dRcJiYGJeI74vKrooIp0yK8X6MyPQsm0Q4Ni/ocFkI6Q7637NMUiw6EoPgkDH98BsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de8333b03ae6962fbe447468450ea863bb3b5bd4c5445e47e0814a92a5ad109","last_reissued_at":"2026-05-17T23:41:46.576379Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:46.576379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06562","source_version":5,"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-17T23:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oOAIcmA3toufhXI8clm175xVk29YX4AzQYCaVdBuMk4UNSu3G5mm6t20vmiwZBj7wvlO8bG94mHN9yer2K7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:37:44.424200Z"},"content_sha256":"03498b7ab3da87708c4dc3e677a421dbc4e6a2b7c4b08a47bf60409496172c8f","schema_version":"1.0","event_id":"sha256:03498b7ab3da87708c4dc3e677a421dbc4e6a2b7c4b08a47bf60409496172c8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RXUDGOYDVZUWF67EI5DIIUHKQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From high-level inference algorithms to efficient code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.PL","authors_text":"Chung-chieh Shan, Jacques Carette, Praveen Narayanan, Rajan Walia, Sam Tobin-Hochstadt","submitted_at":"2018-05-17T00:55:43Z","abstract_excerpt":"Probabilistic programming languages are valuable because they allow domain experts to express probabilistic models and inference algorithms without worrying about irrelevant details. However, for decades there remained an important and popular class of probabilistic inference algorithms whose efficient implementation required manual low-level coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires random array variables that are latent or whose likelihood is conjugate. Although that is how practitioners communicate and compose these algorithms on paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06562","kind":"arxiv","version":5},"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-17T23:41:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptS3htJZWSv7CYbQY14DSVxPHd5dLbHezQEzpDavNAdXVog8ySgBZUmNMuA3dcOYkHCEinDdhWJ7GEItT6EiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:37:44.424560Z"},"content_sha256":"040507a445096182f6c7ed60e30a16cab5d4681128cc0437dbb5b8facc9aefa8","schema_version":"1.0","event_id":"sha256:040507a445096182f6c7ed60e30a16cab5d4681128cc0437dbb5b8facc9aefa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXUDGOYDVZUWF67EI5DIIUHKQY/bundle.json","state_url":"https://pith.science/pith/RXUDGOYDVZUWF67EI5DIIUHKQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXUDGOYDVZUWF67EI5DIIUHKQY/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-01T20:37:44Z","links":{"resolver":"https://pith.science/pith/RXUDGOYDVZUWF67EI5DIIUHKQY","bundle":"https://pith.science/pith/RXUDGOYDVZUWF67EI5DIIUHKQY/bundle.json","state":"https://pith.science/pith/RXUDGOYDVZUWF67EI5DIIUHKQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXUDGOYDVZUWF67EI5DIIUHKQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RXUDGOYDVZUWF67EI5DIIUHKQY","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":"08b7515f37a359b4e9d790c572e6aeb3651a94653e66c43c34fc19a0696c1e69","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-17T00:55:43Z","title_canon_sha256":"060526778583430805d8629777daa5988ecd7e80e56453de080039e648c7b230"},"schema_version":"1.0","source":{"id":"1805.06562","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06562","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06562v5","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06562","created_at":"2026-05-17T23:41:46Z"},{"alias_kind":"pith_short_12","alias_value":"RXUDGOYDVZUW","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXUDGOYDVZUWF67E","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXUDGOYD","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:040507a445096182f6c7ed60e30a16cab5d4681128cc0437dbb5b8facc9aefa8","target":"graph","created_at":"2026-05-17T23:41:46Z","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":"Probabilistic programming languages are valuable because they allow domain experts to express probabilistic models and inference algorithms without worrying about irrelevant details. However, for decades there remained an important and popular class of probabilistic inference algorithms whose efficient implementation required manual low-level coding that is tedious and error-prone. They are algorithms whose idiomatic expression requires random array variables that are latent or whose likelihood is conjugate. Although that is how practitioners communicate and compose these algorithms on paper, ","authors_text":"Chung-chieh Shan, Jacques Carette, Praveen Narayanan, Rajan Walia, Sam Tobin-Hochstadt","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-17T00:55:43Z","title":"From high-level inference algorithms to efficient code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06562","kind":"arxiv","version":5},"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:03498b7ab3da87708c4dc3e677a421dbc4e6a2b7c4b08a47bf60409496172c8f","target":"record","created_at":"2026-05-17T23:41:46Z","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":"08b7515f37a359b4e9d790c572e6aeb3651a94653e66c43c34fc19a0696c1e69","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-17T00:55:43Z","title_canon_sha256":"060526778583430805d8629777daa5988ecd7e80e56453de080039e648c7b230"},"schema_version":"1.0","source":{"id":"1805.06562","kind":"arxiv","version":5}},"canonical_sha256":"8de8333b03ae6962fbe447468450ea863bb3b5bd4c5445e47e0814a92a5ad109","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8de8333b03ae6962fbe447468450ea863bb3b5bd4c5445e47e0814a92a5ad109","first_computed_at":"2026-05-17T23:41:46.576379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:46.576379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U/3RF1uISymEJt/X3V1dRcJiYGJeI74vKrooIp0yK8X6MyPQsm0Q4Ni/ocFkI6Q7637NMUiw6EoPgkDH98BsAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:46.577107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06562","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03498b7ab3da87708c4dc3e677a421dbc4e6a2b7c4b08a47bf60409496172c8f","sha256:040507a445096182f6c7ed60e30a16cab5d4681128cc0437dbb5b8facc9aefa8"],"state_sha256":"9a4783d01377bc9a244997929f20a83d077fec4bb85f784d0a4d91ec13a701a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8AhcR+PZSi8/M30mYcmssEVKDSrRSbLkShltPUsIGUMIZjCkWKj+3dHX3QdK7VZoJVHlcX2H+cXGqGIUJzrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:37:44.426596Z","bundle_sha256":"ca231d7bd4743ada74cd8021ec97eb75e8b7d1b67fc2b9e969d567c9a58e8770"}}