{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7VWYFORJWJXF7IYJPTRXEM3LK3","short_pith_number":"pith:7VWYFORJ","canonical_record":{"source":{"id":"1402.5359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-21T17:23:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"269476eef3c343fdbcf0d72268b697ebe9ccbe792cf8e1c05b52bc69fcc620db","abstract_canon_sha256":"7f9d1edd7645d2e9eeee1a7cf9b992204f01581d3baabd27d7ad2c35ba8ee1e9"},"schema_version":"1.0"},"canonical_sha256":"fd6d82ba29b26e5fa3097ce372336b56d9c12ad670df29c6b3c4132c4d1c99a8","source":{"kind":"arxiv","id":"1402.5359","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5359","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5359v3","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5359","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"7VWYFORJWJXF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7VWYFORJWJXF7IYJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7VWYFORJ","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7VWYFORJWJXF7IYJPTRXEM3LK3","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5359","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-21T17:23:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"269476eef3c343fdbcf0d72268b697ebe9ccbe792cf8e1c05b52bc69fcc620db","abstract_canon_sha256":"7f9d1edd7645d2e9eeee1a7cf9b992204f01581d3baabd27d7ad2c35ba8ee1e9"},"schema_version":"1.0"},"canonical_sha256":"fd6d82ba29b26e5fa3097ce372336b56d9c12ad670df29c6b3c4132c4d1c99a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:36.635106Z","signature_b64":"eVz9HuG2dUpWPv2haG380XYq/NAYD9gnRGZABv9JC2FAspRjYycepygA3vQx5KznLnHNeYRYpf5MuaTC+UzvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd6d82ba29b26e5fa3097ce372336b56d9c12ad670df29c6b3c4132c4d1c99a8","last_reissued_at":"2026-05-18T01:12:36.634547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:36.634547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5359","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-18T01:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nP2fRlkdxVxbZ33tMNhF2Xr/siJQs9pHC1AaJgyisYkjF4K8fiUH5CR9uS+88a6oi9YCMTD4Cqm220DbrRRqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:39:08.946355Z"},"content_sha256":"ac3e85b6e1bd0abaee679b29bae24b9e733c4cf29c3a612f07bab8bc5f4bae87","schema_version":"1.0","event_id":"sha256:ac3e85b6e1bd0abaee679b29bae24b9e733c4cf29c3a612f07bab8bc5f4bae87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7VWYFORJWJXF7IYJPTRXEM3LK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of the 2-User Interference Channel with Transmitter Cooperation and Secrecy Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chandra R. Murthy, Parthajit Mohapatra","submitted_at":"2014-02-21T17:23:35Z","abstract_excerpt":"This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user's data bits, and transmission of random bits. In the proposed achievable scheme, the limited rate cooperative link is used to share a combination of data bits and random bits depending on the model paramete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5359","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-18T01:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cjaelm/7f61fEgXH6Pvaa2H1F6l7prrcc+AtpvmJuIZ6nGZmkxQkN3gy1hbBvOHoGhs3V0tch0d4sI2ZkxPODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:39:08.946938Z"},"content_sha256":"ec3d220077255c4dbec866b4b6bf9d831b2774309cebd2f60be9ab53ed030197","schema_version":"1.0","event_id":"sha256:ec3d220077255c4dbec866b4b6bf9d831b2774309cebd2f60be9ab53ed030197"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VWYFORJWJXF7IYJPTRXEM3LK3/bundle.json","state_url":"https://pith.science/pith/7VWYFORJWJXF7IYJPTRXEM3LK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VWYFORJWJXF7IYJPTRXEM3LK3/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-05-26T20:39:08Z","links":{"resolver":"https://pith.science/pith/7VWYFORJWJXF7IYJPTRXEM3LK3","bundle":"https://pith.science/pith/7VWYFORJWJXF7IYJPTRXEM3LK3/bundle.json","state":"https://pith.science/pith/7VWYFORJWJXF7IYJPTRXEM3LK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VWYFORJWJXF7IYJPTRXEM3LK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7VWYFORJWJXF7IYJPTRXEM3LK3","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":"7f9d1edd7645d2e9eeee1a7cf9b992204f01581d3baabd27d7ad2c35ba8ee1e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-21T17:23:35Z","title_canon_sha256":"269476eef3c343fdbcf0d72268b697ebe9ccbe792cf8e1c05b52bc69fcc620db"},"schema_version":"1.0","source":{"id":"1402.5359","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5359","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5359v3","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5359","created_at":"2026-05-18T01:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"7VWYFORJWJXF","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7VWYFORJWJXF7IYJ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7VWYFORJ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:ec3d220077255c4dbec866b4b6bf9d831b2774309cebd2f60be9ab53ed030197","target":"graph","created_at":"2026-05-18T01:12:36Z","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":"This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user's data bits, and transmission of random bits. In the proposed achievable scheme, the limited rate cooperative link is used to share a combination of data bits and random bits depending on the model paramete","authors_text":"Chandra R. Murthy, Parthajit Mohapatra","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-21T17:23:35Z","title":"On the Capacity of the 2-User Interference Channel with Transmitter Cooperation and Secrecy Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5359","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:ac3e85b6e1bd0abaee679b29bae24b9e733c4cf29c3a612f07bab8bc5f4bae87","target":"record","created_at":"2026-05-18T01:12:36Z","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":"7f9d1edd7645d2e9eeee1a7cf9b992204f01581d3baabd27d7ad2c35ba8ee1e9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-21T17:23:35Z","title_canon_sha256":"269476eef3c343fdbcf0d72268b697ebe9ccbe792cf8e1c05b52bc69fcc620db"},"schema_version":"1.0","source":{"id":"1402.5359","kind":"arxiv","version":3}},"canonical_sha256":"fd6d82ba29b26e5fa3097ce372336b56d9c12ad670df29c6b3c4132c4d1c99a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd6d82ba29b26e5fa3097ce372336b56d9c12ad670df29c6b3c4132c4d1c99a8","first_computed_at":"2026-05-18T01:12:36.634547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:36.634547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eVz9HuG2dUpWPv2haG380XYq/NAYD9gnRGZABv9JC2FAspRjYycepygA3vQx5KznLnHNeYRYpf5MuaTC+UzvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:36.635106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5359","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac3e85b6e1bd0abaee679b29bae24b9e733c4cf29c3a612f07bab8bc5f4bae87","sha256:ec3d220077255c4dbec866b4b6bf9d831b2774309cebd2f60be9ab53ed030197"],"state_sha256":"56838768f4e50d2f07566f5b9da5610b5074143592f86fd0fec9f14685d9226a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1ateREqjHtPIfC/0h0OOheA1aglmch5aCsfcDGP18I/ApAIleEwUHjD4N2aZdVPzEodfZMhLkPTmSIctZKDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:39:08.950962Z","bundle_sha256":"2417e22bdba24d7a016abd260818d63c4d55d4076404a8a2ff4d7f005e47440c"}}