{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D52SOZJR67BSX4YX7Z222SHUTW","short_pith_number":"pith:D52SOZJR","schema_version":"1.0","canonical_sha256":"1f75276531f7c32bf317fe75ad48f49d86932a64ac882bf8d239ee569bd3327c","source":{"kind":"arxiv","id":"1706.01152","version":2},"attestation_state":"computed","paper":{"title":"Capacity and Achievable Rate Regions for Linear Network Coding over Ring Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph Connelly, Kenneth Zeger","submitted_at":"2017-06-04T21:40:08Z","abstract_excerpt":"The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general cases of arbitrary ring and module alphabets. For non-commutative rings, two-sided linearity is allowed. Specifically, we prove the following for directed acyclic networks:\n  (i) The linear rate region and the linear capacity of any network over a finite field depend only on the characteristic of the field. Furthermore, any two fields with different characteris"},"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":"1706.01152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-04T21:40:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c114cf4b3345a074b2f5a730839f5a92f87ba7cb6c9a5401890946c31aff9d2","abstract_canon_sha256":"39a96eb4a5790a1b87981becf51ad2c116a89021fb10325c54838fdd3eb70d72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:54.413041Z","signature_b64":"1gIYTqw7jNHiRKAE/ZZDiHpGv0FsU0xTyzF/xgxZYaf7xgYhbD7tyW7V8vrfVgGDUZzKy27Y+O1JqYn4Czu0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f75276531f7c32bf317fe75ad48f49d86932a64ac882bf8d239ee569bd3327c","last_reissued_at":"2026-05-18T00:24:54.412392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:54.412392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity and Achievable Rate Regions for Linear Network Coding over Ring Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joseph Connelly, Kenneth Zeger","submitted_at":"2017-06-04T21:40:08Z","abstract_excerpt":"The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general cases of arbitrary ring and module alphabets. For non-commutative rings, two-sided linearity is allowed. Specifically, we prove the following for directed acyclic networks:\n  (i) The linear rate region and the linear capacity of any network over a finite field depend only on the characteristic of the field. Furthermore, any two fields with different characteris"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01152","kind":"arxiv","version":2},"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":"1706.01152","created_at":"2026-05-18T00:24:54.412498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01152v2","created_at":"2026-05-18T00:24:54.412498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01152","created_at":"2026-05-18T00:24:54.412498+00:00"},{"alias_kind":"pith_short_12","alias_value":"D52SOZJR67BS","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D52SOZJR67BSX4YX","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D52SOZJR","created_at":"2026-05-18T12:31:10.602751+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/D52SOZJR67BSX4YX7Z222SHUTW","json":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW.json","graph_json":"https://pith.science/api/pith-number/D52SOZJR67BSX4YX7Z222SHUTW/graph.json","events_json":"https://pith.science/api/pith-number/D52SOZJR67BSX4YX7Z222SHUTW/events.json","paper":"https://pith.science/paper/D52SOZJR"},"agent_actions":{"view_html":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW","download_json":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW.json","view_paper":"https://pith.science/paper/D52SOZJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01152&json=true","fetch_graph":"https://pith.science/api/pith-number/D52SOZJR67BSX4YX7Z222SHUTW/graph.json","fetch_events":"https://pith.science/api/pith-number/D52SOZJR67BSX4YX7Z222SHUTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW/action/storage_attestation","attest_author":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW/action/author_attestation","sign_citation":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW/action/citation_signature","submit_replication":"https://pith.science/pith/D52SOZJR67BSX4YX7Z222SHUTW/action/replication_record"}},"created_at":"2026-05-18T00:24:54.412498+00:00","updated_at":"2026-05-18T00:24:54.412498+00:00"}