{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VR4P4QISANCJS6W344DLNPRVV5","short_pith_number":"pith:VR4P4QIS","schema_version":"1.0","canonical_sha256":"ac78fe41120344997adbe706b6be35af5632c492c06feccb227f9ff7bafdf6c3","source":{"kind":"arxiv","id":"1410.2725","version":1},"attestation_state":"computed","paper":{"title":"On the Bounds of Certain Maximal Linear Codes in a Projective Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Srikanth Pai","submitted_at":"2014-10-10T10:14:26Z","abstract_excerpt":"The set of all subspaces of $\\mathbb{F}_q^n$ is denoted by $\\mathbb{P}_q(n)$. The subspace distance $d_S(X,Y) = \\dim(X)+ \\dim(Y) - 2\\dim(X \\cap Y)$ defined on $\\mathbb{P}_q(n)$ turns it into a natural coding space for error correction in random network coding. A subset of $\\mathbb{P}_q(n)$ is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of $\\mathbb{P}_q(n)$. Braun, Etzion and Vardy conjectured that the largest cardinality of a linear code, that contains $\\mathbb{F}_q^n$, "},"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":"1410.2725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T10:14:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0f7a603f7e04ba65ed69f5633feace78592ab367c634317c67a880e91ce2e503","abstract_canon_sha256":"87206ebf3fbe84dbf7b9ec0a1bd2a06c8b9c06e6e72d223cbcfd5b64e1746bd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:37.371699Z","signature_b64":"WmuTH7rV4MjLzfSmlYfFucz50V62+i2dVgZBUZ5aA6u02Sium3GtOrgmYJiKuZeVxMjas59BMpSGO8WSuNnBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac78fe41120344997adbe706b6be35af5632c492c06feccb227f9ff7bafdf6c3","last_reissued_at":"2026-05-18T02:40:37.371097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:37.371097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Bounds of Certain Maximal Linear Codes in a Projective Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Srikanth Pai","submitted_at":"2014-10-10T10:14:26Z","abstract_excerpt":"The set of all subspaces of $\\mathbb{F}_q^n$ is denoted by $\\mathbb{P}_q(n)$. The subspace distance $d_S(X,Y) = \\dim(X)+ \\dim(Y) - 2\\dim(X \\cap Y)$ defined on $\\mathbb{P}_q(n)$ turns it into a natural coding space for error correction in random network coding. A subset of $\\mathbb{P}_q(n)$ is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of $\\mathbb{P}_q(n)$. Braun, Etzion and Vardy conjectured that the largest cardinality of a linear code, that contains $\\mathbb{F}_q^n$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2725","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":"1410.2725","created_at":"2026-05-18T02:40:37.371189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2725v1","created_at":"2026-05-18T02:40:37.371189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2725","created_at":"2026-05-18T02:40:37.371189+00:00"},{"alias_kind":"pith_short_12","alias_value":"VR4P4QISANCJ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VR4P4QISANCJS6W3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VR4P4QIS","created_at":"2026-05-18T12:28:54.890064+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/VR4P4QISANCJS6W344DLNPRVV5","json":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5.json","graph_json":"https://pith.science/api/pith-number/VR4P4QISANCJS6W344DLNPRVV5/graph.json","events_json":"https://pith.science/api/pith-number/VR4P4QISANCJS6W344DLNPRVV5/events.json","paper":"https://pith.science/paper/VR4P4QIS"},"agent_actions":{"view_html":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5","download_json":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5.json","view_paper":"https://pith.science/paper/VR4P4QIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2725&json=true","fetch_graph":"https://pith.science/api/pith-number/VR4P4QISANCJS6W344DLNPRVV5/graph.json","fetch_events":"https://pith.science/api/pith-number/VR4P4QISANCJS6W344DLNPRVV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5/action/storage_attestation","attest_author":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5/action/author_attestation","sign_citation":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5/action/citation_signature","submit_replication":"https://pith.science/pith/VR4P4QISANCJS6W344DLNPRVV5/action/replication_record"}},"created_at":"2026-05-18T02:40:37.371189+00:00","updated_at":"2026-05-18T02:40:37.371189+00:00"}