{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:X4T54IGDON7RGXAY5I4HAIGULZ","short_pith_number":"pith:X4T54IGD","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"},"canonical_sha256":"bf27de20c3737f135c18ea387020d45e57cfa2c04436fba3b99d3c9ae0057829","source":{"kind":"arxiv","id":"2606.27352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27352","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27352v1","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27352","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"X4T54IGDON7R","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"pith_short_16","alias_value":"X4T54IGDON7RGXAY","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"pith_short_8","alias_value":"X4T54IGD","created_at":"2026-06-26T01:16:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:X4T54IGDON7RGXAY5I4HAIGULZ","target":"record","payload":{"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"},"canonical_sha256":"bf27de20c3737f135c18ea387020d45e57cfa2c04436fba3b99d3c9ae0057829","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"},"source_kind":"arxiv","source_id":"2606.27352","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-26T01:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17+yistDFHSNmsz37Y2/TYAqUwY5gKm/LpNx08KIABu+ltzn1FxnNqiQph85ITWbuF54zSrm6LXhRKqLFZ7sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T22:43:02.387270Z"},"content_sha256":"23df6c74f1c904b9f144c9d05660471db4f58a7d8aa3d9817bc36ec1c5233ea5","schema_version":"1.0","event_id":"sha256:23df6c74f1c904b9f144c9d05660471db4f58a7d8aa3d9817bc36ec1c5233ea5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:X4T54IGDON7RGXAY5I4HAIGULZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-26T01:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDiPMoOua5lBFmUQ4CIvwbjH1fCpLmT7cfmlax/JXTOQPCX5Mi635ITbAVFpoKBBKwm6CPsYLmI5rzDj5jq6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T22:43:02.387656Z"},"content_sha256":"8ee02f28719e86e13e1280e5d65086b7de31b936b804a52046519bebf903fe4e","schema_version":"1.0","event_id":"sha256:8ee02f28719e86e13e1280e5d65086b7de31b936b804a52046519bebf903fe4e"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:X4T54IGDON7RGXAY5I4HAIGULZ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/0-387-25592-3\\_2) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Brass, Peter and Pach, J\\'anos , TITLE =. Graph theory and combinatorial optimization , SERIES =. 2005 , ISBN =. doi:10.1007/0-387-25592-3\\_2 , URL =","arxiv_id":"2606.27352","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Brass, Peter and Pach, J\\'anos , TITLE =. Graph theory and combinatorial optimization , SERIES =. 2005 , ISBN =. doi:10.1007/0-387-25592-3\\_2 , URL =","reconstructed_doi":"10.1007/0-387-25592-3\\_2"},"severity":"advisory","ref_index":4,"audited_at":"2026-07-09T14:34:44.187352Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/0-387-25592-3\\_2","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0a8adda57509972ecb2e42e1c881110a97dc5aafa4d993dc5f0bb07ef860436f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":9427,"payload_sha256":"43613f713060e91af86e1b37a11d6a2dcb0c69370e5a35650b20898f383d74c5","signature_b64":"qw8lHUHlSp5iU9iCADOBCP5eXI3FUKd5F6MDh7wF8vRzrcADbc+Ia1Q3QriokPq3oUUkuZiLri56PYozOE3NAQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-09T14:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELUmVdXpPPkLkbx/YOgM8iGWdXClEa0R+yLplNqwtvvsUKmhh59Nv7l8Cl+DNML/mVasjgJi1vry8EI8O+9CCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T22:43:02.389079Z"},"content_sha256":"77ea0777cd87bb25cfb3b35a77d450574dd0234ea1d049be31ff3663593b73f2","schema_version":"1.0","event_id":"sha256:77ea0777cd87bb25cfb3b35a77d450574dd0234ea1d049be31ff3663593b73f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/bundle.json","state_url":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4T54IGDON7RGXAY5I4HAIGULZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-25T22:43:02Z","links":{"resolver":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ","bundle":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/bundle.json","state":"https://pith.science/pith/X4T54IGDON7RGXAY5I4HAIGULZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4T54IGDON7RGXAY5I4HAIGULZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:X4T54IGDON7RGXAY5I4HAIGULZ","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d644badbf559c947ded291f4730eba64b54a1b5f6c42970e33291b863e9f84f6","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-25T17:56:01Z","title_canon_sha256":"3c9667267733b461cea0795808e7a545a57b2d693e49ed7e5ed395f43888bfcb"},"schema_version":"1.0","source":{"id":"2606.27352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.27352","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"2606.27352v1","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27352","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"X4T54IGDON7R","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"pith_short_16","alias_value":"X4T54IGDON7RGXAY","created_at":"2026-06-26T01:16:19Z"},{"alias_kind":"pith_short_8","alias_value":"X4T54IGD","created_at":"2026-06-26T01:16:19Z"}],"graph_snapshots":[{"event_id":"sha256:8ee02f28719e86e13e1280e5d65086b7de31b936b804a52046519bebf903fe4e","target":"graph","created_at":"2026-06-26T01:16:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.27352/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ritesh Goenka, Shubhrajit Bhattacharya","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-25T17:56:01Z","title":"Congruent copies of finite patterns in planar point sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27352","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23df6c74f1c904b9f144c9d05660471db4f58a7d8aa3d9817bc36ec1c5233ea5","target":"record","created_at":"2026-06-26T01:16:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d644badbf559c947ded291f4730eba64b54a1b5f6c42970e33291b863e9f84f6","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-25T17:56:01Z","title_canon_sha256":"3c9667267733b461cea0795808e7a545a57b2d693e49ed7e5ed395f43888bfcb"},"schema_version":"1.0","source":{"id":"2606.27352","kind":"arxiv","version":1}},"canonical_sha256":"bf27de20c3737f135c18ea387020d45e57cfa2c04436fba3b99d3c9ae0057829","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf27de20c3737f135c18ea387020d45e57cfa2c04436fba3b99d3c9ae0057829","first_computed_at":"2026-06-26T01:16:19.587864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:16:19.587864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"erBdbnAXWDffbRxcU4ypeaC2m7EL5XQaPJFAEWnf+V9W0DQhdx7LdaszfFE7JLxZ/n9p/z844cewrE7JpMzrCg==","signature_status":"signed_v1","signed_at":"2026-06-26T01:16:19.588365Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.27352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23df6c74f1c904b9f144c9d05660471db4f58a7d8aa3d9817bc36ec1c5233ea5","sha256:8ee02f28719e86e13e1280e5d65086b7de31b936b804a52046519bebf903fe4e","sha256:77ea0777cd87bb25cfb3b35a77d450574dd0234ea1d049be31ff3663593b73f2"],"state_sha256":"61aa0cd14386d0f70b4a1f36bcd95374728c969c81c013e7155bb5de115e8b9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"loFyzbzybXSkEJR2VIAvvk6jjUYmcHQwxQQXnh7ZX4DpoBonrlbV42POKUcVloxAVBvLGAiMpT13TFp58erlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T22:43:02.390418Z","bundle_sha256":"89e75c2d89a824057679164eac94994309e6923c17e46f2b5ab1dc617e255af0"}}