{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:X4T54IGDON7RGXAY5I4HAIGULZ","short_pith_number":"pith:X4T54IGD","schema_version":"1.0","canonical_sha256":"bf27de20c3737f135c18ea387020d45e57cfa2c04436fba3b99d3c9ae0057829","source":{"kind":"arxiv","id":"2606.27352","version":1},"attestation_state":"computed","paper":{"title":"Congruent copies of finite patterns in planar point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Ritesh Goenka, Shubhrajit Bhattacharya","submitted_at":"2026-06-25T17:56:01Z","abstract_excerpt":"Given a finite nonempty planar point set $S$, what is the maximum number of congruent copies of $S$ contained in a set of $n$ points in the Euclidean plane? Building on OpenAI's recent breakthrough on the unit distance problem, we construct planar sets consisting of $n$ points that contain $\\Omega_S(n^{1+\\delta_S})$ congruent copies of $S$, for some positive constant $\\delta_S$ depending only on $S$. This answers a question of Brass and Pach in a strong form, and makes progress on questions posed by Erd\\H{o}s and Purdy, and \\'Abrego and Fern\\'andez-Merchant. Our proof uses the number field con"},"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":"2606.27352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-25T17:56:01Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"3c9667267733b461cea0795808e7a545a57b2d693e49ed7e5ed395f43888bfcb","abstract_canon_sha256":"d644badbf559c947ded291f4730eba64b54a1b5f6c42970e33291b863e9f84f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:19.588365Z","signature_b64":"erBdbnAXWDffbRxcU4ypeaC2m7EL5XQaPJFAEWnf+V9W0DQhdx7LdaszfFE7JLxZ/n9p/z844cewrE7JpMzrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf27de20c3737f135c18ea387020d45e57cfa2c04436fba3b99d3c9ae0057829","last_reissued_at":"2026-06-26T01:16:19.587864Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:19.587864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Congruent copies of finite patterns in planar point sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Ritesh Goenka, Shubhrajit Bhattacharya","submitted_at":"2026-06-25T17:56:01Z","abstract_excerpt":"Given a finite nonempty planar point set $S$, what is the maximum number of congruent copies of $S$ contained in a set of $n$ points in the Euclidean plane? Building on OpenAI's recent breakthrough on the unit distance problem, we construct planar sets consisting of $n$ points that contain $\\Omega_S(n^{1+\\delta_S})$ congruent copies of $S$, for some positive constant $\\delta_S$ depending only on $S$. This answers a question of Brass and Pach in a strong form, and makes progress on questions posed by Erd\\H{o}s and Purdy, and \\'Abrego and Fern\\'andez-Merchant. Our proof uses the number field con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27352","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/2606.27352/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":"2606.27352","created_at":"2026-06-26T01:16:19.587925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27352v1","created_at":"2026-06-26T01:16:19.587925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27352","created_at":"2026-06-26T01:16:19.587925+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4T54IGDON7R","created_at":"2026-06-26T01:16:19.587925+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4T54IGDON7RGXAY","created_at":"2026-06-26T01:16:19.587925+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4T54IGD","created_at":"2026-06-26T01:16:19.587925+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/X4T54IGDON7RGXAY5I4HAIGULZ","json":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ.json","graph_json":"https://pith.science/api/pith-number/X4T54IGDON7RGXAY5I4HAIGULZ/graph.json","events_json":"https://pith.science/api/pith-number/X4T54IGDON7RGXAY5I4HAIGULZ/events.json","paper":"https://pith.science/paper/X4T54IGD"},"agent_actions":{"view_html":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ","download_json":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ.json","view_paper":"https://pith.science/paper/X4T54IGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27352&json=true","fetch_graph":"https://pith.science/api/pith-number/X4T54IGDON7RGXAY5I4HAIGULZ/graph.json","fetch_events":"https://pith.science/api/pith-number/X4T54IGDON7RGXAY5I4HAIGULZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/action/storage_attestation","attest_author":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/action/author_attestation","sign_citation":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/action/citation_signature","submit_replication":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/action/replication_record"}},"created_at":"2026-06-26T01:16:19.587925+00:00","updated_at":"2026-06-26T01:16:19.587925+00:00"}