{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM","short_pith_number":"pith:PLGJG3ZQ","schema_version":"1.0","canonical_sha256":"7acc936f305a969cecab4e7b383a1f33383ae0b626e1b3685a66303e6b2495c3","source":{"kind":"arxiv","id":"1804.09511","version":1},"attestation_state":"computed","paper":{"title":"A new lower bound for the size of an affine blocking set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geertrui Van de Voorde, Maarten De Boeck","submitted_at":"2018-04-25T12:20:57Z","abstract_excerpt":"A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen and Silverman. In this note, we improve on this result by showing that a blocking set of an affine plane of order $q$, $q\\geq 25$, contains at least $q+\\lfloor\\sqrt{q}\\rfloor+3$ points."},"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":"1804.09511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-25T12:20:57Z","cross_cats_sorted":[],"title_canon_sha256":"a5ce2d34d8dd55036cd7c39424b0196548dcc384d4bdfe4cc4682d8567fcc763","abstract_canon_sha256":"7679a57338c4ff24cfd27a32f53f2536d4a43ed94363410d6b71e7104e8c77b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.579185Z","signature_b64":"n3qgClmTSm/zqc+A7Q6IZIaSZT9+6a1GH2yyLZTEz+0rd32OC/fnVPvxJejBQZaqcHEhsgvt8El5IvokNBk2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7acc936f305a969cecab4e7b383a1f33383ae0b626e1b3685a66303e6b2495c3","last_reissued_at":"2026-05-18T00:17:31.578574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.578574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new lower bound for the size of an affine blocking set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geertrui Van de Voorde, Maarten De Boeck","submitted_at":"2018-04-25T12:20:57Z","abstract_excerpt":"A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen and Silverman. In this note, we improve on this result by showing that a blocking set of an affine plane of order $q$, $q\\geq 25$, contains at least $q+\\lfloor\\sqrt{q}\\rfloor+3$ points."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09511","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":"1804.09511","created_at":"2026-05-18T00:17:31.578668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09511v1","created_at":"2026-05-18T00:17:31.578668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09511","created_at":"2026-05-18T00:17:31.578668+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLGJG3ZQLKLJ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLGJG3ZQLKLJZ3FL","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLGJG3ZQ","created_at":"2026-05-18T12:32:46.962924+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/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM","json":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM.json","graph_json":"https://pith.science/api/pith-number/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/graph.json","events_json":"https://pith.science/api/pith-number/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/events.json","paper":"https://pith.science/paper/PLGJG3ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM","download_json":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM.json","view_paper":"https://pith.science/paper/PLGJG3ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09511&json=true","fetch_graph":"https://pith.science/api/pith-number/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/graph.json","fetch_events":"https://pith.science/api/pith-number/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/action/storage_attestation","attest_author":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/action/author_attestation","sign_citation":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/action/citation_signature","submit_replication":"https://pith.science/pith/PLGJG3ZQLKLJZ3FLJZ5TQOQ7GM/action/replication_record"}},"created_at":"2026-05-18T00:17:31.578668+00:00","updated_at":"2026-05-18T00:17:31.578668+00:00"}