{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z6SIWW5JKTQA4IVLRNMM7UJZ2H","short_pith_number":"pith:Z6SIWW5J","schema_version":"1.0","canonical_sha256":"cfa48b5ba954e00e22ab8b58cfd139d1f195532767df051afd1f708572fcffbe","source":{"kind":"arxiv","id":"2305.15297","version":1},"attestation_state":"computed","paper":{"title":"Strong blocking sets and minimal codes from expander graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alessandro Neri, Anurag Bishnoi, Noga Alon, Shagnik Das","submitted_at":"2023-05-24T16:22:51Z","abstract_excerpt":"A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically good codes, we explicitly construct strong blocking sets in the $(k-1)$-dimensional projective space over $\\mathbb{F}_q$ that have size $O( q k )$. Since strong blocking sets have recently been shown to be equivalent to minimal linear codes, our construction gives the first explicit construction of $\\mathbb{F}_q$-linear minimal codes of length $n$ and dimension"},"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":"2305.15297","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-24T16:22:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d1a67bd8844cbacc86dc3e6583a8ff597c75e118a92745373edfd8ea4dff9e16","abstract_canon_sha256":"040a5247246127b95de0c760e501d06f334e2a17d718fe54fd35c1d59e601cea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:33.483281Z","signature_b64":"2xHZZCs8SKGyN0ZBTPwGqUzZhpWbKpp8wf0ugdvCUeIx2MKYT2uMZfxAJ2t9tmr9EyYQTxNiQI2WmIW8SC+5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfa48b5ba954e00e22ab8b58cfd139d1f195532767df051afd1f708572fcffbe","last_reissued_at":"2026-07-05T06:13:33.482791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:33.482791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong blocking sets and minimal codes from expander graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alessandro Neri, Anurag Bishnoi, Noga Alon, Shagnik Das","submitted_at":"2023-05-24T16:22:51Z","abstract_excerpt":"A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically good codes, we explicitly construct strong blocking sets in the $(k-1)$-dimensional projective space over $\\mathbb{F}_q$ that have size $O( q k )$. Since strong blocking sets have recently been shown to be equivalent to minimal linear codes, our construction gives the first explicit construction of $\\mathbb{F}_q$-linear minimal codes of length $n$ and dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.15297","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.15297/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.15297","created_at":"2026-07-05T06:13:33.482852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.15297v1","created_at":"2026-07-05T06:13:33.482852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.15297","created_at":"2026-07-05T06:13:33.482852+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6SIWW5JKTQA","created_at":"2026-07-05T06:13:33.482852+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6SIWW5JKTQA4IVL","created_at":"2026-07-05T06:13:33.482852+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6SIWW5J","created_at":"2026-07-05T06:13:33.482852+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/Z6SIWW5JKTQA4IVLRNMM7UJZ2H","json":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H.json","graph_json":"https://pith.science/api/pith-number/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/graph.json","events_json":"https://pith.science/api/pith-number/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/events.json","paper":"https://pith.science/paper/Z6SIWW5J"},"agent_actions":{"view_html":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H","download_json":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H.json","view_paper":"https://pith.science/paper/Z6SIWW5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.15297&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/action/storage_attestation","attest_author":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/action/author_attestation","sign_citation":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/action/citation_signature","submit_replication":"https://pith.science/pith/Z6SIWW5JKTQA4IVLRNMM7UJZ2H/action/replication_record"}},"created_at":"2026-07-05T06:13:33.482852+00:00","updated_at":"2026-07-05T06:13:33.482852+00:00"}