{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:N7V5ZDZME7ECIA4LBXAGA72IPL","short_pith_number":"pith:N7V5ZDZM","schema_version":"1.0","canonical_sha256":"6febdc8f2c27c824038b0dc0607f487ac6b1658bddf9e745b1cc5c3fa42585b6","source":{"kind":"arxiv","id":"1009.1193","version":2},"attestation_state":"computed","paper":{"title":"Coarse Network Coding: A Simple Relay Strategy to Resolve Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Peyman Razaghi","submitted_at":"2010-09-07T05:13:27Z","abstract_excerpt":"Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in a noiseless interference channel where interference is treated as noise. Based on this observation, a coding strategy is proposed to improve the rate of both users at the same time using a relay node in an interference channel. In this strategy, the relay observes a linear combination of the two source signals, and broadcasts a common message to the two dest"},"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":"1009.1193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-07T05:13:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"262e2968569a484ef7b3bd35c2d2140159c0335e27e254b0b5ddeff47573c0e4","abstract_canon_sha256":"c7338a6c45a4c5fdf01ed25d588f70132472d5c7834712d81ab557ebfbb2c5f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:13.872708Z","signature_b64":"cGFdBlWhyw41WmKM5XHTDeDl7I7/OgDIk4l88TB0Fh3cH1tI3V5fvHWl9NX9JKoYuD/O0hkJdV08QNw4ztanAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6febdc8f2c27c824038b0dc0607f487ac6b1658bddf9e745b1cc5c3fa42585b6","last_reissued_at":"2026-05-18T04:41:13.872071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:13.872071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coarse Network Coding: A Simple Relay Strategy to Resolve Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Peyman Razaghi","submitted_at":"2010-09-07T05:13:27Z","abstract_excerpt":"Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in a noiseless interference channel where interference is treated as noise. Based on this observation, a coding strategy is proposed to improve the rate of both users at the same time using a relay node in an interference channel. In this strategy, the relay observes a linear combination of the two source signals, and broadcasts a common message to the two dest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1193","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":"1009.1193","created_at":"2026-05-18T04:41:13.872164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1193v2","created_at":"2026-05-18T04:41:13.872164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1193","created_at":"2026-05-18T04:41:13.872164+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7V5ZDZME7EC","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7V5ZDZME7ECIA4L","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7V5ZDZM","created_at":"2026-05-18T12:26:10.704358+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/N7V5ZDZME7ECIA4LBXAGA72IPL","json":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL.json","graph_json":"https://pith.science/api/pith-number/N7V5ZDZME7ECIA4LBXAGA72IPL/graph.json","events_json":"https://pith.science/api/pith-number/N7V5ZDZME7ECIA4LBXAGA72IPL/events.json","paper":"https://pith.science/paper/N7V5ZDZM"},"agent_actions":{"view_html":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL","download_json":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL.json","view_paper":"https://pith.science/paper/N7V5ZDZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1193&json=true","fetch_graph":"https://pith.science/api/pith-number/N7V5ZDZME7ECIA4LBXAGA72IPL/graph.json","fetch_events":"https://pith.science/api/pith-number/N7V5ZDZME7ECIA4LBXAGA72IPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/action/storage_attestation","attest_author":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/action/author_attestation","sign_citation":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/action/citation_signature","submit_replication":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/action/replication_record"}},"created_at":"2026-05-18T04:41:13.872164+00:00","updated_at":"2026-05-18T04:41:13.872164+00:00"}