{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T6JHP4PNZBYD5NKCBEI6454STS","short_pith_number":"pith:T6JHP4PN","schema_version":"1.0","canonical_sha256":"9f9277f1edc8703eb5420911ee77929c8ed7dcf3f39eeaee51fe932dccbb6fbe","source":{"kind":"arxiv","id":"1604.03292","version":2},"attestation_state":"computed","paper":{"title":"Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Tuvi Etzion","submitted_at":"2016-04-12T08:22:59Z","abstract_excerpt":"This paper considers vector network coding based on rank-metric codes and subspace codes. Our main result is that vector network coding can significantly reduce the required field size compared to scalar linear network coding in the same multicast network. The achieved gap between the field size of scalar and vector network coding is in the order of $q^{(\\ell-1)t^2/\\ell}-q^t$, for any $q \\geq 2$, where $t$ denotes the dimension of the vector solution, and the number of messages is $2 \\ell$, ${\\ell \\geq 2}$. Previously, only a gap of constant size had been shown. This implies also the same gap "},"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":"1604.03292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-12T08:22:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"891e641416ad344f3a67c5af29427587a0df2e9a7c475dd6bc2f35bc14cada79","abstract_canon_sha256":"9ccf4d3b1bd3a97a8046d4c84da4ede936ea5ab2297fff8099ad5653378225f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.474299Z","signature_b64":"wfpn7Q7ZZBz9Taq5nQHmDX8/V21S5UeZOJ4NoPkRTzFVW3kqgPCl1SqDqCpvfjVANe2z2slYBR68ZPY6qpd0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f9277f1edc8703eb5420911ee77929c8ed7dcf3f39eeaee51fe932dccbb6fbe","last_reissued_at":"2026-05-18T01:14:58.473895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.473895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Tuvi Etzion","submitted_at":"2016-04-12T08:22:59Z","abstract_excerpt":"This paper considers vector network coding based on rank-metric codes and subspace codes. Our main result is that vector network coding can significantly reduce the required field size compared to scalar linear network coding in the same multicast network. The achieved gap between the field size of scalar and vector network coding is in the order of $q^{(\\ell-1)t^2/\\ell}-q^t$, for any $q \\geq 2$, where $t$ denotes the dimension of the vector solution, and the number of messages is $2 \\ell$, ${\\ell \\geq 2}$. Previously, only a gap of constant size had been shown. This implies also the same gap "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03292","kind":"arxiv","version":2},"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":"1604.03292","created_at":"2026-05-18T01:14:58.473952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03292v2","created_at":"2026-05-18T01:14:58.473952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03292","created_at":"2026-05-18T01:14:58.473952+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6JHP4PNZBYD","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6JHP4PNZBYD5NKC","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6JHP4PN","created_at":"2026-05-18T12:30:44.179134+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/T6JHP4PNZBYD5NKCBEI6454STS","json":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS.json","graph_json":"https://pith.science/api/pith-number/T6JHP4PNZBYD5NKCBEI6454STS/graph.json","events_json":"https://pith.science/api/pith-number/T6JHP4PNZBYD5NKCBEI6454STS/events.json","paper":"https://pith.science/paper/T6JHP4PN"},"agent_actions":{"view_html":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS","download_json":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS.json","view_paper":"https://pith.science/paper/T6JHP4PN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03292&json=true","fetch_graph":"https://pith.science/api/pith-number/T6JHP4PNZBYD5NKCBEI6454STS/graph.json","fetch_events":"https://pith.science/api/pith-number/T6JHP4PNZBYD5NKCBEI6454STS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS/action/storage_attestation","attest_author":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS/action/author_attestation","sign_citation":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS/action/citation_signature","submit_replication":"https://pith.science/pith/T6JHP4PNZBYD5NKCBEI6454STS/action/replication_record"}},"created_at":"2026-05-18T01:14:58.473952+00:00","updated_at":"2026-05-18T01:14:58.473952+00:00"}