{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BZIIDRSFM4IV3VLWPM3UL6QWKU","short_pith_number":"pith:BZIIDRSF","schema_version":"1.0","canonical_sha256":"0e5081c64567115dd5767b3745fa165521c0510acec42bcaf1ae958e79d87f98","source":{"kind":"arxiv","id":"1103.6258","version":1},"attestation_state":"computed","paper":{"title":"Localized Dimension Growth in Random Network Coding: A Convolutional Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, Ning Cai, Wangmei Guo, Xiaomeng Shi","submitted_at":"2011-03-31T18:08:53Z","abstract_excerpt":"We propose an efficient Adaptive Random Convolutional Network Coding (ARCNC) algorithm to address the issue of field size in random network coding. ARCNC operates as a convolutional code, with the coefficients of local encoding kernels chosen randomly over a small finite field. The lengths of local encoding kernels increase with time until the global encoding kernel matrices at related sink nodes all have full rank. Instead of estimating the necessary field size a priori, ARCNC operates in a small finite field. It adapts to unknown network topologies without prior knowledge, by locally increme"},"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":"1103.6258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-31T18:08:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"38a3ce3611118e599ed13b3feed49430b1bcef7df4d544110f55c604af2d58cf","abstract_canon_sha256":"bee57ea5d1ef1cda110516c77835a1596accfb0b73f9e6b53c5d335dcf8553ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.499911Z","signature_b64":"Z38Vt1QFNE/Dhe7BKdHyUF41mb/yQxf2r9YtQLqDEyJmvXNP0wyjRxectOTQKgFCluqohcl1Ay0lIZ6IUaP2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e5081c64567115dd5767b3745fa165521c0510acec42bcaf1ae958e79d87f98","last_reissued_at":"2026-05-18T00:58:43.499375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.499375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Localized Dimension Growth in Random Network Coding: A Convolutional Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Muriel Medard, Ning Cai, Wangmei Guo, Xiaomeng Shi","submitted_at":"2011-03-31T18:08:53Z","abstract_excerpt":"We propose an efficient Adaptive Random Convolutional Network Coding (ARCNC) algorithm to address the issue of field size in random network coding. ARCNC operates as a convolutional code, with the coefficients of local encoding kernels chosen randomly over a small finite field. The lengths of local encoding kernels increase with time until the global encoding kernel matrices at related sink nodes all have full rank. Instead of estimating the necessary field size a priori, ARCNC operates in a small finite field. It adapts to unknown network topologies without prior knowledge, by locally increme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6258","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":"1103.6258","created_at":"2026-05-18T00:58:43.499464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.6258v1","created_at":"2026-05-18T00:58:43.499464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6258","created_at":"2026-05-18T00:58:43.499464+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZIIDRSFM4IV","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZIIDRSFM4IV3VLW","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZIIDRSF","created_at":"2026-05-18T12:26:24.575870+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/BZIIDRSFM4IV3VLWPM3UL6QWKU","json":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU.json","graph_json":"https://pith.science/api/pith-number/BZIIDRSFM4IV3VLWPM3UL6QWKU/graph.json","events_json":"https://pith.science/api/pith-number/BZIIDRSFM4IV3VLWPM3UL6QWKU/events.json","paper":"https://pith.science/paper/BZIIDRSF"},"agent_actions":{"view_html":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU","download_json":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU.json","view_paper":"https://pith.science/paper/BZIIDRSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.6258&json=true","fetch_graph":"https://pith.science/api/pith-number/BZIIDRSFM4IV3VLWPM3UL6QWKU/graph.json","fetch_events":"https://pith.science/api/pith-number/BZIIDRSFM4IV3VLWPM3UL6QWKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU/action/storage_attestation","attest_author":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU/action/author_attestation","sign_citation":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU/action/citation_signature","submit_replication":"https://pith.science/pith/BZIIDRSFM4IV3VLWPM3UL6QWKU/action/replication_record"}},"created_at":"2026-05-18T00:58:43.499464+00:00","updated_at":"2026-05-18T00:58:43.499464+00:00"}