{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HE4WLZA3DPEACA2HUBXPS6APF7","short_pith_number":"pith:HE4WLZA3","schema_version":"1.0","canonical_sha256":"393965e41b1bc8010347a06ef9780f2fc925a1fc4ea826b2a91ca32adf927533","source":{"kind":"arxiv","id":"1605.02635","version":1},"attestation_state":"computed","paper":{"title":"On Vector Linear Solvability of Multicast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keping Long, Qifu Tyler Sun, Xiaolong Yang, Xunrui Yin, Zongpeng Li","submitted_at":"2016-05-09T15:53:23Z","abstract_excerpt":"Vector linear network coding (LNC) is a generalization of the conventional scalar LNC, such that the data unit transmitted on every edge is an $L$-dimensional vector of data symbols over a base field GF($q$). Vector LNC enriches the choices of coding operations at intermediate nodes, and there is a popular conjecture on the benefit of vector LNC over scalar LNC in terms of alphabet size of data units: there exist (single-source) multicast networks that are vector linearly solvable of dimension $L$ over GF($q$) but not scalar linearly solvable over any field of size $q' \\leq q^L$. This paper in"},"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":"1605.02635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-09T15:53:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ceec1f36babc114622ea14e6b7b50d8d8c50f3bedc0e0a709055c65af012916","abstract_canon_sha256":"14bce0f96920383d1402d91bf049605ac98bab6fde433d253cb35eae3ec4f8d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:57.700862Z","signature_b64":"QI9SevhcYRKGcUqGeYK3LclL9WC3XSJ1I/+ueHPGgnDCE32V2/q0pfkTCZrQrdUiaq2wZG6a6fVeoC7XXsL+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"393965e41b1bc8010347a06ef9780f2fc925a1fc4ea826b2a91ca32adf927533","last_reissued_at":"2026-05-18T00:27:57.700163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:57.700163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Vector Linear Solvability of Multicast Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keping Long, Qifu Tyler Sun, Xiaolong Yang, Xunrui Yin, Zongpeng Li","submitted_at":"2016-05-09T15:53:23Z","abstract_excerpt":"Vector linear network coding (LNC) is a generalization of the conventional scalar LNC, such that the data unit transmitted on every edge is an $L$-dimensional vector of data symbols over a base field GF($q$). Vector LNC enriches the choices of coding operations at intermediate nodes, and there is a popular conjecture on the benefit of vector LNC over scalar LNC in terms of alphabet size of data units: there exist (single-source) multicast networks that are vector linearly solvable of dimension $L$ over GF($q$) but not scalar linearly solvable over any field of size $q' \\leq q^L$. This paper in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02635","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":"1605.02635","created_at":"2026-05-18T00:27:57.700271+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02635v1","created_at":"2026-05-18T00:27:57.700271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02635","created_at":"2026-05-18T00:27:57.700271+00:00"},{"alias_kind":"pith_short_12","alias_value":"HE4WLZA3DPEA","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HE4WLZA3DPEACA2H","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HE4WLZA3","created_at":"2026-05-18T12:30:19.053100+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/HE4WLZA3DPEACA2HUBXPS6APF7","json":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7.json","graph_json":"https://pith.science/api/pith-number/HE4WLZA3DPEACA2HUBXPS6APF7/graph.json","events_json":"https://pith.science/api/pith-number/HE4WLZA3DPEACA2HUBXPS6APF7/events.json","paper":"https://pith.science/paper/HE4WLZA3"},"agent_actions":{"view_html":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7","download_json":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7.json","view_paper":"https://pith.science/paper/HE4WLZA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02635&json=true","fetch_graph":"https://pith.science/api/pith-number/HE4WLZA3DPEACA2HUBXPS6APF7/graph.json","fetch_events":"https://pith.science/api/pith-number/HE4WLZA3DPEACA2HUBXPS6APF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7/action/storage_attestation","attest_author":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7/action/author_attestation","sign_citation":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7/action/citation_signature","submit_replication":"https://pith.science/pith/HE4WLZA3DPEACA2HUBXPS6APF7/action/replication_record"}},"created_at":"2026-05-18T00:27:57.700271+00:00","updated_at":"2026-05-18T00:27:57.700271+00:00"}