{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UJK5ECKZ2D5PUJ6AAIOVZZJTRS","short_pith_number":"pith:UJK5ECKZ","canonical_record":{"source":{"id":"1301.7506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T03:44:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06ed1148276ed422746e2ee96933df5e5e884dbc1e8c389f5faf71397b36a9e4","abstract_canon_sha256":"4faf131f4f5a207149f88313148591a89ab430a3bbcd2eab484f6c2643c4a1f5"},"schema_version":"1.0"},"canonical_sha256":"a255d20959d0fafa27c0021d5ce5338c8d177f33c6201d77c438b7890c49dd9d","source":{"kind":"arxiv","id":"1301.7506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7506","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7506v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7506","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"UJK5ECKZ2D5P","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UJK5ECKZ2D5PUJ6A","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UJK5ECKZ","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UJK5ECKZ2D5PUJ6AAIOVZZJTRS","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T03:44:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06ed1148276ed422746e2ee96933df5e5e884dbc1e8c389f5faf71397b36a9e4","abstract_canon_sha256":"4faf131f4f5a207149f88313148591a89ab430a3bbcd2eab484f6c2643c4a1f5"},"schema_version":"1.0"},"canonical_sha256":"a255d20959d0fafa27c0021d5ce5338c8d177f33c6201d77c438b7890c49dd9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.670221Z","signature_b64":"ENbjthxRbmlNipPWeR/9ckzrIEDib+vlI4NtipUhSLyw16rZkOD42+zx+UbXAvFvHTjssE6u/ODe97ZKfg+PDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a255d20959d0fafa27c0021d5ce5338c8d177f33c6201d77c438b7890c49dd9d","last_reissued_at":"2026-05-18T00:58:17.669392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.669392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7506","source_version":1,"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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oULtZAkRrr5Vywr70virkKmKWuay42YR8nzPYLWVuBqJSedI9mBurBalCSdxGzDViJjBXhC2p2ESl0+5wcukBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:52:46.053685Z"},"content_sha256":"aac4e00f9550335293193b088f69fd35256628d8d72a04e912fe9f0bc831168a","schema_version":"1.0","event_id":"sha256:aac4e00f9550335293193b088f69fd35256628d8d72a04e912fe9f0bc831168a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UJK5ECKZ2D5PUJ6AAIOVZZJTRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fully Distributed Opportunistic Network Coding Scheme for Cellular Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoyu Zheng, Jia Zhu, Yulong Zou","submitted_at":"2013-01-31T03:44:30Z","abstract_excerpt":"In this paper, we propose an opportunistic network coding (ONC) scheme in cellular relay networks, which operates depending on whether the relay decodes source messages successfully or not. A fully distributed method is presented to implement the proposed opportunistic network coding scheme without the need of any feedback between two network nodes. We consider the use of proposed ONC for cellular downlink transmissions and derive its closed-form outage probability expression considering cochannel interference in a Rayleigh fading environment. Numerical results show that the proposed ONC schem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7506","kind":"arxiv","version":1},"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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59H0aW8q1oJxuU9aCZCoX3Iv5Bm0LZ5hE6AEsUXRpNs5BhqNnBg8uWhWg+A/dUtZHLUyEQTVCXQcsf5KfTNKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:52:46.054361Z"},"content_sha256":"46575ee9121bf17087530b2e6d055d4c73b5653bfbceb0909bd101a4a3069342","schema_version":"1.0","event_id":"sha256:46575ee9121bf17087530b2e6d055d4c73b5653bfbceb0909bd101a4a3069342"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS/bundle.json","state_url":"https://pith.science/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS/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-31T04:52:46Z","links":{"resolver":"https://pith.science/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS","bundle":"https://pith.science/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS/bundle.json","state":"https://pith.science/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJK5ECKZ2D5PUJ6AAIOVZZJTRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UJK5ECKZ2D5PUJ6AAIOVZZJTRS","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":"4faf131f4f5a207149f88313148591a89ab430a3bbcd2eab484f6c2643c4a1f5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T03:44:30Z","title_canon_sha256":"06ed1148276ed422746e2ee96933df5e5e884dbc1e8c389f5faf71397b36a9e4"},"schema_version":"1.0","source":{"id":"1301.7506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7506","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7506v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7506","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"UJK5ECKZ2D5P","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UJK5ECKZ2D5PUJ6A","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UJK5ECKZ","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:46575ee9121bf17087530b2e6d055d4c73b5653bfbceb0909bd101a4a3069342","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"In this paper, we propose an opportunistic network coding (ONC) scheme in cellular relay networks, which operates depending on whether the relay decodes source messages successfully or not. A fully distributed method is presented to implement the proposed opportunistic network coding scheme without the need of any feedback between two network nodes. We consider the use of proposed ONC for cellular downlink transmissions and derive its closed-form outage probability expression considering cochannel interference in a Rayleigh fading environment. Numerical results show that the proposed ONC schem","authors_text":"Baoyu Zheng, Jia Zhu, Yulong Zou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T03:44:30Z","title":"A Fully Distributed Opportunistic Network Coding Scheme for Cellular Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7506","kind":"arxiv","version":1},"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:aac4e00f9550335293193b088f69fd35256628d8d72a04e912fe9f0bc831168a","target":"record","created_at":"2026-05-18T00:58:17Z","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":"4faf131f4f5a207149f88313148591a89ab430a3bbcd2eab484f6c2643c4a1f5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-31T03:44:30Z","title_canon_sha256":"06ed1148276ed422746e2ee96933df5e5e884dbc1e8c389f5faf71397b36a9e4"},"schema_version":"1.0","source":{"id":"1301.7506","kind":"arxiv","version":1}},"canonical_sha256":"a255d20959d0fafa27c0021d5ce5338c8d177f33c6201d77c438b7890c49dd9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a255d20959d0fafa27c0021d5ce5338c8d177f33c6201d77c438b7890c49dd9d","first_computed_at":"2026-05-18T00:58:17.669392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.669392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ENbjthxRbmlNipPWeR/9ckzrIEDib+vlI4NtipUhSLyw16rZkOD42+zx+UbXAvFvHTjssE6u/ODe97ZKfg+PDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.670221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aac4e00f9550335293193b088f69fd35256628d8d72a04e912fe9f0bc831168a","sha256:46575ee9121bf17087530b2e6d055d4c73b5653bfbceb0909bd101a4a3069342"],"state_sha256":"01c149f86e86918e71f6af8ae907122cd3cd9939cf173fafaf830eb041589f1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6p4IFJERdELw9v6knoPB2NZHxiwuM37MOJ8qwkNXdl255Toxrz8sJKsl/UuZ86q3ZkmMxr7y4JyhM2calDNRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:52:46.057845Z","bundle_sha256":"39c2ee53fe6d415864fbdf270a167c40da01d9720a1683c2a115562b4f63fbb7"}}