{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GHL7EIZJWRVLURFHNVAS4I2LDZ","short_pith_number":"pith:GHL7EIZJ","schema_version":"1.0","canonical_sha256":"31d7f22329b46aba44a76d412e234b1e692f440878c92374d9165ea1cf7aee37","source":{"kind":"arxiv","id":"1302.1534","version":1},"attestation_state":"computed","paper":{"title":"A Scheme for Approximating Probabilistic Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Irina Rish, Rina Dechter","submitted_at":"2013-02-06T15:54:58Z","abstract_excerpt":"This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency.  We analyze the approximation for several tasks:  finding the most probable explanation, belief updating and finding the maximum a posteriori hypothesis.  We identify regions of completeness and provide preliminary empirical evaluation on randomly generated networks."},"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":"1302.1534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-06T15:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"b1d98bb8ca73183f45fb3cc2f0d44753204f18183788a79e12febbfa32b221c8","abstract_canon_sha256":"a02436448606c1ad713dcbe196aab11688c729b0b7279f401b843947fba25a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:23.899433Z","signature_b64":"0pIwi1YHPmBvNXa8bmS0uPAO/UrCrym5/9FAtYLN5ZIBUXlIoJ/NbXaFWGrRRUw5OYrM+K3bV4lPNb20cXueCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31d7f22329b46aba44a76d412e234b1e692f440878c92374d9165ea1cf7aee37","last_reissued_at":"2026-05-18T03:34:23.898716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:23.898716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scheme for Approximating Probabilistic Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Irina Rish, Rina Dechter","submitted_at":"2013-02-06T15:54:58Z","abstract_excerpt":"This paper describes a class of probabilistic approximation algorithms based on bucket elimination which offer adjustable levels of accuracy and efficiency.  We analyze the approximation for several tasks:  finding the most probable explanation, belief updating and finding the maximum a posteriori hypothesis.  We identify regions of completeness and provide preliminary empirical evaluation on randomly generated networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1534","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":"1302.1534","created_at":"2026-05-18T03:34:23.898836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1534v1","created_at":"2026-05-18T03:34:23.898836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1534","created_at":"2026-05-18T03:34:23.898836+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHL7EIZJWRVL","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHL7EIZJWRVLURFH","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHL7EIZJ","created_at":"2026-05-18T12:27:45.050594+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/GHL7EIZJWRVLURFHNVAS4I2LDZ","json":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ.json","graph_json":"https://pith.science/api/pith-number/GHL7EIZJWRVLURFHNVAS4I2LDZ/graph.json","events_json":"https://pith.science/api/pith-number/GHL7EIZJWRVLURFHNVAS4I2LDZ/events.json","paper":"https://pith.science/paper/GHL7EIZJ"},"agent_actions":{"view_html":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ","download_json":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ.json","view_paper":"https://pith.science/paper/GHL7EIZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1534&json=true","fetch_graph":"https://pith.science/api/pith-number/GHL7EIZJWRVLURFHNVAS4I2LDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GHL7EIZJWRVLURFHNVAS4I2LDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ/action/storage_attestation","attest_author":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ/action/author_attestation","sign_citation":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ/action/citation_signature","submit_replication":"https://pith.science/pith/GHL7EIZJWRVLURFHNVAS4I2LDZ/action/replication_record"}},"created_at":"2026-05-18T03:34:23.898836+00:00","updated_at":"2026-05-18T03:34:23.898836+00:00"}