{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OI6A6DUPK45U4WSFOQLWNKTESC","short_pith_number":"pith:OI6A6DUP","schema_version":"1.0","canonical_sha256":"723c0f0e8f573b4e5a45741766aa649093e01885d2603328e35c87fa81b2c837","source":{"kind":"arxiv","id":"1604.06787","version":1},"attestation_state":"computed","paper":{"title":"Utilitarian Distributed Constraint Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Julien Savaux, Julien Vion, Katsutoshi Hirayama, Makoto Yokoo, Marius Silaghi, Ren\\'e Mandiau, Shakre Elmane, Sylvain Piechowiak, Toshihiro Matsui","submitted_at":"2016-04-22T19:26:30Z","abstract_excerpt":"Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. As privacy loss does not occur when a solution is accepted, but when it is proposed, privacy requirements cannot be interpreted as a criteria of the objective function of the DCOP. Here we approach the problem by letting both the optimized costs found in DCOPs and the privacy requirement"},"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":"1604.06787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T19:26:30Z","cross_cats_sorted":[],"title_canon_sha256":"d863d8b017fc09f733a4d66d0797c23f0d0f670c5fec470c7ff1ee096c338b22","abstract_canon_sha256":"64b0438fceb0e5a62dec5d2e37a67248ce0891553fa51f39e6d5d6c5efd84d29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.146263Z","signature_b64":"8HPjCedIOGuNpee3IWkMMnCSpmv/ve8QK/pU5Co2BoEhz9yoKYFBADPxJXD2qQvPgB+rUiiWqH6T2gWnjeR/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723c0f0e8f573b4e5a45741766aa649093e01885d2603328e35c87fa81b2c837","last_reissued_at":"2026-05-18T01:16:28.145717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.145717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Utilitarian Distributed Constraint Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Julien Savaux, Julien Vion, Katsutoshi Hirayama, Makoto Yokoo, Marius Silaghi, Ren\\'e Mandiau, Shakre Elmane, Sylvain Piechowiak, Toshihiro Matsui","submitted_at":"2016-04-22T19:26:30Z","abstract_excerpt":"Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The Distributed Constraint Optimization Problem (DCOP) is a fundamental model used to approach various families of distributed problems. As privacy loss does not occur when a solution is accepted, but when it is proposed, privacy requirements cannot be interpreted as a criteria of the objective function of the DCOP. Here we approach the problem by letting both the optimized costs found in DCOPs and the privacy requirement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06787","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.06787","created_at":"2026-05-18T01:16:28.145782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06787v1","created_at":"2026-05-18T01:16:28.145782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06787","created_at":"2026-05-18T01:16:28.145782+00:00"},{"alias_kind":"pith_short_12","alias_value":"OI6A6DUPK45U","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OI6A6DUPK45U4WSF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OI6A6DUP","created_at":"2026-05-18T12:30:36.002864+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/OI6A6DUPK45U4WSFOQLWNKTESC","json":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC.json","graph_json":"https://pith.science/api/pith-number/OI6A6DUPK45U4WSFOQLWNKTESC/graph.json","events_json":"https://pith.science/api/pith-number/OI6A6DUPK45U4WSFOQLWNKTESC/events.json","paper":"https://pith.science/paper/OI6A6DUP"},"agent_actions":{"view_html":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC","download_json":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC.json","view_paper":"https://pith.science/paper/OI6A6DUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06787&json=true","fetch_graph":"https://pith.science/api/pith-number/OI6A6DUPK45U4WSFOQLWNKTESC/graph.json","fetch_events":"https://pith.science/api/pith-number/OI6A6DUPK45U4WSFOQLWNKTESC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC/action/storage_attestation","attest_author":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC/action/author_attestation","sign_citation":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC/action/citation_signature","submit_replication":"https://pith.science/pith/OI6A6DUPK45U4WSFOQLWNKTESC/action/replication_record"}},"created_at":"2026-05-18T01:16:28.145782+00:00","updated_at":"2026-05-18T01:16:28.145782+00:00"}