{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XVAC6LRVNKLPRCAE75VPE5TFHT","short_pith_number":"pith:XVAC6LRV","canonical_record":{"source":{"id":"1110.0594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-04T07:37:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c27d057d3b4b0244e0a5412286c8e9e11aeabc47a084548a7c1e6ee51868129","abstract_canon_sha256":"277d6eee439f7cec54156be1c914991d2dfa1baf69eb8b64c2b43231858eae4c"},"schema_version":"1.0"},"canonical_sha256":"bd402f2e356a96f88804ff6af276653ce86cb8be2f2b493c6073417f27651d92","source":{"kind":"arxiv","id":"1110.0594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0594","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0594v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0594","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"XVAC6LRVNKLP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XVAC6LRVNKLPRCAE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XVAC6LRV","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XVAC6LRVNKLPRCAE75VPE5TFHT","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-04T07:37:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c27d057d3b4b0244e0a5412286c8e9e11aeabc47a084548a7c1e6ee51868129","abstract_canon_sha256":"277d6eee439f7cec54156be1c914991d2dfa1baf69eb8b64c2b43231858eae4c"},"schema_version":"1.0"},"canonical_sha256":"bd402f2e356a96f88804ff6af276653ce86cb8be2f2b493c6073417f27651d92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.306407Z","signature_b64":"jDbs9Qxaugn8prvg9wMOGyhfZ0tjieILCjvHNixKR20s0svv1GkPI0oqKudTvwbc+q+ceuNV9grfh6yk43ylBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd402f2e356a96f88804ff6af276653ce86cb8be2f2b493c6073417f27651d92","last_reissued_at":"2026-05-18T00:58:43.305829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.305829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0594","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YlzJvu4uIy8Nb6icSyUKv22VgAJf1b6QstTy8pjqYNOgwSbVlZJpdM8uBl8Y0aubY4RrOk1qNPb0FVQ5VeTiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:13:30.779020Z"},"content_sha256":"7b66b72d2bfb1e6f6f3be37ae4152a22d6ec7e802c1e89f1f348bcae56a21776","schema_version":"1.0","event_id":"sha256:7b66b72d2bfb1e6f6f3be37ae4152a22d6ec7e802c1e89f1f348bcae56a21776"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XVAC6LRVNKLPRCAE75VPE5TFHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Wireless Network Coding and Decoding Methods for Multiple Unicast Transmissions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Ozgur Yilmaz, Emre Aktas, Tugcan Aktas","submitted_at":"2011-10-04T07:37:38Z","abstract_excerpt":"We propose a simple yet effective wireless network coding and decoding technique. It utilizes spatial diversity through cooperation between nodes which carry out distributed encoding operations dictated by generator matrices of linear block codes. For this purpose, we make use of greedy codes over the binary field and show that desired diversity orders can be flexibly assigned to nodes in a multiple unicast network, contrary to the previous findings in the literature. Furthermore, we present the optimal detection rule for the given model that accounts for intermediate node errors and suggest a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0594","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqMb7kxXxERmoWO+4J3xAmUdWM8vMmFOQqrg1TSfNpRFaOT4SeXCMPc8EPSpZ6LlkR+6qdQ/nQpMj5xDZzfpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:13:30.779376Z"},"content_sha256":"acdaf9797a4c688eb5264f05520c3e0158cb12873df2b3fbe550f9e5b14be7b2","schema_version":"1.0","event_id":"sha256:acdaf9797a4c688eb5264f05520c3e0158cb12873df2b3fbe550f9e5b14be7b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVAC6LRVNKLPRCAE75VPE5TFHT/bundle.json","state_url":"https://pith.science/pith/XVAC6LRVNKLPRCAE75VPE5TFHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVAC6LRVNKLPRCAE75VPE5TFHT/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-28T19:13:30Z","links":{"resolver":"https://pith.science/pith/XVAC6LRVNKLPRCAE75VPE5TFHT","bundle":"https://pith.science/pith/XVAC6LRVNKLPRCAE75VPE5TFHT/bundle.json","state":"https://pith.science/pith/XVAC6LRVNKLPRCAE75VPE5TFHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVAC6LRVNKLPRCAE75VPE5TFHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XVAC6LRVNKLPRCAE75VPE5TFHT","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":"277d6eee439f7cec54156be1c914991d2dfa1baf69eb8b64c2b43231858eae4c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-04T07:37:38Z","title_canon_sha256":"1c27d057d3b4b0244e0a5412286c8e9e11aeabc47a084548a7c1e6ee51868129"},"schema_version":"1.0","source":{"id":"1110.0594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0594","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0594v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0594","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"XVAC6LRVNKLP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XVAC6LRVNKLPRCAE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XVAC6LRV","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:acdaf9797a4c688eb5264f05520c3e0158cb12873df2b3fbe550f9e5b14be7b2","target":"graph","created_at":"2026-05-18T00:58:43Z","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 propose a simple yet effective wireless network coding and decoding technique. It utilizes spatial diversity through cooperation between nodes which carry out distributed encoding operations dictated by generator matrices of linear block codes. For this purpose, we make use of greedy codes over the binary field and show that desired diversity orders can be flexibly assigned to nodes in a multiple unicast network, contrary to the previous findings in the literature. Furthermore, we present the optimal detection rule for the given model that accounts for intermediate node errors and suggest a","authors_text":"Ali Ozgur Yilmaz, Emre Aktas, Tugcan Aktas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-04T07:37:38Z","title":"Practical Wireless Network Coding and Decoding Methods for Multiple Unicast Transmissions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0594","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:7b66b72d2bfb1e6f6f3be37ae4152a22d6ec7e802c1e89f1f348bcae56a21776","target":"record","created_at":"2026-05-18T00:58:43Z","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":"277d6eee439f7cec54156be1c914991d2dfa1baf69eb8b64c2b43231858eae4c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-10-04T07:37:38Z","title_canon_sha256":"1c27d057d3b4b0244e0a5412286c8e9e11aeabc47a084548a7c1e6ee51868129"},"schema_version":"1.0","source":{"id":"1110.0594","kind":"arxiv","version":1}},"canonical_sha256":"bd402f2e356a96f88804ff6af276653ce86cb8be2f2b493c6073417f27651d92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd402f2e356a96f88804ff6af276653ce86cb8be2f2b493c6073417f27651d92","first_computed_at":"2026-05-18T00:58:43.305829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.305829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jDbs9Qxaugn8prvg9wMOGyhfZ0tjieILCjvHNixKR20s0svv1GkPI0oqKudTvwbc+q+ceuNV9grfh6yk43ylBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.306407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b66b72d2bfb1e6f6f3be37ae4152a22d6ec7e802c1e89f1f348bcae56a21776","sha256:acdaf9797a4c688eb5264f05520c3e0158cb12873df2b3fbe550f9e5b14be7b2"],"state_sha256":"3523a57de1462b732f9aee70ff40833352a2b74878d78526f0697593ba7383b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqTgCpz6gEiv86p+2z4RDteYpP0emwa5pJtDy/8IlxSDZqrGX4DnQaiMFLaub2pkQ44QQZnLtY4HSjX9pWxCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:13:30.781508Z","bundle_sha256":"5bfcc29ba76575b5aae336932df11e75b91548b640f8e2ecc1f0a57cac0a6390"}}