{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:V2YBFUJJ53CCFLA4DUI7J7NO5M","short_pith_number":"pith:V2YBFUJJ","canonical_record":{"source":{"id":"1401.3450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"68f53a061d5154523d8b64bd1997be8c07660766cedad4d59433b4a40847eb9b","abstract_canon_sha256":"9cf51a13901ba2e8f9d4c98ad12d1429dcd6b74e54c736047349e5ea6ee5be8f"},"schema_version":"1.0"},"canonical_sha256":"aeb012d129eec422ac1c1d11f4fdaeeb03e38d43933301fcb72b9bd2348a027e","source":{"kind":"arxiv","id":"1401.3450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3450","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3450v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3450","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"V2YBFUJJ53CC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V2YBFUJJ53CCFLA4","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V2YBFUJJ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:V2YBFUJJ53CCFLA4DUI7J7NO5M","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"68f53a061d5154523d8b64bd1997be8c07660766cedad4d59433b4a40847eb9b","abstract_canon_sha256":"9cf51a13901ba2e8f9d4c98ad12d1429dcd6b74e54c736047349e5ea6ee5be8f"},"schema_version":"1.0"},"canonical_sha256":"aeb012d129eec422ac1c1d11f4fdaeeb03e38d43933301fcb72b9bd2348a027e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.059726Z","signature_b64":"RP3BK/UtggbynmFyPpoFdSTKF8BKip74kv0+sp8erl2VG2un1mHJh23WbAeewbG9zD0Y9/WvtE+fw8s9AXMPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeb012d129eec422ac1c1d11f4fdaeeb03e38d43933301fcb72b9bd2348a027e","last_reissued_at":"2026-05-18T03:02:09.059084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.059084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3450","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:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9FUOv21WSxmH3DbmEygxSxu6sDLXBZFaB9RSRcMpFS9sVj8t/iL0EtirUjBvl7pdhrjB/1UyddvwURkIMYYEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:36:10.895021Z"},"content_sha256":"5200e2619d7de4efd9fc2096150b7ad0dd47dd9c8f904156ddb83936a6df8e3b","schema_version":"1.0","event_id":"sha256:5200e2619d7de4efd9fc2096150b7ad0dd47dd9c8f904156ddb83936a6df8e3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:V2YBFUJJ53CCFLA4DUI7J7NO5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completeness and Performance Of The APO Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amnon Meisels, Tal Grinshpoun","submitted_at":"2014-01-15T05:10:44Z","abstract_excerpt":"Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The original proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. The present paper demonstrates that this expected growth of subproblems does not occur in some situations, leading to a termination problem of the algorithm. The problematic parts in the APO algorithm that interfere with its completeness are identified and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3450","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:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xLFc53hjcnbFX/6IdbK5TbbbU1s3YTeIsMMx5QChWoxFdSNvxf2fMdyN0WGCbJfKTd2wQdgYrXWgjzs/V8UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:36:10.895400Z"},"content_sha256":"1d3107d20f1173d292a02910acb8e4395ed690e50a92e6280aa43bc34a0a2e7b","schema_version":"1.0","event_id":"sha256:1d3107d20f1173d292a02910acb8e4395ed690e50a92e6280aa43bc34a0a2e7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M/bundle.json","state_url":"https://pith.science/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M/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-27T12:36:10Z","links":{"resolver":"https://pith.science/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M","bundle":"https://pith.science/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M/bundle.json","state":"https://pith.science/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2YBFUJJ53CCFLA4DUI7J7NO5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:V2YBFUJJ53CCFLA4DUI7J7NO5M","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":"9cf51a13901ba2e8f9d4c98ad12d1429dcd6b74e54c736047349e5ea6ee5be8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:10:44Z","title_canon_sha256":"68f53a061d5154523d8b64bd1997be8c07660766cedad4d59433b4a40847eb9b"},"schema_version":"1.0","source":{"id":"1401.3450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3450","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3450v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3450","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"V2YBFUJJ53CC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V2YBFUJJ53CCFLA4","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V2YBFUJJ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:1d3107d20f1173d292a02910acb8e4395ed690e50a92e6280aa43bc34a0a2e7b","target":"graph","created_at":"2026-05-18T03:02:09Z","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":"Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The original proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. The present paper demonstrates that this expected growth of subproblems does not occur in some situations, leading to a termination problem of the algorithm. The problematic parts in the APO algorithm that interfere with its completeness are identified and ","authors_text":"Amnon Meisels, Tal Grinshpoun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:10:44Z","title":"Completeness and Performance Of The APO Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3450","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:5200e2619d7de4efd9fc2096150b7ad0dd47dd9c8f904156ddb83936a6df8e3b","target":"record","created_at":"2026-05-18T03:02:09Z","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":"9cf51a13901ba2e8f9d4c98ad12d1429dcd6b74e54c736047349e5ea6ee5be8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:10:44Z","title_canon_sha256":"68f53a061d5154523d8b64bd1997be8c07660766cedad4d59433b4a40847eb9b"},"schema_version":"1.0","source":{"id":"1401.3450","kind":"arxiv","version":1}},"canonical_sha256":"aeb012d129eec422ac1c1d11f4fdaeeb03e38d43933301fcb72b9bd2348a027e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeb012d129eec422ac1c1d11f4fdaeeb03e38d43933301fcb72b9bd2348a027e","first_computed_at":"2026-05-18T03:02:09.059084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:09.059084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RP3BK/UtggbynmFyPpoFdSTKF8BKip74kv0+sp8erl2VG2un1mHJh23WbAeewbG9zD0Y9/WvtE+fw8s9AXMPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:09.059726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5200e2619d7de4efd9fc2096150b7ad0dd47dd9c8f904156ddb83936a6df8e3b","sha256:1d3107d20f1173d292a02910acb8e4395ed690e50a92e6280aa43bc34a0a2e7b"],"state_sha256":"68ddfce5ae458900f35f7df1489f5f6b628591b990588c81bc79bbb00415cc8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImkKkOA77w1nFCZ5oOLGcUp7608sB1wzAN6p09RdKpzQdFqZik2RIyyBz5yVcVPRMEt2mFislw0fGwmJ3N86BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:36:10.897272Z","bundle_sha256":"24169e649f34cbea40b99f1dd64f6508108e01b58af48b344ac7a84df4fade5d"}}