{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RMI7ZYBKBTPU3G3AZJWRE5PM4O","short_pith_number":"pith:RMI7ZYBK","canonical_record":{"source":{"id":"1905.09013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-22T08:27:33Z","cross_cats_sorted":[],"title_canon_sha256":"273a7ce060e77ac257d0d8425c8cdb75aa9bda83a3481e075638509ad246a47b","abstract_canon_sha256":"a355c2169b201fcb0989342c0c347a3ecdf9faf6987152518b389c036132c4bd"},"schema_version":"1.0"},"canonical_sha256":"8b11fce02a0cdf4d9b60ca6d1275ece38f3c3e328936cfa6636a24d4907274fb","source":{"kind":"arxiv","id":"1905.09013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09013","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09013v1","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09013","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"RMI7ZYBKBTPU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RMI7ZYBKBTPU3G3A","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RMI7ZYBK","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RMI7ZYBKBTPU3G3AZJWRE5PM4O","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-22T08:27:33Z","cross_cats_sorted":[],"title_canon_sha256":"273a7ce060e77ac257d0d8425c8cdb75aa9bda83a3481e075638509ad246a47b","abstract_canon_sha256":"a355c2169b201fcb0989342c0c347a3ecdf9faf6987152518b389c036132c4bd"},"schema_version":"1.0"},"canonical_sha256":"8b11fce02a0cdf4d9b60ca6d1275ece38f3c3e328936cfa6636a24d4907274fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:24.608019Z","signature_b64":"uKvbHAtlMXm7lgGRI2Qq5LXTtNJQ5mx/K621Y96AFcMlVD9cni34i+UHsmwefkK8kxrMjsyqaw7MTf+ItxGTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b11fce02a0cdf4d9b60ca6d1275ece38f3c3e328936cfa6636a24d4907274fb","last_reissued_at":"2026-05-17T23:45:24.607577Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:24.607577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09013","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-17T23:45:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YgqOibRudGCOTlesqtP9ijteSfgAaH/GIECDNU3j2oRVtZpCOHIC5jIHmfxzavAKUKfTty+oLG9uCKbiNzhgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:24:22.441134Z"},"content_sha256":"2dc27d13b7a3d953fcb7d3b9649a6b7c7ced02f2c6fac1a8a67f678c8c28fb95","schema_version":"1.0","event_id":"sha256:2dc27d13b7a3d953fcb7d3b9649a6b7c7ced02f2c6fac1a8a67f678c8c28fb95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RMI7ZYBKBTPU3G3AZJWRE5PM4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Privacy Preserving Collusion Secure DCOP Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Avishay Yanai, Tal Grinshpoun, Tamir Tassa","submitted_at":"2019-05-22T08:27:33Z","abstract_excerpt":"In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents do not collude. In this study we propose the first privacy-preserving DCOP algorithm that is immune to coalitions, under the assumption of honest majority. Our algorithm -- PC-SyncBB -- is based on the classical Branch and Bound DCOP algorithm. It offers constraint, topology and decision privacy. We evaluate its performance on different benchmarks, problem sizes, and constraint densities. We show that achieving securi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09013","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-17T23:45:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgw7vilijLDby6tlPgCBp/G3D+wVas0fr0cKTsxl9ZUpEx6tqb7lphOF/POcAiCk3VvGW2dLtkwSh9PO0dC1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:24:22.441501Z"},"content_sha256":"88bbf674a63f9fcfff1494b75444cfeaa60568bd7907705f7895ac86ed9abb71","schema_version":"1.0","event_id":"sha256:88bbf674a63f9fcfff1494b75444cfeaa60568bd7907705f7895ac86ed9abb71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O/bundle.json","state_url":"https://pith.science/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O/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-27T07:24:22Z","links":{"resolver":"https://pith.science/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O","bundle":"https://pith.science/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O/bundle.json","state":"https://pith.science/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMI7ZYBKBTPU3G3AZJWRE5PM4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RMI7ZYBKBTPU3G3AZJWRE5PM4O","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":"a355c2169b201fcb0989342c0c347a3ecdf9faf6987152518b389c036132c4bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-22T08:27:33Z","title_canon_sha256":"273a7ce060e77ac257d0d8425c8cdb75aa9bda83a3481e075638509ad246a47b"},"schema_version":"1.0","source":{"id":"1905.09013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09013","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09013v1","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09013","created_at":"2026-05-17T23:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"RMI7ZYBKBTPU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RMI7ZYBKBTPU3G3A","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RMI7ZYBK","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:88bbf674a63f9fcfff1494b75444cfeaa60568bd7907705f7895ac86ed9abb71","target":"graph","created_at":"2026-05-17T23:45:24Z","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":"In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents do not collude. In this study we propose the first privacy-preserving DCOP algorithm that is immune to coalitions, under the assumption of honest majority. Our algorithm -- PC-SyncBB -- is based on the classical Branch and Bound DCOP algorithm. It offers constraint, topology and decision privacy. We evaluate its performance on different benchmarks, problem sizes, and constraint densities. We show that achieving securi","authors_text":"Avishay Yanai, Tal Grinshpoun, Tamir Tassa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-22T08:27:33Z","title":"A Privacy Preserving Collusion Secure DCOP Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09013","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:2dc27d13b7a3d953fcb7d3b9649a6b7c7ced02f2c6fac1a8a67f678c8c28fb95","target":"record","created_at":"2026-05-17T23:45:24Z","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":"a355c2169b201fcb0989342c0c347a3ecdf9faf6987152518b389c036132c4bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-22T08:27:33Z","title_canon_sha256":"273a7ce060e77ac257d0d8425c8cdb75aa9bda83a3481e075638509ad246a47b"},"schema_version":"1.0","source":{"id":"1905.09013","kind":"arxiv","version":1}},"canonical_sha256":"8b11fce02a0cdf4d9b60ca6d1275ece38f3c3e328936cfa6636a24d4907274fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b11fce02a0cdf4d9b60ca6d1275ece38f3c3e328936cfa6636a24d4907274fb","first_computed_at":"2026-05-17T23:45:24.607577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:24.607577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uKvbHAtlMXm7lgGRI2Qq5LXTtNJQ5mx/K621Y96AFcMlVD9cni34i+UHsmwefkK8kxrMjsyqaw7MTf+ItxGTCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:24.608019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dc27d13b7a3d953fcb7d3b9649a6b7c7ced02f2c6fac1a8a67f678c8c28fb95","sha256:88bbf674a63f9fcfff1494b75444cfeaa60568bd7907705f7895ac86ed9abb71"],"state_sha256":"08498c03b8e6ba95c3cf8f990ea721f8704518a6efd728e443ea3831bc817257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNFS+6Oxeh/IWixWmga0xVOX15wPI1qwu/ySXdpUmNQ79FQVHJGq9PhIH68OZXQH5gxEl65uxA3/6YFfqD4CBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T07:24:22.443301Z","bundle_sha256":"af21970e84cab54ed3f750060ee730285092c5d9e4f42d599b95e0669ce0706c"}}