{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:7MWRZHBLFENMYFXQNQ6VZEK56H","short_pith_number":"pith:7MWRZHBL","schema_version":"1.0","canonical_sha256":"fb2d1c9c2b291acc16f06c3d5c915df1f181a2ae3001b636f4a5bb2d26ab0e4b","source":{"kind":"arxiv","id":"0803.2336","version":3},"attestation_state":"computed","paper":{"title":"On the size of Kakeya sets in finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.NT"],"primary_cat":"math.CO","authors_text":"Zeev Dvir","submitted_at":"2008-03-16T16:31:49Z","abstract_excerpt":"A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the previously best lower bound for general n of ~q^{4n/7}."},"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":"0803.2336","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-16T16:31:49Z","cross_cats_sorted":["math.CA","math.NT"],"title_canon_sha256":"426a786764e09714b4d69b67110d02ffe4af5f2d67a1fe2b0a922af148a3f26d","abstract_canon_sha256":"3fe8c82342c9895c6f91cf81a3c3ca3996e15cb95921286e0c0877493401058a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:00.200762Z","signature_b64":"NYJrBrW71UsBwfgQ/AAZFF+Pubu0aclfx3gzcU/KCMMkzzz3qnqM5jMY/MYvzY8mlASzl2TaU4rK/KrRG6vnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb2d1c9c2b291acc16f06c3d5c915df1f181a2ae3001b636f4a5bb2d26ab0e4b","last_reissued_at":"2026-05-18T02:16:00.200188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:00.200188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the size of Kakeya sets in finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.NT"],"primary_cat":"math.CO","authors_text":"Zeev Dvir","submitted_at":"2008-03-16T16:31:49Z","abstract_excerpt":"A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the previously best lower bound for general n of ~q^{4n/7}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.2336","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":"0803.2336","created_at":"2026-05-18T02:16:00.200272+00:00"},{"alias_kind":"arxiv_version","alias_value":"0803.2336v3","created_at":"2026-05-18T02:16:00.200272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.2336","created_at":"2026-05-18T02:16:00.200272+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MWRZHBLFENM","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MWRZHBLFENMYFXQ","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MWRZHBL","created_at":"2026-05-18T12:25:56.245647+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/7MWRZHBLFENMYFXQNQ6VZEK56H","json":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H.json","graph_json":"https://pith.science/api/pith-number/7MWRZHBLFENMYFXQNQ6VZEK56H/graph.json","events_json":"https://pith.science/api/pith-number/7MWRZHBLFENMYFXQNQ6VZEK56H/events.json","paper":"https://pith.science/paper/7MWRZHBL"},"agent_actions":{"view_html":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H","download_json":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H.json","view_paper":"https://pith.science/paper/7MWRZHBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0803.2336&json=true","fetch_graph":"https://pith.science/api/pith-number/7MWRZHBLFENMYFXQNQ6VZEK56H/graph.json","fetch_events":"https://pith.science/api/pith-number/7MWRZHBLFENMYFXQNQ6VZEK56H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H/action/storage_attestation","attest_author":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H/action/author_attestation","sign_citation":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H/action/citation_signature","submit_replication":"https://pith.science/pith/7MWRZHBLFENMYFXQNQ6VZEK56H/action/replication_record"}},"created_at":"2026-05-18T02:16:00.200272+00:00","updated_at":"2026-05-18T02:16:00.200272+00:00"}