{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5QL4XY3RD5L4CMLGD3KJZ7YIKB","short_pith_number":"pith:5QL4XY3R","schema_version":"1.0","canonical_sha256":"ec17cbe3711f57c131661ed49cff08505aee9fd8860c13616757a9a1f8713e2e","source":{"kind":"arxiv","id":"1601.03803","version":1},"attestation_state":"computed","paper":{"title":"A Class of Non-Linearly Solvable Networks","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":"2016-01-15T03:23:14Z","abstract_excerpt":"For each integer $m \\geq 2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module alphabet and is not asymptotically linear solvable over any finite-field alphabet. The network's capacity is shown to equal one, and when $m$ is composite, its linear capacity is shown to be bounded away from one for all finite-field alphabets."},"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":"1601.03803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T03:23:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dee6b7ffb3764daa95e882e7e5bfd7836aba140bb140deb35d52871f5fb6a392","abstract_canon_sha256":"cae75f5e0bbd4779f19ec8e28e1c96b755a643a05f7ff6a025d3cca163266c6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:54.534790Z","signature_b64":"c9hKA/7FyoZji/zv7rscGJqqgtUUbVHiWExcteP6GFJ5l69/24r7jsxLfCL9cFrNLBY94ryznWzDoyHtQvKSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec17cbe3711f57c131661ed49cff08505aee9fd8860c13616757a9a1f8713e2e","last_reissued_at":"2026-05-18T00:24:54.534070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:54.534070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Class of Non-Linearly Solvable Networks","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":"2016-01-15T03:23:14Z","abstract_excerpt":"For each integer $m \\geq 2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module alphabet and is not asymptotically linear solvable over any finite-field alphabet. The network's capacity is shown to equal one, and when $m$ is composite, its linear capacity is shown to be bounded away from one for all finite-field alphabets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03803","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":"1601.03803","created_at":"2026-05-18T00:24:54.534187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03803v1","created_at":"2026-05-18T00:24:54.534187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03803","created_at":"2026-05-18T00:24:54.534187+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QL4XY3RD5L4","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QL4XY3RD5L4CMLG","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QL4XY3R","created_at":"2026-05-18T12:30:01.593930+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/5QL4XY3RD5L4CMLGD3KJZ7YIKB","json":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB.json","graph_json":"https://pith.science/api/pith-number/5QL4XY3RD5L4CMLGD3KJZ7YIKB/graph.json","events_json":"https://pith.science/api/pith-number/5QL4XY3RD5L4CMLGD3KJZ7YIKB/events.json","paper":"https://pith.science/paper/5QL4XY3R"},"agent_actions":{"view_html":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB","download_json":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB.json","view_paper":"https://pith.science/paper/5QL4XY3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03803&json=true","fetch_graph":"https://pith.science/api/pith-number/5QL4XY3RD5L4CMLGD3KJZ7YIKB/graph.json","fetch_events":"https://pith.science/api/pith-number/5QL4XY3RD5L4CMLGD3KJZ7YIKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB/action/storage_attestation","attest_author":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB/action/author_attestation","sign_citation":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB/action/citation_signature","submit_replication":"https://pith.science/pith/5QL4XY3RD5L4CMLGD3KJZ7YIKB/action/replication_record"}},"created_at":"2026-05-18T00:24:54.534187+00:00","updated_at":"2026-05-18T00:24:54.534187+00:00"}