{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:K4R67WJ4DVQIFCMQQQGHQGMSPC","short_pith_number":"pith:K4R67WJ4","schema_version":"1.0","canonical_sha256":"5723efd93c1d60828990840c781992788db76b758b69dbeb5f20e863ebd2117b","source":{"kind":"arxiv","id":"2303.17186","version":2},"attestation_state":"computed","paper":{"title":"Structure of cell decompositions in Extremal Szemer\\'edi-Trotter examples","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nets Katz, Olivine Silier","submitted_at":"2023-03-30T06:49:14Z","abstract_excerpt":"The symmetric case of the Szemer\\'edi-Trotter theorem says that any configuration of $N$ lines and $N$ points in the plane has at most $O(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/3})$ parameters which sometimes (that is, for some choices of the parameters) produces a configuration of N point and N lines. (Otherwise, we say the recipe fails.) We show that any near-extremal example for Szemer\\'edi Trotter is densely related to a successful instance of the recipe. We obtain this result by getting structural information on cell decompositions for extremal Szemer\\'edi-Trott"},"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":"2303.17186","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-03-30T06:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"2c5e86b354fa77ee5ce6052c06af4faee9b75a5ceca62c009df201160b3d795c","abstract_canon_sha256":"24cec41eaa3e4aad6e06aeab43e2a8287330ace33e5216efd2b0fea6c9be1dec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:02.875730Z","signature_b64":"oVVMHgAIWie7s/2D1CEnSRmaa4Bc2kSOiyhegzTL4xaufl/rmi6j7V1mFSjqz8nY6sDOlKTmMNGqc4Q/IuVkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5723efd93c1d60828990840c781992788db76b758b69dbeb5f20e863ebd2117b","last_reissued_at":"2026-06-03T01:05:02.875224Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:02.875224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure of cell decompositions in Extremal Szemer\\'edi-Trotter examples","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nets Katz, Olivine Silier","submitted_at":"2023-03-30T06:49:14Z","abstract_excerpt":"The symmetric case of the Szemer\\'edi-Trotter theorem says that any configuration of $N$ lines and $N$ points in the plane has at most $O(N^{4/3})$ incidences. We describe a recipe involving just $O(N^{1/3})$ parameters which sometimes (that is, for some choices of the parameters) produces a configuration of N point and N lines. (Otherwise, we say the recipe fails.) We show that any near-extremal example for Szemer\\'edi Trotter is densely related to a successful instance of the recipe. We obtain this result by getting structural information on cell decompositions for extremal Szemer\\'edi-Trott"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.17186","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/2303.17186/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":"2303.17186","created_at":"2026-06-03T01:05:02.875281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.17186v2","created_at":"2026-06-03T01:05:02.875281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.17186","created_at":"2026-06-03T01:05:02.875281+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4R67WJ4DVQI","created_at":"2026-06-03T01:05:02.875281+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4R67WJ4DVQIFCMQ","created_at":"2026-06-03T01:05:02.875281+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4R67WJ4","created_at":"2026-06-03T01:05:02.875281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.26145","citing_title":"An incomplete attack on the upper bound of the unit distance problem","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC","json":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC.json","graph_json":"https://pith.science/api/pith-number/K4R67WJ4DVQIFCMQQQGHQGMSPC/graph.json","events_json":"https://pith.science/api/pith-number/K4R67WJ4DVQIFCMQQQGHQGMSPC/events.json","paper":"https://pith.science/paper/K4R67WJ4"},"agent_actions":{"view_html":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC","download_json":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC.json","view_paper":"https://pith.science/paper/K4R67WJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.17186&json=true","fetch_graph":"https://pith.science/api/pith-number/K4R67WJ4DVQIFCMQQQGHQGMSPC/graph.json","fetch_events":"https://pith.science/api/pith-number/K4R67WJ4DVQIFCMQQQGHQGMSPC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC/action/storage_attestation","attest_author":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC/action/author_attestation","sign_citation":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC/action/citation_signature","submit_replication":"https://pith.science/pith/K4R67WJ4DVQIFCMQQQGHQGMSPC/action/replication_record"}},"created_at":"2026-06-03T01:05:02.875281+00:00","updated_at":"2026-06-03T01:05:02.875281+00:00"}