{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H3JRFHRVZNTXAWFTMAQE7WRO64","short_pith_number":"pith:H3JRFHRV","canonical_record":{"source":{"id":"1506.01154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T08:01:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1bc5d2fdb63cee1a2a84af9343e88cc361910a1de69f30fa062f8630a441f4a","abstract_canon_sha256":"c025a2eb509c26f3108b9ebfb598c0b3e7defc0b5abaf6fc336046f50e6961fd"},"schema_version":"1.0"},"canonical_sha256":"3ed3129e35cb677058b360204fda2ef7351cf7668c2bb10b44b482060c3290d3","source":{"kind":"arxiv","id":"1506.01154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01154","created_at":"2026-05-18T01:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01154v1","created_at":"2026-05-18T01:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01154","created_at":"2026-05-18T01:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"H3JRFHRVZNTX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H3JRFHRVZNTXAWFT","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H3JRFHRV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H3JRFHRVZNTXAWFTMAQE7WRO64","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T08:01:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1bc5d2fdb63cee1a2a84af9343e88cc361910a1de69f30fa062f8630a441f4a","abstract_canon_sha256":"c025a2eb509c26f3108b9ebfb598c0b3e7defc0b5abaf6fc336046f50e6961fd"},"schema_version":"1.0"},"canonical_sha256":"3ed3129e35cb677058b360204fda2ef7351cf7668c2bb10b44b482060c3290d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:39.897955Z","signature_b64":"UQBqEDInIeOkowYLCVXBYkIZl1csnd3K+vN19f3AbaFbI+eNpOUdByzKRRFtnTlgAmnl+hGD3QzX2tl/IztVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed3129e35cb677058b360204fda2ef7351cf7668c2bb10b44b482060c3290d3","last_reissued_at":"2026-05-18T01:22:39.897224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:39.897224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01154","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-18T01:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9iuIk07m+I9C9lb6M7GdffK5AJnz2FmYfuBBpXHpxCb1wqrgB3ZwFc+Y4h4zuFj70BJHkBadd0AcydNukGTSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:21.195609Z"},"content_sha256":"0575809dcd8d621c9592a89195773d2fecfeac7f7eca097da22ef64455a9d293","schema_version":"1.0","event_id":"sha256:0575809dcd8d621c9592a89195773d2fecfeac7f7eca097da22ef64455a9d293"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H3JRFHRVZNTXAWFTMAQE7WRO64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Characterization and Transmission Schemes for Instantly Decodable Network Coding in Wireless Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingchao Yu, Neda Aboutorab, Parastoo Sadeghi","submitted_at":"2015-06-03T08:01:12Z","abstract_excerpt":"We consider broadcasting a block of packets to multiple wireless receivers under random packet erasures using instantly decodable network coding (IDNC). The sender first broadcasts each packet uncoded once, then generates coded packets according to receivers' feedback about their missing packets. We focus on strict IDNC (S-IDNC), where each coded packet includes at most one missing packet of every receiver. But we will also compare it with general IDNC (G-IDNC), where this condition is relaxed. We characterize two fundamental performance limits of S-IDNC: 1) the number of transmissions to comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01154","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-18T01:22:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8D3rdjAgXF3vJOju9pnYEVYqv8+cuOVApW+0j5zoinnAWznr99LoP9Iqo0pdCNrZ/iuWQV5ksFCbeB5gdYwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:21.196112Z"},"content_sha256":"a79b192fe10e5603c7b3d6863bad9b0cc89bc17af813f2b247c1cff0d3926f9e","schema_version":"1.0","event_id":"sha256:a79b192fe10e5603c7b3d6863bad9b0cc89bc17af813f2b247c1cff0d3926f9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3JRFHRVZNTXAWFTMAQE7WRO64/bundle.json","state_url":"https://pith.science/pith/H3JRFHRVZNTXAWFTMAQE7WRO64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3JRFHRVZNTXAWFTMAQE7WRO64/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-25T18:53:21Z","links":{"resolver":"https://pith.science/pith/H3JRFHRVZNTXAWFTMAQE7WRO64","bundle":"https://pith.science/pith/H3JRFHRVZNTXAWFTMAQE7WRO64/bundle.json","state":"https://pith.science/pith/H3JRFHRVZNTXAWFTMAQE7WRO64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3JRFHRVZNTXAWFTMAQE7WRO64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H3JRFHRVZNTXAWFTMAQE7WRO64","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":"c025a2eb509c26f3108b9ebfb598c0b3e7defc0b5abaf6fc336046f50e6961fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T08:01:12Z","title_canon_sha256":"a1bc5d2fdb63cee1a2a84af9343e88cc361910a1de69f30fa062f8630a441f4a"},"schema_version":"1.0","source":{"id":"1506.01154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01154","created_at":"2026-05-18T01:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01154v1","created_at":"2026-05-18T01:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01154","created_at":"2026-05-18T01:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"H3JRFHRVZNTX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H3JRFHRVZNTXAWFT","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H3JRFHRV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:a79b192fe10e5603c7b3d6863bad9b0cc89bc17af813f2b247c1cff0d3926f9e","target":"graph","created_at":"2026-05-18T01:22:39Z","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 consider broadcasting a block of packets to multiple wireless receivers under random packet erasures using instantly decodable network coding (IDNC). The sender first broadcasts each packet uncoded once, then generates coded packets according to receivers' feedback about their missing packets. We focus on strict IDNC (S-IDNC), where each coded packet includes at most one missing packet of every receiver. But we will also compare it with general IDNC (G-IDNC), where this condition is relaxed. We characterize two fundamental performance limits of S-IDNC: 1) the number of transmissions to comp","authors_text":"Mingchao Yu, Neda Aboutorab, Parastoo Sadeghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T08:01:12Z","title":"Performance Characterization and Transmission Schemes for Instantly Decodable Network Coding in Wireless Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01154","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:0575809dcd8d621c9592a89195773d2fecfeac7f7eca097da22ef64455a9d293","target":"record","created_at":"2026-05-18T01:22:39Z","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":"c025a2eb509c26f3108b9ebfb598c0b3e7defc0b5abaf6fc336046f50e6961fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-03T08:01:12Z","title_canon_sha256":"a1bc5d2fdb63cee1a2a84af9343e88cc361910a1de69f30fa062f8630a441f4a"},"schema_version":"1.0","source":{"id":"1506.01154","kind":"arxiv","version":1}},"canonical_sha256":"3ed3129e35cb677058b360204fda2ef7351cf7668c2bb10b44b482060c3290d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ed3129e35cb677058b360204fda2ef7351cf7668c2bb10b44b482060c3290d3","first_computed_at":"2026-05-18T01:22:39.897224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:39.897224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UQBqEDInIeOkowYLCVXBYkIZl1csnd3K+vN19f3AbaFbI+eNpOUdByzKRRFtnTlgAmnl+hGD3QzX2tl/IztVDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:39.897955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0575809dcd8d621c9592a89195773d2fecfeac7f7eca097da22ef64455a9d293","sha256:a79b192fe10e5603c7b3d6863bad9b0cc89bc17af813f2b247c1cff0d3926f9e"],"state_sha256":"b2325d1a8849e252cde9f84ce19f835897909dafc9e0b93efc3102e99f1bde86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tV7j4EdwpFJFN0/xPl3h1uBeJ9xj0jBuZtX/baz6vLcA1yaFbIJQyVN3/VUtbBaWD2JXvZPHvX7Stht8x6TFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:53:21.199584Z","bundle_sha256":"8f9419a43e12b08e5d4b9568c9918ed5dc4f4bbae136760ed9492c54b19a9ddd"}}