{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VIFGQYJKUIHIJWJUOL3Y44RCCU","short_pith_number":"pith:VIFGQYJK","schema_version":"1.0","canonical_sha256":"aa0a68612aa20e84d93472f78e72221506cc0c9c79d37de5d8047b7cdb81e482","source":{"kind":"arxiv","id":"1607.01736","version":1},"attestation_state":"computed","paper":{"title":"On Achievability of an $(r,l)$ Fractional Linear Network Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brijesh Kumar Rai, Niladri Das","submitted_at":"2016-07-06T18:33:34Z","abstract_excerpt":"It is known that there exists a network, called as the M-network, which is not scalar linearly solvable but has a vector linear solution for message dimension two. Recently, a generalization of this result has been presented where it has been shown that for any integer $m\\geq 2$, there exists a network which has a $(m,m)$ vector linear solution, but does not have a $(w,w)$ vector linear solution for $w<m$. This paper presents a further generalization. Specifically, we show that for any positive integers $k,n,$ and $m\\geq 2$, there exists a network which has a $(mk,mn)$ fractional linear soluti"},"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":"1607.01736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-06T18:33:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d7b0b975abe7c937aaa6cc1589a4558621c4262e012053636d53764b8cb976e8","abstract_canon_sha256":"27a560caef7fbd77e19849f27127eec40e2943e205db6e33453e411800f3438d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.591174Z","signature_b64":"puftthSCJaZz3FB38oy6WYVSnkzM9rR+DOk89nmBC9If9GVEQcVCeytbly4N3HpeGNuyoHtYugl4I5LH8uzTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0a68612aa20e84d93472f78e72221506cc0c9c79d37de5d8047b7cdb81e482","last_reissued_at":"2026-05-18T01:11:25.590735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.590735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Achievability of an $(r,l)$ Fractional Linear Network Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brijesh Kumar Rai, Niladri Das","submitted_at":"2016-07-06T18:33:34Z","abstract_excerpt":"It is known that there exists a network, called as the M-network, which is not scalar linearly solvable but has a vector linear solution for message dimension two. Recently, a generalization of this result has been presented where it has been shown that for any integer $m\\geq 2$, there exists a network which has a $(m,m)$ vector linear solution, but does not have a $(w,w)$ vector linear solution for $w<m$. This paper presents a further generalization. Specifically, we show that for any positive integers $k,n,$ and $m\\geq 2$, there exists a network which has a $(mk,mn)$ fractional linear soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01736","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":"1607.01736","created_at":"2026-05-18T01:11:25.590809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01736v1","created_at":"2026-05-18T01:11:25.590809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01736","created_at":"2026-05-18T01:11:25.590809+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIFGQYJKUIHI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIFGQYJKUIHIJWJU","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIFGQYJK","created_at":"2026-05-18T12:30:48.956258+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/VIFGQYJKUIHIJWJUOL3Y44RCCU","json":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU.json","graph_json":"https://pith.science/api/pith-number/VIFGQYJKUIHIJWJUOL3Y44RCCU/graph.json","events_json":"https://pith.science/api/pith-number/VIFGQYJKUIHIJWJUOL3Y44RCCU/events.json","paper":"https://pith.science/paper/VIFGQYJK"},"agent_actions":{"view_html":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU","download_json":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU.json","view_paper":"https://pith.science/paper/VIFGQYJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01736&json=true","fetch_graph":"https://pith.science/api/pith-number/VIFGQYJKUIHIJWJUOL3Y44RCCU/graph.json","fetch_events":"https://pith.science/api/pith-number/VIFGQYJKUIHIJWJUOL3Y44RCCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU/action/storage_attestation","attest_author":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU/action/author_attestation","sign_citation":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU/action/citation_signature","submit_replication":"https://pith.science/pith/VIFGQYJKUIHIJWJUOL3Y44RCCU/action/replication_record"}},"created_at":"2026-05-18T01:11:25.590809+00:00","updated_at":"2026-05-18T01:11:25.590809+00:00"}