{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CTIVQNPX2FY4JS4E4Y5WIQMBHE","short_pith_number":"pith:CTIVQNPX","schema_version":"1.0","canonical_sha256":"14d15835f7d171c4cb84e63b6441813912019a69e0b03e8d32035a99a97c3b5f","source":{"kind":"arxiv","id":"1401.3075","version":2},"attestation_state":"computed","paper":{"title":"Multicast Network Coding and Field Sizes","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, Xunrui Yin, Zongpeng Li","submitted_at":"2014-01-14T06:03:54Z","abstract_excerpt":"In an acyclic multicast network, it is well known that a linear network coding solution over GF($q$) exists when $q$ is sufficiently large. In particular, for each prime power $q$ no smaller than the number of receivers, a linear solution over GF($q$) can be efficiently constructed. In this work, we reveal that a linear solution over a given finite field does \\emph{not} necessarily imply the existence of a linear solution over all larger finite fields. Specifically, we prove by construction that: (i) For every source dimension no smaller than 3, there is a multicast network linearly solvable o"},"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":"1401.3075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-14T06:03:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87d907cbbfafb1abb79b7c1f69e5e2cb2ca226fabfda9c43a77240f0b3a5625a","abstract_canon_sha256":"aa54249b5e1ae5edaf6c7ff0fee493b68ac73b525876772523e8899a97c77f5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:04.370569Z","signature_b64":"ANFp6gPnp9Q+m1mEZWWOcCw1BlMrHu7AWgQsvq3TvFnE+wNMLIxG2O+de5dEy+rXxgyslJUjOtzXFa0x4zePCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14d15835f7d171c4cb84e63b6441813912019a69e0b03e8d32035a99a97c3b5f","last_reissued_at":"2026-05-18T01:04:04.370090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:04.370090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicast Network Coding and Field Sizes","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, Xunrui Yin, Zongpeng Li","submitted_at":"2014-01-14T06:03:54Z","abstract_excerpt":"In an acyclic multicast network, it is well known that a linear network coding solution over GF($q$) exists when $q$ is sufficiently large. In particular, for each prime power $q$ no smaller than the number of receivers, a linear solution over GF($q$) can be efficiently constructed. In this work, we reveal that a linear solution over a given finite field does \\emph{not} necessarily imply the existence of a linear solution over all larger finite fields. Specifically, we prove by construction that: (i) For every source dimension no smaller than 3, there is a multicast network linearly solvable o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3075","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":"1401.3075","created_at":"2026-05-18T01:04:04.370169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3075v2","created_at":"2026-05-18T01:04:04.370169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3075","created_at":"2026-05-18T01:04:04.370169+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTIVQNPX2FY4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTIVQNPX2FY4JS4E","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTIVQNPX","created_at":"2026-05-18T12:28:22.404517+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/CTIVQNPX2FY4JS4E4Y5WIQMBHE","json":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE.json","graph_json":"https://pith.science/api/pith-number/CTIVQNPX2FY4JS4E4Y5WIQMBHE/graph.json","events_json":"https://pith.science/api/pith-number/CTIVQNPX2FY4JS4E4Y5WIQMBHE/events.json","paper":"https://pith.science/paper/CTIVQNPX"},"agent_actions":{"view_html":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE","download_json":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE.json","view_paper":"https://pith.science/paper/CTIVQNPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3075&json=true","fetch_graph":"https://pith.science/api/pith-number/CTIVQNPX2FY4JS4E4Y5WIQMBHE/graph.json","fetch_events":"https://pith.science/api/pith-number/CTIVQNPX2FY4JS4E4Y5WIQMBHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE/action/storage_attestation","attest_author":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE/action/author_attestation","sign_citation":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE/action/citation_signature","submit_replication":"https://pith.science/pith/CTIVQNPX2FY4JS4E4Y5WIQMBHE/action/replication_record"}},"created_at":"2026-05-18T01:04:04.370169+00:00","updated_at":"2026-05-18T01:04:04.370169+00:00"}