{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OA3HGXAJAYXAT3VGJYLCBQRFJ2","short_pith_number":"pith:OA3HGXAJ","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"},"canonical_sha256":"7036735c09062e09eea64e1620c2254e9821bb60f7d7d311965509d3f127739f","source":{"kind":"arxiv","id":"1301.3864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3864","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3864v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3864","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"OA3HGXAJAYXA","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OA3HGXAJAYXAT3VG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OA3HGXAJ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OA3HGXAJAYXAT3VGJYLCBQRFJ2","target":"record","payload":{"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"},"canonical_sha256":"7036735c09062e09eea64e1620c2254e9821bb60f7d7d311965509d3f127739f","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"},"source_kind":"arxiv","source_id":"1301.3864","source_version":1,"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-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCqMTZhoHulEkf7OXwCBkJtaaNKM8bJZKZltyA4TW7y0KKIIkC5mCr2tw6zkMJ9aFKVETCLTdSO8v+6TKI8nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:37:20.304722Z"},"content_sha256":"c87f961241bd723714384544db7b14a5f401f9985940da30962a11fca40a299c","schema_version":"1.0","event_id":"sha256:c87f961241bd723714384544db7b14a5f401f9985940da30962a11fca40a299c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OA3HGXAJAYXAT3VGJYLCBQRFJ2","target":"graph","payload":{"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"},"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-18T03:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yk9wV7G4/Rtpuhoj4N/mUhB9C9+4BK/NIXridWXNO2VSJJ6iZrqnoyigqNGJPkFIU9LCTVFAT0RQPM7h5siRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:37:20.305060Z"},"content_sha256":"e61e618974d596c161f53630b80cd237372e6720d531bd45414e6c2f1c221ddb","schema_version":"1.0","event_id":"sha256:e61e618974d596c161f53630b80cd237372e6720d531bd45414e6c2f1c221ddb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/bundle.json","state_url":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/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-29T14:37:20Z","links":{"resolver":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2","bundle":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/bundle.json","state":"https://pith.science/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OA3HGXAJAYXAT3VGJYLCBQRFJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OA3HGXAJAYXAT3VGJYLCBQRFJ2","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":"bfa6f98235733e20c596b8f40abff6ad2c85de57b307df10aa3ac35c57a082c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:46Z","title_canon_sha256":"17fcba6d155811db09eab87b7866230bc8bdcf1ad77b79552a826fa70480f99f"},"schema_version":"1.0","source":{"id":"1301.3864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3864","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3864v1","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3864","created_at":"2026-05-18T03:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"OA3HGXAJAYXA","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OA3HGXAJAYXAT3VG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OA3HGXAJ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:e61e618974d596c161f53630b80cd237372e6720d531bd45414e6c2f1c221ddb","target":"graph","created_at":"2026-05-18T03:36:15Z","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":"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.","authors_text":"Bill Havens, Michael C. Horsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:46Z","title":"Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3864","kind":"arxiv","version":1},"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:c87f961241bd723714384544db7b14a5f401f9985940da30962a11fca40a299c","target":"record","created_at":"2026-05-18T03:36:15Z","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":"bfa6f98235733e20c596b8f40abff6ad2c85de57b307df10aa3ac35c57a082c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-16T15:50:46Z","title_canon_sha256":"17fcba6d155811db09eab87b7866230bc8bdcf1ad77b79552a826fa70480f99f"},"schema_version":"1.0","source":{"id":"1301.3864","kind":"arxiv","version":1}},"canonical_sha256":"7036735c09062e09eea64e1620c2254e9821bb60f7d7d311965509d3f127739f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7036735c09062e09eea64e1620c2254e9821bb60f7d7d311965509d3f127739f","first_computed_at":"2026-05-18T03:36:15.237255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:15.237255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+c87JxuZOzLYLP56ZRFs7flxTwpthLFj4v/bQasA3mSuIKdFQHn8OTiFk+KQk15lVU9jNrtLHOMYJPWzd86AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:15.237880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c87f961241bd723714384544db7b14a5f401f9985940da30962a11fca40a299c","sha256:e61e618974d596c161f53630b80cd237372e6720d531bd45414e6c2f1c221ddb"],"state_sha256":"9ffdeacb3bbfad911da5b8331255ce04b0ba4d8b8770c29c9fd2f5324539763c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huXbmG4Y65SCMYclB6y6IRdo9sb3OS352wgtZGiHiheF0Yax8hkJg0RSGghq1+bb+eDe70rM352kFLcig0lQDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:37:20.306934Z","bundle_sha256":"e0441cf03075d2ccc424285ad6747762da3a17dfe2da6c858bf05d8f794a21f0"}}