{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LW2PI633OSL7WIHPRMPFPRTZQE","short_pith_number":"pith:LW2PI633","schema_version":"1.0","canonical_sha256":"5db4f47b7b7497fb20ef8b1e57c67981275b6756d525e11b848f4aa4fe12a2a0","source":{"kind":"arxiv","id":"1108.4257","version":3},"attestation_state":"computed","paper":{"title":"Capacity Analysis of Linear Operator Channels over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yeung, Jin Meng, Shenghao Yang, Siu-Wai Ho","submitted_at":"2011-08-22T08:55:32Z","abstract_excerpt":"Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over finite fields are studied. Both the Shannon capacity $C$ and the subspace coding capacity $C_{\\text{SS}}$ are analyzed. By establishing and comparing lower bounds on $C$ and upper bounds on $C_{\\text{SS}}$, various necessary conditions and sufficient conditions such that $C=C_{\\text{SS}}$ are obtained. A new class of LOCs such that $C=C_{\\text{SS}}$ is identified, which includes LOCs with uniform-given-rank transfer matr"},"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":"1108.4257","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-22T08:55:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e70a863cf45bef359dde42ffcfaa8b5cf9178075104baae6efb30085121d0aff","abstract_canon_sha256":"35b490e9021081a5a8716933f8e9e2129b19e468c404831ebf2ea8afc141d877"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:45.981823Z","signature_b64":"4zhtUPIU3IcLoWbZWfa1eFAhdW4LjvxuDJkn83Ht0eEFMv8twO2YWSC+UQ+s6CGw6VIenb7dvLTHJhyzNlPhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5db4f47b7b7497fb20ef8b1e57c67981275b6756d525e11b848f4aa4fe12a2a0","last_reissued_at":"2026-05-18T02:40:45.981358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:45.981358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity Analysis of Linear Operator Channels over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"En-hui Yeung, Jin Meng, Shenghao Yang, Siu-Wai Ho","submitted_at":"2011-08-22T08:55:32Z","abstract_excerpt":"Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over finite fields are studied. Both the Shannon capacity $C$ and the subspace coding capacity $C_{\\text{SS}}$ are analyzed. By establishing and comparing lower bounds on $C$ and upper bounds on $C_{\\text{SS}}$, various necessary conditions and sufficient conditions such that $C=C_{\\text{SS}}$ are obtained. A new class of LOCs such that $C=C_{\\text{SS}}$ is identified, which includes LOCs with uniform-given-rank transfer matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4257","kind":"arxiv","version":3},"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":"1108.4257","created_at":"2026-05-18T02:40:45.981424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4257v3","created_at":"2026-05-18T02:40:45.981424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4257","created_at":"2026-05-18T02:40:45.981424+00:00"},{"alias_kind":"pith_short_12","alias_value":"LW2PI633OSL7","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LW2PI633OSL7WIHP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LW2PI633","created_at":"2026-05-18T12:26:34.985390+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/LW2PI633OSL7WIHPRMPFPRTZQE","json":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE.json","graph_json":"https://pith.science/api/pith-number/LW2PI633OSL7WIHPRMPFPRTZQE/graph.json","events_json":"https://pith.science/api/pith-number/LW2PI633OSL7WIHPRMPFPRTZQE/events.json","paper":"https://pith.science/paper/LW2PI633"},"agent_actions":{"view_html":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE","download_json":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE.json","view_paper":"https://pith.science/paper/LW2PI633","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4257&json=true","fetch_graph":"https://pith.science/api/pith-number/LW2PI633OSL7WIHPRMPFPRTZQE/graph.json","fetch_events":"https://pith.science/api/pith-number/LW2PI633OSL7WIHPRMPFPRTZQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE/action/storage_attestation","attest_author":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE/action/author_attestation","sign_citation":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE/action/citation_signature","submit_replication":"https://pith.science/pith/LW2PI633OSL7WIHPRMPFPRTZQE/action/replication_record"}},"created_at":"2026-05-18T02:40:45.981424+00:00","updated_at":"2026-05-18T02:40:45.981424+00:00"}