{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EPBQF57IZCIG725YANVVEINZJD","short_pith_number":"pith:EPBQF57I","schema_version":"1.0","canonical_sha256":"23c302f7e8c8906febb8036b5221b948ea7a442f6653b34580dd2f9ab1ab074d","source":{"kind":"arxiv","id":"1405.1734","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.1734","created_at":"2026-05-18T02:51:50.110056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1734v2","created_at":"2026-05-18T02:51:50.110056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1734","created_at":"2026-05-18T02:51:50.110056+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPBQF57IZCIG","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPBQF57IZCIG725Y","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPBQF57I","created_at":"2026-05-18T12:28:28.263976+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/EPBQF57IZCIG725YANVVEINZJD","json":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD.json","graph_json":"https://pith.science/api/pith-number/EPBQF57IZCIG725YANVVEINZJD/graph.json","events_json":"https://pith.science/api/pith-number/EPBQF57IZCIG725YANVVEINZJD/events.json","paper":"https://pith.science/paper/EPBQF57I"},"agent_actions":{"view_html":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD","download_json":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD.json","view_paper":"https://pith.science/paper/EPBQF57I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1734&json=true","fetch_graph":"https://pith.science/api/pith-number/EPBQF57IZCIG725YANVVEINZJD/graph.json","fetch_events":"https://pith.science/api/pith-number/EPBQF57IZCIG725YANVVEINZJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/action/storage_attestation","attest_author":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/action/author_attestation","sign_citation":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/action/citation_signature","submit_replication":"https://pith.science/pith/EPBQF57IZCIG725YANVVEINZJD/action/replication_record"}},"created_at":"2026-05-18T02:51:50.110056+00:00","updated_at":"2026-05-18T02:51:50.110056+00:00"}