{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CWUKG5KPD67HBFG2I27RHZKMOL","short_pith_number":"pith:CWUKG5KP","schema_version":"1.0","canonical_sha256":"15a8a3754f1fbe7094da46bf13e54c72c79e3e7a1c83d35b1cfc3a9b944f1226","source":{"kind":"arxiv","id":"1204.6350","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.6350","created_at":"2026-05-18T03:53:19.702667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.6350v2","created_at":"2026-05-18T03:53:19.702667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6350","created_at":"2026-05-18T03:53:19.702667+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWUKG5KPD67H","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWUKG5KPD67HBFG2","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWUKG5KP","created_at":"2026-05-18T12:27:01.376967+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/CWUKG5KPD67HBFG2I27RHZKMOL","json":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL.json","graph_json":"https://pith.science/api/pith-number/CWUKG5KPD67HBFG2I27RHZKMOL/graph.json","events_json":"https://pith.science/api/pith-number/CWUKG5KPD67HBFG2I27RHZKMOL/events.json","paper":"https://pith.science/paper/CWUKG5KP"},"agent_actions":{"view_html":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL","download_json":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL.json","view_paper":"https://pith.science/paper/CWUKG5KP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.6350&json=true","fetch_graph":"https://pith.science/api/pith-number/CWUKG5KPD67HBFG2I27RHZKMOL/graph.json","fetch_events":"https://pith.science/api/pith-number/CWUKG5KPD67HBFG2I27RHZKMOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/action/storage_attestation","attest_author":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/action/author_attestation","sign_citation":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/action/citation_signature","submit_replication":"https://pith.science/pith/CWUKG5KPD67HBFG2I27RHZKMOL/action/replication_record"}},"created_at":"2026-05-18T03:53:19.702667+00:00","updated_at":"2026-05-18T03:53:19.702667+00:00"}