{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:REHTDKWGXU5W672MTZLUBWQXUT","short_pith_number":"pith:REHTDKWG","schema_version":"1.0","canonical_sha256":"890f31aac6bd3b6f7f4c9e5740da17a4f33e3082d2cef29fe9908de4689fa77e","source":{"kind":"arxiv","id":"1703.06939","version":1},"attestation_state":"computed","paper":{"title":"Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs","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":"2017-03-20T19:32:40Z","abstract_excerpt":"Privacy has traditionally been a major motivation for distributed problem solving. Distributed Constraint Satisfaction Problem (DisCSP) as well as Distributed Constraint Optimization Problem (DCOP) are fundamental models used to solve various families of distributed problems. Even though several approaches have been proposed to quantify and preserve privacy in such problems, none of them is exempt from limitations. Here we approach the problem by assuming that computation is performed among utilitarian agents. We introduce a utilitarian approach where the utility of each state is estimated as "},"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":"1703.06939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-20T19:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"f9da688237485c162308ee9f6ee916251d0a35bf2f6e5410de763e49b47a2411","abstract_canon_sha256":"c5877af0a0027e54cf56fb3b3b465da5047ec9c751e4831dec406199c8d5ce3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:11.815112Z","signature_b64":"/lDsT2JvS4w+7YQmux4EUP3ThCWcGTZ2n92nJG3ZHRzPmc/8AVm0T/qQmhOE2gsfry96yCkiRIx8C/RA2rpXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"890f31aac6bd3b6f7f4c9e5740da17a4f33e3082d2cef29fe9908de4689fa77e","last_reissued_at":"2026-05-18T00:48:11.814335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:11.814335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs","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":"2017-03-20T19:32:40Z","abstract_excerpt":"Privacy has traditionally been a major motivation for distributed problem solving. Distributed Constraint Satisfaction Problem (DisCSP) as well as Distributed Constraint Optimization Problem (DCOP) are fundamental models used to solve various families of distributed problems. Even though several approaches have been proposed to quantify and preserve privacy in such problems, none of them is exempt from limitations. Here we approach the problem by assuming that computation is performed among utilitarian agents. We introduce a utilitarian approach where the utility of each state is estimated as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06939","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":"1703.06939","created_at":"2026-05-18T00:48:11.814471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06939v1","created_at":"2026-05-18T00:48:11.814471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06939","created_at":"2026-05-18T00:48:11.814471+00:00"},{"alias_kind":"pith_short_12","alias_value":"REHTDKWGXU5W","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"REHTDKWGXU5W672M","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"REHTDKWG","created_at":"2026-05-18T12:31:39.905425+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/REHTDKWGXU5W672MTZLUBWQXUT","json":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT.json","graph_json":"https://pith.science/api/pith-number/REHTDKWGXU5W672MTZLUBWQXUT/graph.json","events_json":"https://pith.science/api/pith-number/REHTDKWGXU5W672MTZLUBWQXUT/events.json","paper":"https://pith.science/paper/REHTDKWG"},"agent_actions":{"view_html":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT","download_json":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT.json","view_paper":"https://pith.science/paper/REHTDKWG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06939&json=true","fetch_graph":"https://pith.science/api/pith-number/REHTDKWGXU5W672MTZLUBWQXUT/graph.json","fetch_events":"https://pith.science/api/pith-number/REHTDKWGXU5W672MTZLUBWQXUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT/action/storage_attestation","attest_author":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT/action/author_attestation","sign_citation":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT/action/citation_signature","submit_replication":"https://pith.science/pith/REHTDKWGXU5W672MTZLUBWQXUT/action/replication_record"}},"created_at":"2026-05-18T00:48:11.814471+00:00","updated_at":"2026-05-18T00:48:11.814471+00:00"}