{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N6M7GJ4YNCCOGB3TOXC26VCOBV","short_pith_number":"pith:N6M7GJ4Y","schema_version":"1.0","canonical_sha256":"6f99f327986884e3077375c5af544e0d43942f881d940d247163bfd949c973de","source":{"kind":"arxiv","id":"1709.05970","version":1},"attestation_state":"computed","paper":{"title":"On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field","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":"2017-09-15T08:40:59Z","abstract_excerpt":"It is known that for any finite/co-finite set of primes there exists a network which has a rate $1$ solution if and only if the characteristic of the finite field belongs to the given set. We generalize this result to show that for any positive rational number $k/n$, and for any given finite/co-finite set of primes, there exists a network which has a rate $k/n$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to the given set. For this purpose we construct two networks: $\\mathcal{N}_1$ and $\\mathcal{N}_2$; the network $\\mathcal{N}_1$ has a"},"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":"1709.05970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-15T08:40:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"716846683d866bad48731687a4cd4d6312025b37d4e51aea3bbc433f336cc9c8","abstract_canon_sha256":"8970548729287f0d9197ebbdf44845e460038874f8c86a38ceb59dd7bf4e53d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.614708Z","signature_b64":"mOpYgApETmILrMxp2tAIzUs1G4Ezo1vtPWr31oKGpJqVlpr6d/WQuZ+WeDeTGnUUu1KRnglWqQFEE4e9uW1vBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f99f327986884e3077375c5af544e0d43942f881d940d247163bfd949c973de","last_reissued_at":"2026-05-18T00:34:58.613942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.613942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field","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":"2017-09-15T08:40:59Z","abstract_excerpt":"It is known that for any finite/co-finite set of primes there exists a network which has a rate $1$ solution if and only if the characteristic of the finite field belongs to the given set. We generalize this result to show that for any positive rational number $k/n$, and for any given finite/co-finite set of primes, there exists a network which has a rate $k/n$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to the given set. For this purpose we construct two networks: $\\mathcal{N}_1$ and $\\mathcal{N}_2$; the network $\\mathcal{N}_1$ has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05970","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":"1709.05970","created_at":"2026-05-18T00:34:58.614068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05970v1","created_at":"2026-05-18T00:34:58.614068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05970","created_at":"2026-05-18T00:34:58.614068+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6M7GJ4YNCCO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6M7GJ4YNCCOGB3T","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6M7GJ4Y","created_at":"2026-05-18T12:31:31.346846+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/N6M7GJ4YNCCOGB3TOXC26VCOBV","json":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV.json","graph_json":"https://pith.science/api/pith-number/N6M7GJ4YNCCOGB3TOXC26VCOBV/graph.json","events_json":"https://pith.science/api/pith-number/N6M7GJ4YNCCOGB3TOXC26VCOBV/events.json","paper":"https://pith.science/paper/N6M7GJ4Y"},"agent_actions":{"view_html":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV","download_json":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV.json","view_paper":"https://pith.science/paper/N6M7GJ4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05970&json=true","fetch_graph":"https://pith.science/api/pith-number/N6M7GJ4YNCCOGB3TOXC26VCOBV/graph.json","fetch_events":"https://pith.science/api/pith-number/N6M7GJ4YNCCOGB3TOXC26VCOBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV/action/storage_attestation","attest_author":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV/action/author_attestation","sign_citation":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV/action/citation_signature","submit_replication":"https://pith.science/pith/N6M7GJ4YNCCOGB3TOXC26VCOBV/action/replication_record"}},"created_at":"2026-05-18T00:34:58.614068+00:00","updated_at":"2026-05-18T00:34:58.614068+00:00"}