{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EYJTQYBEJ2DSKHB4CQVVKKLRMT","short_pith_number":"pith:EYJTQYBE","schema_version":"1.0","canonical_sha256":"26133860244e87251c3c142b55297164c0d330c9e4b5bda20d567e2f23a6c9ee","source":{"kind":"arxiv","id":"1501.06769","version":5},"attestation_state":"computed","paper":{"title":"Particle Gibbs with Ancestor Sampling for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.PL"],"primary_cat":"stat.ML","authors_text":"Frank Wood, Hongseok Yang, Jan-Willem van de Meent, Vikash Mansinghka","submitted_at":"2015-01-27T14:16:59Z","abstract_excerpt":"Particle Markov chain Monte Carlo techniques rank among current state-of-the-art methods for probabilistic program inference. A drawback of these techniques is that they rely on importance resampling, which results in degenerate particle trajectories and a low effective sample size for variables sampled early in a program. We here develop a formalism to adapt ancestor resampling, a technique that mitigates particle degeneracy, to the probabilistic programming setting. We present empirical results that demonstrate nontrivial performance gains."},"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":"1501.06769","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-27T14:16:59Z","cross_cats_sorted":["cs.AI","cs.PL"],"title_canon_sha256":"f36a7545e09f5c4cc1ac7c29d242cf49af6e527ed87e9ba9eaf740ff4e5cfb05","abstract_canon_sha256":"f94b82452458f3ef39db2de500878985c217898891a5bd1a7ac00e97db962c5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:31.530295Z","signature_b64":"k5u2nBOgZ89I7PDg2z05z1n5hweHHfDNJpYUZ3rYjKtkhqSdOzoqK8WOn9ziGIVNVU5rPTaX9Z2760q0bwgiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26133860244e87251c3c142b55297164c0d330c9e4b5bda20d567e2f23a6c9ee","last_reissued_at":"2026-05-18T02:27:31.529547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:31.529547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Particle Gibbs with Ancestor Sampling for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.PL"],"primary_cat":"stat.ML","authors_text":"Frank Wood, Hongseok Yang, Jan-Willem van de Meent, Vikash Mansinghka","submitted_at":"2015-01-27T14:16:59Z","abstract_excerpt":"Particle Markov chain Monte Carlo techniques rank among current state-of-the-art methods for probabilistic program inference. A drawback of these techniques is that they rely on importance resampling, which results in degenerate particle trajectories and a low effective sample size for variables sampled early in a program. We here develop a formalism to adapt ancestor resampling, a technique that mitigates particle degeneracy, to the probabilistic programming setting. We present empirical results that demonstrate nontrivial performance gains."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06769","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.06769","created_at":"2026-05-18T02:27:31.529662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06769v5","created_at":"2026-05-18T02:27:31.529662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06769","created_at":"2026-05-18T02:27:31.529662+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYJTQYBEJ2DS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYJTQYBEJ2DSKHB4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYJTQYBE","created_at":"2026-05-18T12:29:19.899920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11199","citing_title":"Deployable probabilistic programming","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT","json":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT.json","graph_json":"https://pith.science/api/pith-number/EYJTQYBEJ2DSKHB4CQVVKKLRMT/graph.json","events_json":"https://pith.science/api/pith-number/EYJTQYBEJ2DSKHB4CQVVKKLRMT/events.json","paper":"https://pith.science/paper/EYJTQYBE"},"agent_actions":{"view_html":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT","download_json":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT.json","view_paper":"https://pith.science/paper/EYJTQYBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06769&json=true","fetch_graph":"https://pith.science/api/pith-number/EYJTQYBEJ2DSKHB4CQVVKKLRMT/graph.json","fetch_events":"https://pith.science/api/pith-number/EYJTQYBEJ2DSKHB4CQVVKKLRMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT/action/storage_attestation","attest_author":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT/action/author_attestation","sign_citation":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT/action/citation_signature","submit_replication":"https://pith.science/pith/EYJTQYBEJ2DSKHB4CQVVKKLRMT/action/replication_record"}},"created_at":"2026-05-18T02:27:31.529662+00:00","updated_at":"2026-05-18T02:27:31.529662+00:00"}