{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:N7V5ZDZME7ECIA4LBXAGA72IPL","short_pith_number":"pith:N7V5ZDZM","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"},"canonical_sha256":"6febdc8f2c27c824038b0dc0607f487ac6b1658bddf9e745b1cc5c3fa42585b6","source":{"kind":"arxiv","id":"1009.1193","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1193","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1193v2","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1193","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"N7V5ZDZME7EC","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N7V5ZDZME7ECIA4L","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N7V5ZDZM","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:N7V5ZDZME7ECIA4LBXAGA72IPL","target":"record","payload":{"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"},"canonical_sha256":"6febdc8f2c27c824038b0dc0607f487ac6b1658bddf9e745b1cc5c3fa42585b6","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"},"source_kind":"arxiv","source_id":"1009.1193","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-18T04:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZlaNCitlq3ze3C1xCVEMcVUvE+zc4cl6PeXzlXvA7iLTJi+CXP2H12O3+awv6NBns/v/O90ULKWobUyu1skBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:47:32.458826Z"},"content_sha256":"ace3514d70a31e609dc4145653cdf0eded3b3ba00b8764218e1a2fcbd6f6f652","schema_version":"1.0","event_id":"sha256:ace3514d70a31e609dc4145653cdf0eded3b3ba00b8764218e1a2fcbd6f6f652"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:N7V5ZDZME7ECIA4LBXAGA72IPL","target":"graph","payload":{"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"},"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-18T04:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oKKxDrHOlYSi8Lrne76UEy9UtDQB5eP3UNY3lRB3Nk8iXaoNn9R6bxteRHo6MMxSFpfLYYARZWD1/hDczBLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:47:32.459169Z"},"content_sha256":"9cb2a2771c4065a9ae105ec91915678dc4aadea50dadae8dfe51e52a7f46340c","schema_version":"1.0","event_id":"sha256:9cb2a2771c4065a9ae105ec91915678dc4aadea50dadae8dfe51e52a7f46340c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/bundle.json","state_url":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/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-30T17:47:32Z","links":{"resolver":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL","bundle":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/bundle.json","state":"https://pith.science/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7V5ZDZME7ECIA4LBXAGA72IPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:N7V5ZDZME7ECIA4LBXAGA72IPL","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":"c7338a6c45a4c5fdf01ed25d588f70132472d5c7834712d81ab557ebfbb2c5f0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-07T05:13:27Z","title_canon_sha256":"262e2968569a484ef7b3bd35c2d2140159c0335e27e254b0b5ddeff47573c0e4"},"schema_version":"1.0","source":{"id":"1009.1193","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1193","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1193v2","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1193","created_at":"2026-05-18T04:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"N7V5ZDZME7EC","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"N7V5ZDZME7ECIA4L","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"N7V5ZDZM","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:9cb2a2771c4065a9ae105ec91915678dc4aadea50dadae8dfe51e52a7f46340c","target":"graph","created_at":"2026-05-18T04:41:13Z","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":"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","authors_text":"Giuseppe Caire, Peyman Razaghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-07T05:13:27Z","title":"Coarse Network Coding: A Simple Relay Strategy to Resolve Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1193","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:ace3514d70a31e609dc4145653cdf0eded3b3ba00b8764218e1a2fcbd6f6f652","target":"record","created_at":"2026-05-18T04:41:13Z","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":"c7338a6c45a4c5fdf01ed25d588f70132472d5c7834712d81ab557ebfbb2c5f0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-07T05:13:27Z","title_canon_sha256":"262e2968569a484ef7b3bd35c2d2140159c0335e27e254b0b5ddeff47573c0e4"},"schema_version":"1.0","source":{"id":"1009.1193","kind":"arxiv","version":2}},"canonical_sha256":"6febdc8f2c27c824038b0dc0607f487ac6b1658bddf9e745b1cc5c3fa42585b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6febdc8f2c27c824038b0dc0607f487ac6b1658bddf9e745b1cc5c3fa42585b6","first_computed_at":"2026-05-18T04:41:13.872071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:13.872071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cGFdBlWhyw41WmKM5XHTDeDl7I7/OgDIk4l88TB0Fh3cH1tI3V5fvHWl9NX9JKoYuD/O0hkJdV08QNw4ztanAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:13.872708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1193","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ace3514d70a31e609dc4145653cdf0eded3b3ba00b8764218e1a2fcbd6f6f652","sha256:9cb2a2771c4065a9ae105ec91915678dc4aadea50dadae8dfe51e52a7f46340c"],"state_sha256":"5ca2e884bdd75a5cc6f3a26af925452fac402286a7f6c524c02c4a19e2a5b718"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1s1SqSm5Z5ywNM4q+ikPoPHjFe8kylyl6v4fybCJRUSARHvjoR0q4W8LsMrMA/xqIhBzU7yRnn3rb5jxhzcwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:47:32.461492Z","bundle_sha256":"cec274928a1ec6694ca9d6d246e2d458ac961debace96b3282e5684622eff202"}}