{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LKUJIFNM36VYGIABLABUYP5EHR","short_pith_number":"pith:LKUJIFNM","schema_version":"1.0","canonical_sha256":"5aa89415acdfab83200158034c3fa43c79ad8e71d577fca3af8ef904f612b310","source":{"kind":"arxiv","id":"2510.14585","version":2},"attestation_state":"computed","paper":{"title":"A Structural Condition on Point Sets with Few Distinct Dot Products","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Anshula Gandhi","submitted_at":"2025-10-16T11:43:13Z","abstract_excerpt":"The distinct dot products problem, a variant of the Erd\\H{o}s distinct distances problem, asks \"Given a set $P_n$ of $n$ points in $\\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?\" The best proven lower bound is $|D(P_n)| = \\Omega(n^{2/3+7/1425})$, due to work by Hanson$\\unicode{x2013}$Roche-Newton$\\unicode{x2013}$Senger, and a recent improvement by Kokkinos. However, the best known construction determines $\\Theta(n)$ dot products. We provide a structural condition that a point configuration $P_n$ would have to satisfy in order to have 'few' dot pr"},"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":"2510.14585","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-10-16T11:43:13Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"08d0e1591eb89f04ea278ab616c6fbfda0011adcdd818187a592aaa159b06962","abstract_canon_sha256":"a43dee04c8f527e6510970af93f18ac0867681dc17804c14d8f2ff6e30f94f06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:43.833748Z","signature_b64":"xtDw57UTwm+ePoDVUagkIMQI2e1SjQG1CZn2ocRGxx6k5eCEtW+SzcKGIRwt2sD5kkVzmQDmQ6lN4psgTUSsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa89415acdfab83200158034c3fa43c79ad8e71d577fca3af8ef904f612b310","last_reissued_at":"2026-05-28T02:04:43.833132Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:43.833132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Structural Condition on Point Sets with Few Distinct Dot Products","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Anshula Gandhi","submitted_at":"2025-10-16T11:43:13Z","abstract_excerpt":"The distinct dot products problem, a variant of the Erd\\H{o}s distinct distances problem, asks \"Given a set $P_n$ of $n$ points in $\\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?\" The best proven lower bound is $|D(P_n)| = \\Omega(n^{2/3+7/1425})$, due to work by Hanson$\\unicode{x2013}$Roche-Newton$\\unicode{x2013}$Senger, and a recent improvement by Kokkinos. However, the best known construction determines $\\Theta(n)$ dot products. We provide a structural condition that a point configuration $P_n$ would have to satisfy in order to have 'few' dot pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.14585","kind":"arxiv","version":2},"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/2510.14585/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":"2510.14585","created_at":"2026-05-28T02:04:43.833204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.14585v2","created_at":"2026-05-28T02:04:43.833204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.14585","created_at":"2026-05-28T02:04:43.833204+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKUJIFNM36VY","created_at":"2026-05-28T02:04:43.833204+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKUJIFNM36VYGIAB","created_at":"2026-05-28T02:04:43.833204+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKUJIFNM","created_at":"2026-05-28T02:04:43.833204+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/LKUJIFNM36VYGIABLABUYP5EHR","json":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR.json","graph_json":"https://pith.science/api/pith-number/LKUJIFNM36VYGIABLABUYP5EHR/graph.json","events_json":"https://pith.science/api/pith-number/LKUJIFNM36VYGIABLABUYP5EHR/events.json","paper":"https://pith.science/paper/LKUJIFNM"},"agent_actions":{"view_html":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR","download_json":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR.json","view_paper":"https://pith.science/paper/LKUJIFNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.14585&json=true","fetch_graph":"https://pith.science/api/pith-number/LKUJIFNM36VYGIABLABUYP5EHR/graph.json","fetch_events":"https://pith.science/api/pith-number/LKUJIFNM36VYGIABLABUYP5EHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR/action/storage_attestation","attest_author":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR/action/author_attestation","sign_citation":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR/action/citation_signature","submit_replication":"https://pith.science/pith/LKUJIFNM36VYGIABLABUYP5EHR/action/replication_record"}},"created_at":"2026-05-28T02:04:43.833204+00:00","updated_at":"2026-05-28T02:04:43.833204+00:00"}