{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J3TEDVZ4CNBITBEXPW263E3GDZ","short_pith_number":"pith:J3TEDVZ4","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"},"canonical_sha256":"4ee641d73c13428984977db5ed93661e692aee4e36c6d505c885343dd5ba046c","source":{"kind":"arxiv","id":"1610.08004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08004","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08004v1","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08004","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"J3TEDVZ4CNBI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J3TEDVZ4CNBITBEX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J3TEDVZ4","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J3TEDVZ4CNBITBEXPW263E3GDZ","target":"record","payload":{"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"},"canonical_sha256":"4ee641d73c13428984977db5ed93661e692aee4e36c6d505c885343dd5ba046c","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"},"source_kind":"arxiv","source_id":"1610.08004","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNe0yd3kz/fvWYEze043/z0qxAxibEsWRJZTLxA3kApLN4nTuLYjvu/jTRb0J6B6bWB7bOxzVTKA8iOocUv3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:48:19.371195Z"},"content_sha256":"1ce15c9b0eceafdda92cc82b862d984045cd93b744213b2435c2411ab2d4a32d","schema_version":"1.0","event_id":"sha256:1ce15c9b0eceafdda92cc82b862d984045cd93b744213b2435c2411ab2d4a32d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J3TEDVZ4CNBITBEXPW263E3GDZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cIcp3961kdRXzgxk2xNZSrOTUg2YMQ3Xr8jkkQ30CH7XlPyG+BM/+NIciKzHT9vwjfFAUJDRYKi1xc/4M80BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:48:19.371557Z"},"content_sha256":"f6ead6f05dd4a9ce90301f60ea3f30680734932a4abaa36438a228c521e89a45","schema_version":"1.0","event_id":"sha256:f6ead6f05dd4a9ce90301f60ea3f30680734932a4abaa36438a228c521e89a45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/bundle.json","state_url":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T09:48:19Z","links":{"resolver":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ","bundle":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/bundle.json","state":"https://pith.science/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3TEDVZ4CNBITBEXPW263E3GDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J3TEDVZ4CNBITBEXPW263E3GDZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"27efbed5282a4b831ba2bf7ec45e9c26220107dd00d540f8efca9b6e195e4494","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T18:27:36Z","title_canon_sha256":"b000e22ce0d54452871c74ade23cb7479e650f8153e45a7bb1546b8add93042f"},"schema_version":"1.0","source":{"id":"1610.08004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08004","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08004v1","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08004","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"J3TEDVZ4CNBI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J3TEDVZ4CNBITBEX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J3TEDVZ4","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:f6ead6f05dd4a9ce90301f60ea3f30680734932a4abaa36438a228c521e89a45","target":"graph","created_at":"2026-05-18T01:01:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Brijesh Kumar Rai, Niladri Das","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T18:27:36Z","title":"On Fractional Linear Network Coding Solution of Multiple-Unicast Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08004","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1ce15c9b0eceafdda92cc82b862d984045cd93b744213b2435c2411ab2d4a32d","target":"record","created_at":"2026-05-18T01:01:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"27efbed5282a4b831ba2bf7ec45e9c26220107dd00d540f8efca9b6e195e4494","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-25T18:27:36Z","title_canon_sha256":"b000e22ce0d54452871c74ade23cb7479e650f8153e45a7bb1546b8add93042f"},"schema_version":"1.0","source":{"id":"1610.08004","kind":"arxiv","version":1}},"canonical_sha256":"4ee641d73c13428984977db5ed93661e692aee4e36c6d505c885343dd5ba046c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ee641d73c13428984977db5ed93661e692aee4e36c6d505c885343dd5ba046c","first_computed_at":"2026-05-18T01:01:16.962292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:16.962292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z9R0KdzH06kPn5gtfn6AD7UA3s3s6d+hOQbUog18hCbkqP6FsnD0AtiMK7exP2BPHro/FC5qJ+d9p0H9AijFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:16.962962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ce15c9b0eceafdda92cc82b862d984045cd93b744213b2435c2411ab2d4a32d","sha256:f6ead6f05dd4a9ce90301f60ea3f30680734932a4abaa36438a228c521e89a45"],"state_sha256":"85de40ff101b7615aa45eaa44d6ddd78d03298978fb5f9ae9e3c22c4fa240f12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVoJRPm7OlFsqr4LjgfOLsSfp7X3tIphX6Hu1n7SOfefXWmmjQYvy9SsUlNYnY4bH/Y7C/i/UfPU4dE7ICgLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T09:48:19.373437Z","bundle_sha256":"3d5591c1358cf27878ab9a499c649399a2330fae450d3650d35f051c3b5b8978"}}