{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3MCLBYG5YY2SWKTTFORW5M6HM","short_pith_number":"pith:E3MCLBYG","canonical_record":{"source":{"id":"1603.07227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T15:13:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"91498b4910ebe31c9541439df21552c873cbb19635b49c9548883d597f3d86bd","abstract_canon_sha256":"1bee2432074910a78bee94290fa0e6d9529eb99f4f451c0c17d681160024f27d"},"schema_version":"1.0"},"canonical_sha256":"26d8258706ee31a95953995d1b759e3b350deb5a23c5df35ab5f1b31b532d819","source":{"kind":"arxiv","id":"1603.07227","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07227v2","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"E3MCLBYG5YY2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3MCLBYG5YY2SWKT","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3MCLBYG","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3MCLBYG5YY2SWKTTFORW5M6HM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T15:13:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"91498b4910ebe31c9541439df21552c873cbb19635b49c9548883d597f3d86bd","abstract_canon_sha256":"1bee2432074910a78bee94290fa0e6d9529eb99f4f451c0c17d681160024f27d"},"schema_version":"1.0"},"canonical_sha256":"26d8258706ee31a95953995d1b759e3b350deb5a23c5df35ab5f1b31b532d819","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.124610Z","signature_b64":"OOF++0sCnTWtjLHKiSWvC6pvxPwHmpQPTWFPcKUAWfD3de1GElO5hyZ5ZNU11X/GY8KQGInEcaQtjUeHEbKgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d8258706ee31a95953995d1b759e3b350deb5a23c5df35ab5f1b31b532d819","last_reissued_at":"2026-05-18T00:58:57.123789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.123789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07227","source_version":2,"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-18T00:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWiL4M1uJBuAb0/Vw74BN/q8NATfpX6K9fnd03vGMQSFGc7iPpCcKXOCIwo0XMUSN+LWW+MZT6PoLeIYw7yxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:34:26.788705Z"},"content_sha256":"51f5506f3830d19cdf4b4df5a3855fc2aca64d9be00de138bf4435f21d8afb63","schema_version":"1.0","event_id":"sha256:51f5506f3830d19cdf4b4df5a3855fc2aca64d9be00de138bf4435f21d8afb63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3MCLBYG5YY2SWKTTFORW5M6HM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Secure Computation Over the Binary Modulo-2 Adder Multiple-Access Wiretap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Holger Boche, H. Vincent Poor, Mario Goldenbaum","submitted_at":"2016-03-23T15:13:02Z","abstract_excerpt":"In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07227","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"},"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-18T00:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u70yU2Li7/GXYcynkJ7AuJYOeGE90LDIw7OeWGgwLUj9HSS0E2nOWg56/zxgK8YsWZiD2HeUfObhQjUbgtILCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:34:26.789039Z"},"content_sha256":"cb185d102ed593347f0305f0d9cdd7ad789381d40d85c7450f220daaced37cd1","schema_version":"1.0","event_id":"sha256:cb185d102ed593347f0305f0d9cdd7ad789381d40d85c7450f220daaced37cd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3MCLBYG5YY2SWKTTFORW5M6HM/bundle.json","state_url":"https://pith.science/pith/E3MCLBYG5YY2SWKTTFORW5M6HM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3MCLBYG5YY2SWKTTFORW5M6HM/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-22T23:34:26Z","links":{"resolver":"https://pith.science/pith/E3MCLBYG5YY2SWKTTFORW5M6HM","bundle":"https://pith.science/pith/E3MCLBYG5YY2SWKTTFORW5M6HM/bundle.json","state":"https://pith.science/pith/E3MCLBYG5YY2SWKTTFORW5M6HM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3MCLBYG5YY2SWKTTFORW5M6HM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3MCLBYG5YY2SWKTTFORW5M6HM","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":"1bee2432074910a78bee94290fa0e6d9529eb99f4f451c0c17d681160024f27d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T15:13:02Z","title_canon_sha256":"91498b4910ebe31c9541439df21552c873cbb19635b49c9548883d597f3d86bd"},"schema_version":"1.0","source":{"id":"1603.07227","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07227v2","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07227","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"E3MCLBYG5YY2","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3MCLBYG5YY2SWKT","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3MCLBYG","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:cb185d102ed593347f0305f0d9cdd7ad789381d40d85c7450f220daaced37cd1","target":"graph","created_at":"2026-05-18T00:58:57Z","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 this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matc","authors_text":"Holger Boche, H. Vincent Poor, Mario Goldenbaum","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T15:13:02Z","title":"On Secure Computation Over the Binary Modulo-2 Adder Multiple-Access Wiretap Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07227","kind":"arxiv","version":2},"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:51f5506f3830d19cdf4b4df5a3855fc2aca64d9be00de138bf4435f21d8afb63","target":"record","created_at":"2026-05-18T00:58:57Z","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":"1bee2432074910a78bee94290fa0e6d9529eb99f4f451c0c17d681160024f27d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T15:13:02Z","title_canon_sha256":"91498b4910ebe31c9541439df21552c873cbb19635b49c9548883d597f3d86bd"},"schema_version":"1.0","source":{"id":"1603.07227","kind":"arxiv","version":2}},"canonical_sha256":"26d8258706ee31a95953995d1b759e3b350deb5a23c5df35ab5f1b31b532d819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d8258706ee31a95953995d1b759e3b350deb5a23c5df35ab5f1b31b532d819","first_computed_at":"2026-05-18T00:58:57.123789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.123789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OOF++0sCnTWtjLHKiSWvC6pvxPwHmpQPTWFPcKUAWfD3de1GElO5hyZ5ZNU11X/GY8KQGInEcaQtjUeHEbKgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.124610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07227","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51f5506f3830d19cdf4b4df5a3855fc2aca64d9be00de138bf4435f21d8afb63","sha256:cb185d102ed593347f0305f0d9cdd7ad789381d40d85c7450f220daaced37cd1"],"state_sha256":"7e08f170f3f6e184ac0c7341261a745110364e9fec405e68373f74d683de1c0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SH1XYUZdtvzjuvRygheFi/uaesaH2fL2/8uOFdYdP9QxnaGosqKosFwsNRa6aBxSHoyhXVhNAq3Mek9RmMZjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:34:26.790937Z","bundle_sha256":"132af32ee1ef9145d866e93e962f7203347430801aea9680f4b39cc3d328a8ba"}}