{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:U4XWOZ5EGVPCUHVXHAXEAJYGJA","short_pith_number":"pith:U4XWOZ5E","canonical_record":{"source":{"id":"1206.3392","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T08:08:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00a4b70818d723d9a896f05a4fe955e0b3351efa500a20b4e9df49676a9370ab","abstract_canon_sha256":"2b15edb26ba40935c78306c32cc71df670755c1dfda3154555176dcb7afb85d8"},"schema_version":"1.0"},"canonical_sha256":"a72f6767a4355e2a1eb7382e402706481a5b483c43a55ace42ea939d081f6427","source":{"kind":"arxiv","id":"1206.3392","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3392","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3392v3","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3392","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"U4XWOZ5EGVPC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U4XWOZ5EGVPCUHVX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U4XWOZ5E","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:U4XWOZ5EGVPCUHVXHAXEAJYGJA","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3392","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T08:08:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00a4b70818d723d9a896f05a4fe955e0b3351efa500a20b4e9df49676a9370ab","abstract_canon_sha256":"2b15edb26ba40935c78306c32cc71df670755c1dfda3154555176dcb7afb85d8"},"schema_version":"1.0"},"canonical_sha256":"a72f6767a4355e2a1eb7382e402706481a5b483c43a55ace42ea939d081f6427","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:09.626918Z","signature_b64":"aHmfpOuVdXfgQlN5kaXZrXJvpThPS0em3crm5UD8gxmOf2lRZhtqF0KLMLfXiOTvtwvCVllWblxg5flAVmvJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a72f6767a4355e2a1eb7382e402706481a5b483c43a55ace42ea939d081f6427","last_reissued_at":"2026-05-18T00:59:09.626200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:09.626200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3392","source_version":3,"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:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QE0uWvgiwWJDH+9UxtRNuFgt+KWNlDe0soBKe4Hw9EYezbiAXYiTjGie/ToxXlvEJ6LeN4baZTB3bYIJj1Q1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:46:50.358917Z"},"content_sha256":"1a6baba5283db9cff84fca635d173e0d4e2722d0875542c6db7bce7c754420ca","schema_version":"1.0","event_id":"sha256:1a6baba5283db9cff84fca635d173e0d4e2722d0875542c6db7bce7c754420ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:U4XWOZ5EGVPCUHVXHAXEAJYGJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Compute-and-Forward 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, Shashank Vatedka","submitted_at":"2012-06-15T08:08:09Z","abstract_excerpt":"We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple access (MAC) channel, and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user's message be kept secure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3392","kind":"arxiv","version":3},"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:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ndm8BAKU/AUJdV6XO7GfmRn6W0H8FJaAFnvAD/wT9Ykql5F4AL0a6F61s7NBaY4BYncd7BSrfEZZPZgEwYcRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:46:50.359667Z"},"content_sha256":"e77cd06f00a555a3ea94428b1e5dcfec431df8252491529a6269a8ecb3d8070a","schema_version":"1.0","event_id":"sha256:e77cd06f00a555a3ea94428b1e5dcfec431df8252491529a6269a8ecb3d8070a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA/bundle.json","state_url":"https://pith.science/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA/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-08T16:46:50Z","links":{"resolver":"https://pith.science/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA","bundle":"https://pith.science/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA/bundle.json","state":"https://pith.science/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4XWOZ5EGVPCUHVXHAXEAJYGJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U4XWOZ5EGVPCUHVXHAXEAJYGJA","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":"2b15edb26ba40935c78306c32cc71df670755c1dfda3154555176dcb7afb85d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T08:08:09Z","title_canon_sha256":"00a4b70818d723d9a896f05a4fe955e0b3351efa500a20b4e9df49676a9370ab"},"schema_version":"1.0","source":{"id":"1206.3392","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3392","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3392v3","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3392","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"U4XWOZ5EGVPC","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U4XWOZ5EGVPCUHVX","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U4XWOZ5E","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:e77cd06f00a555a3ea94428b1e5dcfec431df8252491529a6269a8ecb3d8070a","target":"graph","created_at":"2026-05-18T00:59:09Z","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":"We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple access (MAC) channel, and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user's message be kept secure","authors_text":"Andrew Thangaraj, Navin Kashyap, Shashank Vatedka","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T08:08:09Z","title":"Secure Compute-and-Forward in a Bidirectional Relay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3392","kind":"arxiv","version":3},"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:1a6baba5283db9cff84fca635d173e0d4e2722d0875542c6db7bce7c754420ca","target":"record","created_at":"2026-05-18T00:59:09Z","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":"2b15edb26ba40935c78306c32cc71df670755c1dfda3154555176dcb7afb85d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-15T08:08:09Z","title_canon_sha256":"00a4b70818d723d9a896f05a4fe955e0b3351efa500a20b4e9df49676a9370ab"},"schema_version":"1.0","source":{"id":"1206.3392","kind":"arxiv","version":3}},"canonical_sha256":"a72f6767a4355e2a1eb7382e402706481a5b483c43a55ace42ea939d081f6427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a72f6767a4355e2a1eb7382e402706481a5b483c43a55ace42ea939d081f6427","first_computed_at":"2026-05-18T00:59:09.626200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:09.626200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHmfpOuVdXfgQlN5kaXZrXJvpThPS0em3crm5UD8gxmOf2lRZhtqF0KLMLfXiOTvtwvCVllWblxg5flAVmvJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:09.626918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3392","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a6baba5283db9cff84fca635d173e0d4e2722d0875542c6db7bce7c754420ca","sha256:e77cd06f00a555a3ea94428b1e5dcfec431df8252491529a6269a8ecb3d8070a"],"state_sha256":"800534a4aa112c3ae22fca5ef03b392f2c992378e1c38eaff416472c2e1d24f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDqwajeV0syWdvF0EoySJ0n5dUahu2pi9antGeF9eqCEOaFskppBcPpyDKmWlfaLuiu+PDlfKmfejxa2JGweAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:46:50.363697Z","bundle_sha256":"a8adefd07ec0da2b0622067ffa3286d2996cf8fbe7d9e3544fbeb8df59858d1f"}}