{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6N7YOFY5ZMYUJFQG7TIXOZEVJQ","short_pith_number":"pith:6N7YOFY5","canonical_record":{"source":{"id":"1401.3442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"935fce3300d384640cda8a754730569e089445889d9e2476dc1b7fe97e7ee897","abstract_canon_sha256":"69f954744055961408f98210bf3bd6e511e31df23719311908b53fbcfaafe2c3"},"schema_version":"1.0"},"canonical_sha256":"f37f87171dcb31449606fcd17764954c0418180bc423127f84d2de7b8ca8ad6c","source":{"kind":"arxiv","id":"1401.3442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3442","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3442v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3442","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"6N7YOFY5ZMYU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6N7YOFY5ZMYUJFQG","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6N7YOFY5","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6N7YOFY5ZMYUJFQG7TIXOZEVJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:54:38Z","cross_cats_sorted":[],"title_canon_sha256":"935fce3300d384640cda8a754730569e089445889d9e2476dc1b7fe97e7ee897","abstract_canon_sha256":"69f954744055961408f98210bf3bd6e511e31df23719311908b53fbcfaafe2c3"},"schema_version":"1.0"},"canonical_sha256":"f37f87171dcb31449606fcd17764954c0418180bc423127f84d2de7b8ca8ad6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.136776Z","signature_b64":"7n72PaW58O48vQxt3dn+VKEkc9QgcGj+F9eRY1aCyagfJZtHMFbQVF5uXo6KyQM8YWCEe7Z6yK6WytCCrz3EDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f37f87171dcb31449606fcd17764954c0418180bc423127f84d2de7b8ca8ad6c","last_reissued_at":"2026-05-18T03:02:09.135962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.135962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3442","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":"ZEEiESl+k8FGxAF+uxsJVPdLhhbTPx/kdXnv5YGQuiBqFQcFtyQWX6aYsenTTO4VOkO5rJjWN2bMf/ElGoB9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:11:11.422395Z"},"content_sha256":"ef147be67244e4248154d93d141cc7f6bda0277ae698514a63bbdca6aa6cb2c2","schema_version":"1.0","event_id":"sha256:ef147be67244e4248154d93d141cc7f6bda0277ae698514a63bbdca6aa6cb2c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6N7YOFY5ZMYUJFQG7TIXOZEVJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Forward Bounding for Distributed COPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amir Gershman, Amnon Meisels, Roie Zivan","submitted_at":"2014-01-15T04:54:38Z","abstract_excerpt":"A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. The algorithm is described in detail and its correctness proven. Experimental evaluation shows that AFB outperforms synchronous branch and bound by many orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3442","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":"X3H3WwUGaRDALf99yBH+D3DqyhCgeHvYk2QA03aQMjhP00rJm6OJ51iuOFUi7q8lTUw1QqWGfwpE8wyN/exjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:11:11.422727Z"},"content_sha256":"2cf87db5a3819a726b1e02e5531488087010aa65b6f9034625d219e619c70220","schema_version":"1.0","event_id":"sha256:2cf87db5a3819a726b1e02e5531488087010aa65b6f9034625d219e619c70220"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ/bundle.json","state_url":"https://pith.science/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ/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-27T08:11:11Z","links":{"resolver":"https://pith.science/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ","bundle":"https://pith.science/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ/bundle.json","state":"https://pith.science/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6N7YOFY5ZMYUJFQG7TIXOZEVJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6N7YOFY5ZMYUJFQG7TIXOZEVJQ","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":"69f954744055961408f98210bf3bd6e511e31df23719311908b53fbcfaafe2c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:54:38Z","title_canon_sha256":"935fce3300d384640cda8a754730569e089445889d9e2476dc1b7fe97e7ee897"},"schema_version":"1.0","source":{"id":"1401.3442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3442","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3442v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3442","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"6N7YOFY5ZMYU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6N7YOFY5ZMYUJFQG","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6N7YOFY5","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2cf87db5a3819a726b1e02e5531488087010aa65b6f9034625d219e619c70220","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":"A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. The algorithm is described in detail and its correctness proven. Experimental evaluation shows that AFB outperforms synchronous branch and bound by many orde","authors_text":"Amir Gershman, Amnon Meisels, Roie Zivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:54:38Z","title":"Asynchronous Forward Bounding for Distributed COPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3442","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:ef147be67244e4248154d93d141cc7f6bda0277ae698514a63bbdca6aa6cb2c2","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":"69f954744055961408f98210bf3bd6e511e31df23719311908b53fbcfaafe2c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:54:38Z","title_canon_sha256":"935fce3300d384640cda8a754730569e089445889d9e2476dc1b7fe97e7ee897"},"schema_version":"1.0","source":{"id":"1401.3442","kind":"arxiv","version":1}},"canonical_sha256":"f37f87171dcb31449606fcd17764954c0418180bc423127f84d2de7b8ca8ad6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f37f87171dcb31449606fcd17764954c0418180bc423127f84d2de7b8ca8ad6c","first_computed_at":"2026-05-18T03:02:09.135962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:09.135962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7n72PaW58O48vQxt3dn+VKEkc9QgcGj+F9eRY1aCyagfJZtHMFbQVF5uXo6KyQM8YWCEe7Z6yK6WytCCrz3EDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:09.136776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef147be67244e4248154d93d141cc7f6bda0277ae698514a63bbdca6aa6cb2c2","sha256:2cf87db5a3819a726b1e02e5531488087010aa65b6f9034625d219e619c70220"],"state_sha256":"cbc4aad3571be4b7f224b7b2bf2eabe33ebb3d43649fb5c8f38cfea6f7262757"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mujJlMnfatOA06ePA2fBg+jc3adQdnp3GxEyK3+2sM3kk4Q+xSovszhKMoXawySyBDAklYoXd27oEP6hql6ACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:11:11.424486Z","bundle_sha256":"16a9f8b322c5e4bd104be36241bab42e6d33d3abed15c4e84c684cc39bd73558"}}