{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:S7KJ3NADDEF4UBVZNWYWC6COOC","short_pith_number":"pith:S7KJ3NAD","schema_version":"1.0","canonical_sha256":"97d49db403190bca06b96db161784e708610e2008207eb6e36b0479beabe9d30","source":{"kind":"arxiv","id":"2606.30137","version":1},"attestation_state":"computed","paper":{"title":"Reactive Graphs for Efficient Markov Chain Monte Carlo Inference in Probabilistic Programming Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Broman, Fredrik Ronquist, Viktor Palmkvist","submitted_at":"2026-06-29T11:15:34Z","abstract_excerpt":"An important aspect of making inference based on a probabilistic program practical is efficiency; faster evaluation enables more work per unit of time, which can be translated into more precision. Inference via Markov chain Monte Carlo has a property that can be favorably exploited for efficiency: most proposed samples are computed as minor variations of previous samples, i.e., a clever implementation can skip computations pertaining to what is unchanged. This paper provides an approach for automatically translating a probabilistic program to a dynamic graph, reminiscent of functional reactive"},"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":"2606.30137","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-29T11:15:34Z","cross_cats_sorted":[],"title_canon_sha256":"1caf14d9c72c4ffeb11612bca8aa9afdb116d5312be14058498cb33e312c1b8b","abstract_canon_sha256":"d435cb24a2702d07d5f8b9cf735e3cbbb9671d3e8b16ea220b0e0593cb53affc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:51.164735Z","signature_b64":"wu6IJ5Zv9SihM+rTjr1PAyZAvkjd5qBSTYtmBZC5kqWKmXv6f0Ae3AooWTWCFY5ZhuMmITlxiUOmcrgbSgM2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97d49db403190bca06b96db161784e708610e2008207eb6e36b0479beabe9d30","last_reissued_at":"2026-06-30T02:17:51.164271Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:51.164271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reactive Graphs for Efficient Markov Chain Monte Carlo Inference in Probabilistic Programming Languages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Broman, Fredrik Ronquist, Viktor Palmkvist","submitted_at":"2026-06-29T11:15:34Z","abstract_excerpt":"An important aspect of making inference based on a probabilistic program practical is efficiency; faster evaluation enables more work per unit of time, which can be translated into more precision. Inference via Markov chain Monte Carlo has a property that can be favorably exploited for efficiency: most proposed samples are computed as minor variations of previous samples, i.e., a clever implementation can skip computations pertaining to what is unchanged. This paper provides an approach for automatically translating a probabilistic program to a dynamic graph, reminiscent of functional reactive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.30137/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.30137","created_at":"2026-06-30T02:17:51.164343+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30137v1","created_at":"2026-06-30T02:17:51.164343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30137","created_at":"2026-06-30T02:17:51.164343+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7KJ3NADDEF4","created_at":"2026-06-30T02:17:51.164343+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7KJ3NADDEF4UBVZ","created_at":"2026-06-30T02:17:51.164343+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7KJ3NAD","created_at":"2026-06-30T02:17:51.164343+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/S7KJ3NADDEF4UBVZNWYWC6COOC","json":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC.json","graph_json":"https://pith.science/api/pith-number/S7KJ3NADDEF4UBVZNWYWC6COOC/graph.json","events_json":"https://pith.science/api/pith-number/S7KJ3NADDEF4UBVZNWYWC6COOC/events.json","paper":"https://pith.science/paper/S7KJ3NAD"},"agent_actions":{"view_html":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC","download_json":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC.json","view_paper":"https://pith.science/paper/S7KJ3NAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30137&json=true","fetch_graph":"https://pith.science/api/pith-number/S7KJ3NADDEF4UBVZNWYWC6COOC/graph.json","fetch_events":"https://pith.science/api/pith-number/S7KJ3NADDEF4UBVZNWYWC6COOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC/action/storage_attestation","attest_author":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC/action/author_attestation","sign_citation":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC/action/citation_signature","submit_replication":"https://pith.science/pith/S7KJ3NADDEF4UBVZNWYWC6COOC/action/replication_record"}},"created_at":"2026-06-30T02:17:51.164343+00:00","updated_at":"2026-06-30T02:17:51.164343+00:00"}