{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EPBQF57IZCIG725YANVVEINZJD","short_pith_number":"pith:EPBQF57I","canonical_record":{"source":{"id":"1405.1734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-05-07T20:02:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6311c42b115a05eae771e201d629636ba1e3052d5c340a3d002cb328060794f2","abstract_canon_sha256":"11590c373d405138c04c3bd76a5fc84f1967640af3d4991e5be735fc26ddfa2d"},"schema_version":"1.0"},"canonical_sha256":"23c302f7e8c8906febb8036b5221b948ea7a442f6653b34580dd2f9ab1ab074d","source":{"kind":"arxiv","id":"1405.1734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1734","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1734v2","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1734","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"EPBQF57IZCIG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EPBQF57IZCIG725Y","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EPBQF57I","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EPBQF57IZCIG725YANVVEINZJD","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-05-07T20:02:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6311c42b115a05eae771e201d629636ba1e3052d5c340a3d002cb328060794f2","abstract_canon_sha256":"11590c373d405138c04c3bd76a5fc84f1967640af3d4991e5be735fc26ddfa2d"},"schema_version":"1.0"},"canonical_sha256":"23c302f7e8c8906febb8036b5221b948ea7a442f6653b34580dd2f9ab1ab074d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:50.110521Z","signature_b64":"z8YB/JeOMB6f4TvRcYwhZ6Wp5wcdHWL1J9X+zUmN0+OeIKIkjlc1T1qspAkzDLvVpB2IRl3e3U3ldFuR0GJRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23c302f7e8c8906febb8036b5221b948ea7a442f6653b34580dd2f9ab1ab074d","last_reissued_at":"2026-05-18T02:51:50.109967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:50.109967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1734","source_version":2,"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-18T02:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WEOGYDzswOSHZe+gkelTa6HGuDkw3FCCyc95YJ5GTWyiMDwsBnPyJP2WDekc4TjAM4PV9aRVrAn4OcDHVQ3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:01:03.224893Z"},"content_sha256":"766037c30a32ff659ee698b3b12a7ab1ac22cb336f00f688a8262ba64614e200","schema_version":"1.0","event_id":"sha256:766037c30a32ff659ee698b3b12a7ab1ac22cb336f00f688a8262ba64614e200"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EPBQF57IZCIG725YANVVEINZJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logic and Constraint Logic Programming for Distributed Constraint Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Enrico Pontelli, Tiep Le, Tran Cao Son, William Yeoh","submitted_at":"2014-05-07T20:02:09Z","abstract_excerpt":"The field of Distributed Constraint Optimization Problems (DCOPs) has gained momentum, thanks to its suitability in capturing complex problems (e.g., multi-agent coordination and resource allocation problems) that are naturally distributed and cannot be realistically addressed in a centralized manner. The state of the art in solving DCOPs relies on the use of ad-hoc infrastructures and ad-hoc constraint solving procedures. This paper investigates an infrastructure for solving DCOPs that is completely built on logic programming technologies. In particular, the paper explores the use of a genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1734","kind":"arxiv","version":2},"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-18T02:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwmBjiGurBA04qp5+vCgmGjIW1DA8mVUE5C2QDb9bGiS04yF2oz3sPa9lUUzPPImPL4Lbh4Hb+5koL+/kqG2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:01:03.225618Z"},"content_sha256":"39a48835ec66253284afa8c6b4dc29b3ccfb3e09d545d5be4bd96f15d51e87d1","schema_version":"1.0","event_id":"sha256:39a48835ec66253284afa8c6b4dc29b3ccfb3e09d545d5be4bd96f15d51e87d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/bundle.json","state_url":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPBQF57IZCIG725YANVVEINZJD/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-09T03:01:03Z","links":{"resolver":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD","bundle":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/bundle.json","state":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPBQF57IZCIG725YANVVEINZJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EPBQF57IZCIG725YANVVEINZJD","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":"11590c373d405138c04c3bd76a5fc84f1967640af3d4991e5be735fc26ddfa2d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-05-07T20:02:09Z","title_canon_sha256":"6311c42b115a05eae771e201d629636ba1e3052d5c340a3d002cb328060794f2"},"schema_version":"1.0","source":{"id":"1405.1734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1734","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1734v2","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1734","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"EPBQF57IZCIG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EPBQF57IZCIG725Y","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EPBQF57I","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:39a48835ec66253284afa8c6b4dc29b3ccfb3e09d545d5be4bd96f15d51e87d1","target":"graph","created_at":"2026-05-18T02:51:50Z","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":"The field of Distributed Constraint Optimization Problems (DCOPs) has gained momentum, thanks to its suitability in capturing complex problems (e.g., multi-agent coordination and resource allocation problems) that are naturally distributed and cannot be realistically addressed in a centralized manner. The state of the art in solving DCOPs relies on the use of ad-hoc infrastructures and ad-hoc constraint solving procedures. This paper investigates an infrastructure for solving DCOPs that is completely built on logic programming technologies. In particular, the paper explores the use of a genera","authors_text":"Enrico Pontelli, Tiep Le, Tran Cao Son, William Yeoh","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-05-07T20:02:09Z","title":"Logic and Constraint Logic Programming for Distributed Constraint Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1734","kind":"arxiv","version":2},"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:766037c30a32ff659ee698b3b12a7ab1ac22cb336f00f688a8262ba64614e200","target":"record","created_at":"2026-05-18T02:51:50Z","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":"11590c373d405138c04c3bd76a5fc84f1967640af3d4991e5be735fc26ddfa2d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-05-07T20:02:09Z","title_canon_sha256":"6311c42b115a05eae771e201d629636ba1e3052d5c340a3d002cb328060794f2"},"schema_version":"1.0","source":{"id":"1405.1734","kind":"arxiv","version":2}},"canonical_sha256":"23c302f7e8c8906febb8036b5221b948ea7a442f6653b34580dd2f9ab1ab074d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23c302f7e8c8906febb8036b5221b948ea7a442f6653b34580dd2f9ab1ab074d","first_computed_at":"2026-05-18T02:51:50.109967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:50.109967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z8YB/JeOMB6f4TvRcYwhZ6Wp5wcdHWL1J9X+zUmN0+OeIKIkjlc1T1qspAkzDLvVpB2IRl3e3U3ldFuR0GJRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:50.110521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:766037c30a32ff659ee698b3b12a7ab1ac22cb336f00f688a8262ba64614e200","sha256:39a48835ec66253284afa8c6b4dc29b3ccfb3e09d545d5be4bd96f15d51e87d1"],"state_sha256":"e79a7cdc7040a29512343bfce1985a36a68c739a2cb493045a8ca34033bbfc69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VOUiTbzwEjbvEyVgxWgyrwk+AINLmUU3pQnG8d4WmlokvKdNw6kjd9tLDVCXB47t6xOYK75bV0IBgKCY7/xAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:01:03.230080Z","bundle_sha256":"a475ff1f8cce9b50c04b4051eff2d73b0b3343cc4dcc47f869575512b5a6f054"}}