{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TH2RI2XCVH6TW4ES5YXB42LEMC","short_pith_number":"pith:TH2RI2XC","schema_version":"1.0","canonical_sha256":"99f5146ae2a9fd3b7092ee2e1e696460a5e54b386572e1ea15603aa67e85cb7e","source":{"kind":"arxiv","id":"1208.2387","version":1},"attestation_state":"computed","paper":{"title":"Instantly Decodable versus Random Linear Network Coding: A Comparative Framework for Throughput and Decoding Delay Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingchao Yu, Parastoo Sadeghi","submitted_at":"2012-08-11T21:55:38Z","abstract_excerpt":"This paper studies the tension between throughput and decoding delay performance of two widely-used network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC). A single-hop broadcasting system model is considered that aims to deliver a block of packets to all receivers in the presence of packet erasures. For a fair and analytically tractable comparison between the two coding schemes, the transmission comprises two phases: a systematic transmission phase and a network coded transmission phase which is further divided into rounds. After the systemat"},"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":"1208.2387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-11T21:55:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37e83b4ad84e3f3620c16f02520de55752d61d6ca406b406cdc4d1da193839ae","abstract_canon_sha256":"c547a64098b32c6be5225665ecf814136b25e2f69fab60f3b3a5f18848b7e41d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:01.253237Z","signature_b64":"srSvJrwN1rLdleih1ZcjOO3ZNkEv3QdDVTz9+3sOF8xC0DHyWDMMZM6Ws7cMpnSQEVBmVDS28ww1ZBz4oKv2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99f5146ae2a9fd3b7092ee2e1e696460a5e54b386572e1ea15603aa67e85cb7e","last_reissued_at":"2026-05-18T02:21:01.252643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:01.252643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instantly Decodable versus Random Linear Network Coding: A Comparative Framework for Throughput and Decoding Delay Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingchao Yu, Parastoo Sadeghi","submitted_at":"2012-08-11T21:55:38Z","abstract_excerpt":"This paper studies the tension between throughput and decoding delay performance of two widely-used network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC). A single-hop broadcasting system model is considered that aims to deliver a block of packets to all receivers in the presence of packet erasures. For a fair and analytically tractable comparison between the two coding schemes, the transmission comprises two phases: a systematic transmission phase and a network coded transmission phase which is further divided into rounds. After the systemat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2387","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.2387","created_at":"2026-05-18T02:21:01.252706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2387v1","created_at":"2026-05-18T02:21:01.252706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2387","created_at":"2026-05-18T02:21:01.252706+00:00"},{"alias_kind":"pith_short_12","alias_value":"TH2RI2XCVH6T","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TH2RI2XCVH6TW4ES","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TH2RI2XC","created_at":"2026-05-18T12:27:23.164592+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/TH2RI2XCVH6TW4ES5YXB42LEMC","json":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC.json","graph_json":"https://pith.science/api/pith-number/TH2RI2XCVH6TW4ES5YXB42LEMC/graph.json","events_json":"https://pith.science/api/pith-number/TH2RI2XCVH6TW4ES5YXB42LEMC/events.json","paper":"https://pith.science/paper/TH2RI2XC"},"agent_actions":{"view_html":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC","download_json":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC.json","view_paper":"https://pith.science/paper/TH2RI2XC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2387&json=true","fetch_graph":"https://pith.science/api/pith-number/TH2RI2XCVH6TW4ES5YXB42LEMC/graph.json","fetch_events":"https://pith.science/api/pith-number/TH2RI2XCVH6TW4ES5YXB42LEMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC/action/storage_attestation","attest_author":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC/action/author_attestation","sign_citation":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC/action/citation_signature","submit_replication":"https://pith.science/pith/TH2RI2XCVH6TW4ES5YXB42LEMC/action/replication_record"}},"created_at":"2026-05-18T02:21:01.252706+00:00","updated_at":"2026-05-18T02:21:01.252706+00:00"}