{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VUNXEY2LO3U6TP42534XDZYW53","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":"e4fb86747be42314f3e6031d77318d07abc1040f04a81f0690e07d5546c6a4b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T16:37:54Z","title_canon_sha256":"124f3449d6e79cf08e15a736d8baf5a5e98ed5d979dfe1236d03889da1b3ca1a"},"schema_version":"1.0","source":{"id":"1610.08408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08408","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08408v1","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08408","created_at":"2026-05-18T01:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"VUNXEY2LO3U6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VUNXEY2LO3U6TP42","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VUNXEY2L","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:322c93c928ebff032c20f46c7a71d260a927246953aa6433f990919f7ad9b6a0","target":"graph","created_at":"2026-05-18T01:01:09Z","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":"Sum-networks are networks where all the terminals demand the sum of the symbols generated at the sources. It has been shown that for any finite set/co-finite set of prime numbers, there exists a sum-network which has a vector linear solution if and only if the characteristic of the finite field belongs to the given set. It has also been shown that for any positive rational number $k/n$, there exists a sum-network which has capacity equal to $k/n$. It is a natural question whether, for any positive rational number $k/n$, and for any finite set/co-finite set of primes $\\{p_1,p_2,\\ldots,p_l\\}$, t","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-26T16:37:54Z","title":"Sum-networks: Dependency on Characteristic of the Finite Field under Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08408","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:155e126cc8a3c260ed0d291f031cab9ed8f674f72ccaeab2543f7a46d01e1b4b","target":"record","created_at":"2026-05-18T01:01:09Z","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":"e4fb86747be42314f3e6031d77318d07abc1040f04a81f0690e07d5546c6a4b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-26T16:37:54Z","title_canon_sha256":"124f3449d6e79cf08e15a736d8baf5a5e98ed5d979dfe1236d03889da1b3ca1a"},"schema_version":"1.0","source":{"id":"1610.08408","kind":"arxiv","version":1}},"canonical_sha256":"ad1b72634b76e9e9bf9aeef971e716eefb2dc64907e6e08b813646c63ac9e074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad1b72634b76e9e9bf9aeef971e716eefb2dc64907e6e08b813646c63ac9e074","first_computed_at":"2026-05-18T01:01:09.745271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:09.745271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2v5UEsS4vZYXUdBoQo5i6QA+XxM4mgO2rDoD+sPpyYRLh4HF2nDyo7ceAmmrUZug1G/XYGuRhkZgAO6mzhPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:09.745968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:155e126cc8a3c260ed0d291f031cab9ed8f674f72ccaeab2543f7a46d01e1b4b","sha256:322c93c928ebff032c20f46c7a71d260a927246953aa6433f990919f7ad9b6a0"],"state_sha256":"89f04a76cfab4208db8c604500cf7dbeb8999029d323e25bbae4c911b3a62f83"}