{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OA3HGXAJAYXAT3VGJYLCBQRFJ2","short_pith_number":"pith:OA3HGXAJ","schema_version":"1.0","canonical_sha256":"7036735c09062e09eea64e1620c2254e9821bb60f7d7d311965509d3f127739f","source":{"kind":"arxiv","id":"1301.3864","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bill Havens, Michael C. Horsch","submitted_at":"2013-01-16T15:50:46Z","abstract_excerpt":"We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called {em probabilistic arc consistency}, which is both a generalization of a well known algorithm for arc consistency used in constraint reasoning, and a specialization of the belief updating algorithm for singly-connected networks. Our algorithm is exact for singly- connected constraint problems, but can work well as an approximation for arbitrary problems. We briefly discuss some empirical results, and related methods."},"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":"1301.3864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:46Z","cross_cats_sorted":[],"title_canon_sha256":"17fcba6d155811db09eab87b7866230bc8bdcf1ad77b79552a826fa70480f99f","abstract_canon_sha256":"bfa6f98235733e20c596b8f40abff6ad2c85de57b307df10aa3ac35c57a082c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:15.237880Z","signature_b64":"u+c87JxuZOzLYLP56ZRFs7flxTwpthLFj4v/bQasA3mSuIKdFQHn8OTiFk+KQk15lVU9jNrtLHOMYJPWzd86AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7036735c09062e09eea64e1620c2254e9821bb60f7d7d311965509d3f127739f","last_reissued_at":"2026-05-18T03:36:15.237255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:15.237255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bill Havens, Michael C. Horsch","submitted_at":"2013-01-16T15:50:46Z","abstract_excerpt":"We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called {em probabilistic arc consistency}, which is both a generalization of a well known algorithm for arc consistency used in constraint reasoning, and a specialization of the belief updating algorithm for singly-connected networks. Our algorithm is exact for singly- connected constraint problems, but can work well as an approximation for arbitrary problems. We briefly discuss some empirical results, and related methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3864","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":"1301.3864","created_at":"2026-05-18T03:36:15.237356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3864v1","created_at":"2026-05-18T03:36:15.237356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3864","created_at":"2026-05-18T03:36:15.237356+00:00"},{"alias_kind":"pith_short_12","alias_value":"OA3HGXAJAYXA","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OA3HGXAJAYXAT3VG","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OA3HGXAJ","created_at":"2026-05-18T12:27:54.935989+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/OA3HGXAJAYXAT3VGJYLCBQRFJ2","json":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2.json","graph_json":"https://pith.science/api/pith-number/OA3HGXAJAYXAT3VGJYLCBQRFJ2/graph.json","events_json":"https://pith.science/api/pith-number/OA3HGXAJAYXAT3VGJYLCBQRFJ2/events.json","paper":"https://pith.science/paper/OA3HGXAJ"},"agent_actions":{"view_html":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2","download_json":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2.json","view_paper":"https://pith.science/paper/OA3HGXAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3864&json=true","fetch_graph":"https://pith.science/api/pith-number/OA3HGXAJAYXAT3VGJYLCBQRFJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/OA3HGXAJAYXAT3VGJYLCBQRFJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/action/storage_attestation","attest_author":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/action/author_attestation","sign_citation":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/action/citation_signature","submit_replication":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/action/replication_record"}},"created_at":"2026-05-18T03:36:15.237356+00:00","updated_at":"2026-05-18T03:36:15.237356+00:00"}