{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3DLL6TSY6K6NQLQFYLYMQTEKCV","short_pith_number":"pith:3DLL6TSY","canonical_record":{"source":{"id":"1604.06790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T19:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"11cff08fed3618241b4a1cbdf981390ca15909ddcdbcfefb3ed8d4179875b9f1","abstract_canon_sha256":"c796157a0dea4d05654a08f129f919dd47f321fa8d395e4d02c75cd195bbcf3e"},"schema_version":"1.0"},"canonical_sha256":"d8d6bf4e58f2bcd82e05c2f0c84c8a1570c9e09c2186b25c7da02a4154e94d49","source":{"kind":"arxiv","id":"1604.06790","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06790","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06790v1","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06790","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"3DLL6TSY6K6N","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DLL6TSY6K6NQLQF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DLL6TSY","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3DLL6TSY6K6NQLQFYLYMQTEKCV","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T19:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"11cff08fed3618241b4a1cbdf981390ca15909ddcdbcfefb3ed8d4179875b9f1","abstract_canon_sha256":"c796157a0dea4d05654a08f129f919dd47f321fa8d395e4d02c75cd195bbcf3e"},"schema_version":"1.0"},"canonical_sha256":"d8d6bf4e58f2bcd82e05c2f0c84c8a1570c9e09c2186b25c7da02a4154e94d49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.129677Z","signature_b64":"RpIfKGVkdIlTy7ABcAAZlD2mCtw/ajx2AdBzxR2EpFbH/xVC6Mvw4rcnmcGy9c1B0Yv8C4lzIgJu+e7sF8vOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d6bf4e58f2bcd82e05c2f0c84c8a1570c9e09c2186b25c7da02a4154e94d49","last_reissued_at":"2026-05-18T01:16:28.128784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.128784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06790","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-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1d+yIuTyKYxh6wZDYKg4WnmfGiJpjXV6oZdAezI93U+i0qywJ//5GzgFX4tM89LZzglKuDm5Mpk49QSzW24AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:33:43.564405Z"},"content_sha256":"cdcab15c1b8297ef32dadc759a0efa31b821cdd44835a66d828dd00e62b6b143","schema_version":"1.0","event_id":"sha256:cdcab15c1b8297ef32dadc759a0efa31b821cdd44835a66d828dd00e62b6b143"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3DLL6TSY6K6NQLQFYLYMQTEKCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DisCSPs with Privacy Recast as Planning Problems for Utility-based Agents","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:35:49Z","abstract_excerpt":"Privacy has traditionally been a major motivation for decentralized problem solving. However, even though several metrics have been proposed to quantify it, none of them is easily integrated with common solvers. Constraint programming is a fundamental paradigm used to approach various families of problems. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP) where the utility of each state is estimated as the difference between the the expected rewards for agreements on assignments for shared variables, and the expected cost of privacy loss. Therefore, a traditional "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06790","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-18T01:16:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2WQw9dsKFaiPyxS96VkqKmQEUdYjKPqKUjJo0EtSX38gXm5SbKvVu6KHSZOp9+p/mKiQZRxZApucLnhLe7mDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:33:43.564756Z"},"content_sha256":"adbee4368c04eeb73d1363ff09575ab2c3e09e1962b86c3b243cab2d0ff481f9","schema_version":"1.0","event_id":"sha256:adbee4368c04eeb73d1363ff09575ab2c3e09e1962b86c3b243cab2d0ff481f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV/bundle.json","state_url":"https://pith.science/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV/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-24T21:33:43Z","links":{"resolver":"https://pith.science/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV","bundle":"https://pith.science/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV/bundle.json","state":"https://pith.science/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DLL6TSY6K6NQLQFYLYMQTEKCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3DLL6TSY6K6NQLQFYLYMQTEKCV","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":"c796157a0dea4d05654a08f129f919dd47f321fa8d395e4d02c75cd195bbcf3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T19:35:49Z","title_canon_sha256":"11cff08fed3618241b4a1cbdf981390ca15909ddcdbcfefb3ed8d4179875b9f1"},"schema_version":"1.0","source":{"id":"1604.06790","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06790","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06790v1","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06790","created_at":"2026-05-18T01:16:28Z"},{"alias_kind":"pith_short_12","alias_value":"3DLL6TSY6K6N","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DLL6TSY6K6NQLQF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DLL6TSY","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:adbee4368c04eeb73d1363ff09575ab2c3e09e1962b86c3b243cab2d0ff481f9","target":"graph","created_at":"2026-05-18T01:16:28Z","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":"Privacy has traditionally been a major motivation for decentralized problem solving. However, even though several metrics have been proposed to quantify it, none of them is easily integrated with common solvers. Constraint programming is a fundamental paradigm used to approach various families of problems. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP) where the utility of each state is estimated as the difference between the the expected rewards for agreements on assignments for shared variables, and the expected cost of privacy loss. Therefore, a traditional ","authors_text":"Julien Savaux, Julien Vion, Katsutoshi Hirayama, Makoto Yokoo, Marius Silaghi, Ren\\'e Mandiau, Shakre Elmane, Sylvain Piechowiak, Toshihiro Matsui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T19:35:49Z","title":"DisCSPs with Privacy Recast as Planning Problems for Utility-based Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06790","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:cdcab15c1b8297ef32dadc759a0efa31b821cdd44835a66d828dd00e62b6b143","target":"record","created_at":"2026-05-18T01:16:28Z","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":"c796157a0dea4d05654a08f129f919dd47f321fa8d395e4d02c75cd195bbcf3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-22T19:35:49Z","title_canon_sha256":"11cff08fed3618241b4a1cbdf981390ca15909ddcdbcfefb3ed8d4179875b9f1"},"schema_version":"1.0","source":{"id":"1604.06790","kind":"arxiv","version":1}},"canonical_sha256":"d8d6bf4e58f2bcd82e05c2f0c84c8a1570c9e09c2186b25c7da02a4154e94d49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8d6bf4e58f2bcd82e05c2f0c84c8a1570c9e09c2186b25c7da02a4154e94d49","first_computed_at":"2026-05-18T01:16:28.128784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:28.128784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RpIfKGVkdIlTy7ABcAAZlD2mCtw/ajx2AdBzxR2EpFbH/xVC6Mvw4rcnmcGy9c1B0Yv8C4lzIgJu+e7sF8vOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:28.129677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06790","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdcab15c1b8297ef32dadc759a0efa31b821cdd44835a66d828dd00e62b6b143","sha256:adbee4368c04eeb73d1363ff09575ab2c3e09e1962b86c3b243cab2d0ff481f9"],"state_sha256":"69b8cc425d46e5f279e1f64a57161f3bd77f6b9c2d98920397d90007a37b89e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Xzy8lb7atdgWTbwpvvSPyhYn7uS7R/nFmSj0WY48Yu/TcBiATDULege5JkSYcZ1y7GB7EsbX1R2+92i1Bc8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:33:43.566767Z","bundle_sha256":"c072dfdd9952a10d615ff4e416bbb5ece450f9578c67a35c3b2fe7e72a0f558f"}}