{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CWUKG5KPD67HBFG2I27RHZKMOL","short_pith_number":"pith:CWUKG5KP","canonical_record":{"source":{"id":"1204.6350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-28T00:15:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d11a4c6f80eb41da8b28829d2d45f4fb66bbd501b7cf9bf464fb2612fa1922f3","abstract_canon_sha256":"a42e2e57425206e32709ccf0100d70d1876aa07c4f947646d0543baae76ca010"},"schema_version":"1.0"},"canonical_sha256":"15a8a3754f1fbe7094da46bf13e54c72c79e3e7a1c83d35b1cfc3a9b944f1226","source":{"kind":"arxiv","id":"1204.6350","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6350","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6350v2","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6350","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"CWUKG5KPD67H","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CWUKG5KPD67HBFG2","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CWUKG5KP","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CWUKG5KPD67HBFG2I27RHZKMOL","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6350","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-28T00:15:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d11a4c6f80eb41da8b28829d2d45f4fb66bbd501b7cf9bf464fb2612fa1922f3","abstract_canon_sha256":"a42e2e57425206e32709ccf0100d70d1876aa07c4f947646d0543baae76ca010"},"schema_version":"1.0"},"canonical_sha256":"15a8a3754f1fbe7094da46bf13e54c72c79e3e7a1c83d35b1cfc3a9b944f1226","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:19.703216Z","signature_b64":"yBGUfx9PHsjefOLF2KcWw5kHxrBl7Bm6Efk0M84yJwlAlaKMEYWFwfwcK1tODJd6jjyeVb3F+3268wPKyoN3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15a8a3754f1fbe7094da46bf13e54c72c79e3e7a1c83d35b1cfc3a9b944f1226","last_reissued_at":"2026-05-18T03:53:19.702567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:19.702567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6350","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-18T03:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nleuERlxOaYBUuVk9bsHM+L3hsWGIt0gcUQDuMGN610R0VU4BJIjCB0Fitkx1rDzh6RIvexEpEKlsqbD3RtFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:13:06.528904Z"},"content_sha256":"fb9940522f4697c037aaac2f2244c8e311c50b18aacf2ffe0fc24778010a6fbc","schema_version":"1.0","event_id":"sha256:fb9940522f4697c037aaac2f2244c8e311c50b18aacf2ffe0fc24778010a6fbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CWUKG5KPD67HBFG2I27RHZKMOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Computation in a Bidirectional Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Navin Kashyap, V. Shashank","submitted_at":"2012-04-28T00:15:38Z","abstract_excerpt":"Bidirectional relaying, where a relay helps two user nodes to exchange equal length binary messages, has been an active area of recent research. A popular strategy involves a modified Gaussian MAC, where the relay decodes the XOR of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes. In this work, we consider the Gaussian MAC in bidirectional relaying with an additional secrecy constraint for protection against a honest but curious relay. The constraint is that, while the relay should decode the XOR, it should be fully ignorant of the individ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6350","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-18T03:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogyAtsHvbd5sbFYDnTKgoRSnFjgBiftTpcuZh29VzueYBDy+fU3kkMb8rwI2nU5lgSovlsqjnpuUkYRrCsnGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:13:06.529649Z"},"content_sha256":"a96986236b004d2082023e40c83f8d546141c3d3bc1d87825316542db9b189d4","schema_version":"1.0","event_id":"sha256:a96986236b004d2082023e40c83f8d546141c3d3bc1d87825316542db9b189d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/bundle.json","state_url":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWUKG5KPD67HBFG2I27RHZKMOL/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-08T04:13:06Z","links":{"resolver":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL","bundle":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/bundle.json","state":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWUKG5KPD67HBFG2I27RHZKMOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CWUKG5KPD67HBFG2I27RHZKMOL","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":"a42e2e57425206e32709ccf0100d70d1876aa07c4f947646d0543baae76ca010","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-28T00:15:38Z","title_canon_sha256":"d11a4c6f80eb41da8b28829d2d45f4fb66bbd501b7cf9bf464fb2612fa1922f3"},"schema_version":"1.0","source":{"id":"1204.6350","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6350","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6350v2","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6350","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"CWUKG5KPD67H","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CWUKG5KPD67HBFG2","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CWUKG5KP","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a96986236b004d2082023e40c83f8d546141c3d3bc1d87825316542db9b189d4","target":"graph","created_at":"2026-05-18T03:53:19Z","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":"Bidirectional relaying, where a relay helps two user nodes to exchange equal length binary messages, has been an active area of recent research. A popular strategy involves a modified Gaussian MAC, where the relay decodes the XOR of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes. In this work, we consider the Gaussian MAC in bidirectional relaying with an additional secrecy constraint for protection against a honest but curious relay. The constraint is that, while the relay should decode the XOR, it should be fully ignorant of the individ","authors_text":"Andrew Thangaraj, Navin Kashyap, V. Shashank","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-28T00:15:38Z","title":"Secure Computation in a Bidirectional Relay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6350","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:fb9940522f4697c037aaac2f2244c8e311c50b18aacf2ffe0fc24778010a6fbc","target":"record","created_at":"2026-05-18T03:53:19Z","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":"a42e2e57425206e32709ccf0100d70d1876aa07c4f947646d0543baae76ca010","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-28T00:15:38Z","title_canon_sha256":"d11a4c6f80eb41da8b28829d2d45f4fb66bbd501b7cf9bf464fb2612fa1922f3"},"schema_version":"1.0","source":{"id":"1204.6350","kind":"arxiv","version":2}},"canonical_sha256":"15a8a3754f1fbe7094da46bf13e54c72c79e3e7a1c83d35b1cfc3a9b944f1226","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15a8a3754f1fbe7094da46bf13e54c72c79e3e7a1c83d35b1cfc3a9b944f1226","first_computed_at":"2026-05-18T03:53:19.702567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:19.702567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBGUfx9PHsjefOLF2KcWw5kHxrBl7Bm6Efk0M84yJwlAlaKMEYWFwfwcK1tODJd6jjyeVb3F+3268wPKyoN3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:19.703216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6350","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb9940522f4697c037aaac2f2244c8e311c50b18aacf2ffe0fc24778010a6fbc","sha256:a96986236b004d2082023e40c83f8d546141c3d3bc1d87825316542db9b189d4"],"state_sha256":"183a35979e270933666a6560bae81d5e3f736bc8df98bba83a12ee62eba23fb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYzpXKRSNYUa63QihK7tEPL7KHwldBGcc+fDvTNvhapKd59x1PhNo/FyDBCdMy3/tLsNe2ukYUkxy3QNNsIfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:13:06.533448Z","bundle_sha256":"4ad74d7313b692b95c7eeb6b6f8f0c0512d22a822c7dbfbb5d386626ab69c838"}}