{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J3TEDVZ4CNBITBEXPW263E3GDZ","short_pith_number":"pith:J3TEDVZ4","schema_version":"1.0","canonical_sha256":"4ee641d73c13428984977db5ed93661e692aee4e36c6d505c885343dd5ba046c","source":{"kind":"arxiv","id":"1610.08004","version":1},"attestation_state":"computed","paper":{"title":"On Fractional Linear Network Coding Solution of Multiple-Unicast Networks","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-10-25T18:27:36Z","abstract_excerpt":"It is known that there exists a multiple-unicast network which has a rate $1$ linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes. In this paper, we show that for any non-zero positive rational number $\\frac{k}{n}$, there exists a multiple-unicast network which has a rate $\\frac{k}{n}$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes."},"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":"1610.08004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T18:27:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b000e22ce0d54452871c74ade23cb7479e650f8153e45a7bb1546b8add93042f","abstract_canon_sha256":"27efbed5282a4b831ba2bf7ec45e9c26220107dd00d540f8efca9b6e195e4494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.962962Z","signature_b64":"z9R0KdzH06kPn5gtfn6AD7UA3s3s6d+hOQbUog18hCbkqP6FsnD0AtiMK7exP2BPHro/FC5qJ+d9p0H9AijFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ee641d73c13428984977db5ed93661e692aee4e36c6d505c885343dd5ba046c","last_reissued_at":"2026-05-18T01:01:16.962292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.962292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Fractional Linear Network Coding Solution of Multiple-Unicast Networks","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-10-25T18:27:36Z","abstract_excerpt":"It is known that there exists a multiple-unicast network which has a rate $1$ linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes. In this paper, we show that for any non-zero positive rational number $\\frac{k}{n}$, there exists a multiple-unicast network which has a rate $\\frac{k}{n}$ fractional linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08004","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":"1610.08004","created_at":"2026-05-18T01:01:16.962410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08004v1","created_at":"2026-05-18T01:01:16.962410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08004","created_at":"2026-05-18T01:01:16.962410+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3TEDVZ4CNBI","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3TEDVZ4CNBITBEX","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3TEDVZ4","created_at":"2026-05-18T12:30:22.444734+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/J3TEDVZ4CNBITBEXPW263E3GDZ","json":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ.json","graph_json":"https://pith.science/api/pith-number/J3TEDVZ4CNBITBEXPW263E3GDZ/graph.json","events_json":"https://pith.science/api/pith-number/J3TEDVZ4CNBITBEXPW263E3GDZ/events.json","paper":"https://pith.science/paper/J3TEDVZ4"},"agent_actions":{"view_html":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ","download_json":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ.json","view_paper":"https://pith.science/paper/J3TEDVZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08004&json=true","fetch_graph":"https://pith.science/api/pith-number/J3TEDVZ4CNBITBEXPW263E3GDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/J3TEDVZ4CNBITBEXPW263E3GDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/action/storage_attestation","attest_author":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/action/author_attestation","sign_citation":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/action/citation_signature","submit_replication":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/action/replication_record"}},"created_at":"2026-05-18T01:01:16.962410+00:00","updated_at":"2026-05-18T01:01:16.962410+00:00"}