{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F6UNKGDW2MWYPBVH5FRY47VMXG","short_pith_number":"pith:F6UNKGDW","schema_version":"1.0","canonical_sha256":"2fa8d51876d32d8786a7e9638e7eacb9b7eff035cc1de4b9495e5c3cb64dd1af","source":{"kind":"arxiv","id":"1407.0848","version":3},"attestation_state":"computed","paper":{"title":"Squares of Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Mirandola, Gilles Z\\'emor, Ignacio Cascudo, Ronald Cramer","submitted_at":"2014-07-03T10:15:49Z","abstract_excerpt":"Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code \"typically\" fill the whole space? We give a positive answer, for codes of dimension $k$ and length roughly $\\frac{1}{2}k^2$ or smaller. Moreover, the convergence speed is exponential if the difference $k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the pre"},"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":"1407.0848","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-03T10:15:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a5f7cad98e62ec09180a90c6afaa8a0d82f4e223b8e98ce90127932fdb0f1359","abstract_canon_sha256":"56ae4f3f250f3d2aa116b463be33c5642ac6aab70cec8542cb2f83608bf99af0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.692798Z","signature_b64":"fUArcMF01o52orqUuhLOuLU9Jdpt8JOlc6l/s9RkMFfKz20j4zJVzhXIZVEa0LzeKa5T21fFJOktXr5XtHhDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fa8d51876d32d8786a7e9638e7eacb9b7eff035cc1de4b9495e5c3cb64dd1af","last_reissued_at":"2026-05-18T00:57:51.692209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.692209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Squares of Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Mirandola, Gilles Z\\'emor, Ignacio Cascudo, Ronald Cramer","submitted_at":"2014-07-03T10:15:49Z","abstract_excerpt":"Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code \"typically\" fill the whole space? We give a positive answer, for codes of dimension $k$ and length roughly $\\frac{1}{2}k^2$ or smaller. Moreover, the convergence speed is exponential if the difference $k(k+1)/2-n$ is at least linear in $k$. The proof uses random coding and combinatorial arguments, together with algebraic tools involving the pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0848","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":"1407.0848","created_at":"2026-05-18T00:57:51.692282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0848v3","created_at":"2026-05-18T00:57:51.692282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0848","created_at":"2026-05-18T00:57:51.692282+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6UNKGDW2MWY","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6UNKGDW2MWYPBVH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6UNKGDW","created_at":"2026-05-18T12:28:28.263976+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/F6UNKGDW2MWYPBVH5FRY47VMXG","json":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG.json","graph_json":"https://pith.science/api/pith-number/F6UNKGDW2MWYPBVH5FRY47VMXG/graph.json","events_json":"https://pith.science/api/pith-number/F6UNKGDW2MWYPBVH5FRY47VMXG/events.json","paper":"https://pith.science/paper/F6UNKGDW"},"agent_actions":{"view_html":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG","download_json":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG.json","view_paper":"https://pith.science/paper/F6UNKGDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0848&json=true","fetch_graph":"https://pith.science/api/pith-number/F6UNKGDW2MWYPBVH5FRY47VMXG/graph.json","fetch_events":"https://pith.science/api/pith-number/F6UNKGDW2MWYPBVH5FRY47VMXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG/action/storage_attestation","attest_author":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG/action/author_attestation","sign_citation":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG/action/citation_signature","submit_replication":"https://pith.science/pith/F6UNKGDW2MWYPBVH5FRY47VMXG/action/replication_record"}},"created_at":"2026-05-18T00:57:51.692282+00:00","updated_at":"2026-05-18T00:57:51.692282+00:00"}