{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RWDPBMSSEK2N6VDFPJRQP47X5W","short_pith_number":"pith:RWDPBMSS","schema_version":"1.0","canonical_sha256":"8d86f0b25222b4df54657a6307f3f7eda743b7e68f54beaeaad7d9430bea2858","source":{"kind":"arxiv","id":"2509.06935","version":1},"attestation_state":"computed","paper":{"title":"On subsets of lattice cubes avoiding affine and spherical degeneracies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anubhab Ghosal, Peter Keevash, Ritesh Goenka","submitted_at":"2025-09-08T17:47:38Z","abstract_excerpt":"For integers $1 < k < d-1$ and $r \\ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of Sudakov-Tomon and Lefmann. Further, we provide a randomised construction for the no-four-on-a-circle problem posed by Erd\\H{o}s and Purdy, improving Thiele's bound. We also consider the random construction in higher dimensions, and improve the bound of Suk and White for $d \\geq 4$. In each case, we apply the deletion method, using results from number theory and incid"},"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":"2509.06935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-08T17:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"0173ff3fc009b0473761f824780d869b7df78d94ec2dc1373c88b6dd68a3046d","abstract_canon_sha256":"d507ab9e94c0f3858974f19278dc53f917ba9bd03f64db7341bb2fbbc48fe087"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:55.391949Z","signature_b64":"lteqFU5iN7P2Ca5FJQX/qqxPeHfmyqjwgHcpwwmx2AjuXHnI7qLnNC5ASgEeGvkIUlVSMyRKfWurRpUv0W1sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d86f0b25222b4df54657a6307f3f7eda743b7e68f54beaeaad7d9430bea2858","last_reissued_at":"2026-07-05T12:06:55.391480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:55.391480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On subsets of lattice cubes avoiding affine and spherical degeneracies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anubhab Ghosal, Peter Keevash, Ritesh Goenka","submitted_at":"2025-09-08T17:47:38Z","abstract_excerpt":"For integers $1 < k < d-1$ and $r \\ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of Sudakov-Tomon and Lefmann. Further, we provide a randomised construction for the no-four-on-a-circle problem posed by Erd\\H{o}s and Purdy, improving Thiele's bound. We also consider the random construction in higher dimensions, and improve the bound of Suk and White for $d \\geq 4$. In each case, we apply the deletion method, using results from number theory and incid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06935","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/2509.06935/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":"2509.06935","created_at":"2026-07-05T12:06:55.391538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06935v1","created_at":"2026-07-05T12:06:55.391538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06935","created_at":"2026-07-05T12:06:55.391538+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWDPBMSSEK2N","created_at":"2026-07-05T12:06:55.391538+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWDPBMSSEK2N6VDF","created_at":"2026-07-05T12:06:55.391538+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWDPBMSS","created_at":"2026-07-05T12:06:55.391538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05255","citing_title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02864","citing_title":"Mathematical exploration and discovery at scale","ref_index":142,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05498","citing_title":"Sets with Few Subset Sums","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07000","citing_title":"A note on the extensible no-three-in-line problem","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W","json":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W.json","graph_json":"https://pith.science/api/pith-number/RWDPBMSSEK2N6VDFPJRQP47X5W/graph.json","events_json":"https://pith.science/api/pith-number/RWDPBMSSEK2N6VDFPJRQP47X5W/events.json","paper":"https://pith.science/paper/RWDPBMSS"},"agent_actions":{"view_html":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W","download_json":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W.json","view_paper":"https://pith.science/paper/RWDPBMSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06935&json=true","fetch_graph":"https://pith.science/api/pith-number/RWDPBMSSEK2N6VDFPJRQP47X5W/graph.json","fetch_events":"https://pith.science/api/pith-number/RWDPBMSSEK2N6VDFPJRQP47X5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W/action/storage_attestation","attest_author":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W/action/author_attestation","sign_citation":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W/action/citation_signature","submit_replication":"https://pith.science/pith/RWDPBMSSEK2N6VDFPJRQP47X5W/action/replication_record"}},"created_at":"2026-07-05T12:06:55.391538+00:00","updated_at":"2026-07-05T12:06:55.391538+00:00"}