{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FRFUS66GYYO2NDFVGYY375FIRB","short_pith_number":"pith:FRFUS66G","schema_version":"1.0","canonical_sha256":"2c4b497bc6c61da68cb53631bff4a8884708293472583195f3757cb2f92285d3","source":{"kind":"arxiv","id":"2112.10245","version":1},"attestation_state":"computed","paper":{"title":"On the Erd\\H{o}s-Purdy problem and the Zarankiewitz problem for semialgebraic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Nora Frankl","submitted_at":"2021-12-19T20:13:11Z","abstract_excerpt":"Erd\\H{o}s and Purdy, and later Agarwal and Sharir, conjectured that any set of $n$ points in $\\mathbb R^{d}$ determine at most $Cn^{d/2}$ congruent $k$-simplices for even $d$. We obtain the first significant progress towards this conjecture, showing that this number is at most $C n^{3d/4}$ for $k<d$. As a consequence, we obtain an upper bound of $C n^{3d/4+2}$ for the number of similar $k$-simplices determined by $n$ points in $\\mathbb R^d$, which improves the results of Agarwal, Apfelbaum, Purdy and Sharir. This problem is motivated by the problem of exact pattern matching.\n  We also address "},"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":"2112.10245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-19T20:13:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"22f156ef5509d74b7f0e6d3052f416e0f900b3bd0f39e9320a910098f4da28fa","abstract_canon_sha256":"9581422feb8e59673f94ac160ba401628f06d00d535351672bc234fc60e6b415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:42:12.868474Z","signature_b64":"D0Fbg4VFhYl1teyNQime8Lv3lukKjG+wixsOmCnhrP1AqdHOoIS98z93J8exiaUdqtBfoc4YRop+rxqQPxw+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c4b497bc6c61da68cb53631bff4a8884708293472583195f3757cb2f92285d3","last_reissued_at":"2026-07-05T03:42:12.868037Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:42:12.868037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Erd\\H{o}s-Purdy problem and the Zarankiewitz problem for semialgebraic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Nora Frankl","submitted_at":"2021-12-19T20:13:11Z","abstract_excerpt":"Erd\\H{o}s and Purdy, and later Agarwal and Sharir, conjectured that any set of $n$ points in $\\mathbb R^{d}$ determine at most $Cn^{d/2}$ congruent $k$-simplices for even $d$. We obtain the first significant progress towards this conjecture, showing that this number is at most $C n^{3d/4}$ for $k<d$. As a consequence, we obtain an upper bound of $C n^{3d/4+2}$ for the number of similar $k$-simplices determined by $n$ points in $\\mathbb R^d$, which improves the results of Agarwal, Apfelbaum, Purdy and Sharir. This problem is motivated by the problem of exact pattern matching.\n  We also address "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10245","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/2112.10245/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":"2112.10245","created_at":"2026-07-05T03:42:12.868093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.10245v1","created_at":"2026-07-05T03:42:12.868093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10245","created_at":"2026-07-05T03:42:12.868093+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRFUS66GYYO2","created_at":"2026-07-05T03:42:12.868093+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRFUS66GYYO2NDFV","created_at":"2026-07-05T03:42:12.868093+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRFUS66G","created_at":"2026-07-05T03:42:12.868093+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06490","citing_title":"On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB","json":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB.json","graph_json":"https://pith.science/api/pith-number/FRFUS66GYYO2NDFVGYY375FIRB/graph.json","events_json":"https://pith.science/api/pith-number/FRFUS66GYYO2NDFVGYY375FIRB/events.json","paper":"https://pith.science/paper/FRFUS66G"},"agent_actions":{"view_html":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB","download_json":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB.json","view_paper":"https://pith.science/paper/FRFUS66G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.10245&json=true","fetch_graph":"https://pith.science/api/pith-number/FRFUS66GYYO2NDFVGYY375FIRB/graph.json","fetch_events":"https://pith.science/api/pith-number/FRFUS66GYYO2NDFVGYY375FIRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB/action/storage_attestation","attest_author":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB/action/author_attestation","sign_citation":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB/action/citation_signature","submit_replication":"https://pith.science/pith/FRFUS66GYYO2NDFVGYY375FIRB/action/replication_record"}},"created_at":"2026-07-05T03:42:12.868093+00:00","updated_at":"2026-07-05T03:42:12.868093+00:00"}