{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZYAR5RZ6OCEQTUXC3JWNRN72DM","short_pith_number":"pith:ZYAR5RZ6","schema_version":"1.0","canonical_sha256":"ce011ec73e708909d2e2da6cd8b7fa1b01b2b7055beb2347113eac1a7c4b882c","source":{"kind":"arxiv","id":"2311.10666","version":3},"attestation_state":"computed","paper":{"title":"A tight lower bound on the minimal dispersion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jan Volec, Jan Vyb\\'iral, Mat\\v{e}j Tr\\\"odler","submitted_at":"2023-11-17T17:39:36Z","abstract_excerpt":"We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce bounding the dispersion to a problem in extremal set theory. Specifically, we translate a lower bound on the size of $r$-cover-free families to a lower bound on the inverse of the minimal dispersion of a point set. The lower bound we obtain matches the recently obtained upper bound on the minimal dispersion up to logarithmic terms."},"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":"2311.10666","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2023-11-17T17:39:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"617cb1f9fd452fa04e5ae921dd99f61976f71807385a801cad9480bddddbf7c5","abstract_canon_sha256":"6f0fa092c30860b43cdac5bba4c5addf33fcb471c9fa6eca80d464ae67981d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:03.997010Z","signature_b64":"wjPBrQqedoRt5eeFF6/4cRoBnjJuYwdq1Ccqyk02T7WyrRn9GleY/zKe1jfxFG7PvOn/Sma87JPdUFBYjhXPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce011ec73e708909d2e2da6cd8b7fa1b01b2b7055beb2347113eac1a7c4b882c","last_reissued_at":"2026-06-12T01:09:03.995745Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:03.995745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight lower bound on the minimal dispersion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jan Volec, Jan Vyb\\'iral, Mat\\v{e}j Tr\\\"odler","submitted_at":"2023-11-17T17:39:36Z","abstract_excerpt":"We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce bounding the dispersion to a problem in extremal set theory. Specifically, we translate a lower bound on the size of $r$-cover-free families to a lower bound on the inverse of the minimal dispersion of a point set. The lower bound we obtain matches the recently obtained upper bound on the minimal dispersion up to logarithmic terms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10666","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.10666/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":"2311.10666","created_at":"2026-06-12T01:09:03.995874+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.10666v3","created_at":"2026-06-12T01:09:03.995874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10666","created_at":"2026-06-12T01:09:03.995874+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYAR5RZ6OCEQ","created_at":"2026-06-12T01:09:03.995874+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYAR5RZ6OCEQTUXC","created_at":"2026-06-12T01:09:03.995874+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYAR5RZ6","created_at":"2026-06-12T01:09:03.995874+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/ZYAR5RZ6OCEQTUXC3JWNRN72DM","json":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM.json","graph_json":"https://pith.science/api/pith-number/ZYAR5RZ6OCEQTUXC3JWNRN72DM/graph.json","events_json":"https://pith.science/api/pith-number/ZYAR5RZ6OCEQTUXC3JWNRN72DM/events.json","paper":"https://pith.science/paper/ZYAR5RZ6"},"agent_actions":{"view_html":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM","download_json":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM.json","view_paper":"https://pith.science/paper/ZYAR5RZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.10666&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYAR5RZ6OCEQTUXC3JWNRN72DM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYAR5RZ6OCEQTUXC3JWNRN72DM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM/action/storage_attestation","attest_author":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM/action/author_attestation","sign_citation":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM/action/citation_signature","submit_replication":"https://pith.science/pith/ZYAR5RZ6OCEQTUXC3JWNRN72DM/action/replication_record"}},"created_at":"2026-06-12T01:09:03.995874+00:00","updated_at":"2026-06-12T01:09:03.995874+00:00"}