{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QOQGQPKNA2QVB2JR5YCTDL533C","short_pith_number":"pith:QOQGQPKN","schema_version":"1.0","canonical_sha256":"83a0683d4d06a150e931ee0531afbbd8ae5b142b73cf2d7d2b62f73da16d23b6","source":{"kind":"arxiv","id":"2412.06490","version":2},"attestation_state":"computed","paper":{"title":"On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky, Timothy M. Chan","submitted_at":"2024-12-09T13:46:43Z","abstract_excerpt":"The hypergraph Zarankiewicz's problem, introduced by Erd\\H{o}s in 1964, asks for the maximum number of hyperedges in an $r$-partite hypergraph with $n$ vertices in each part that does not contain a copy of $K_{t,t,\\ldots,t}$. Erd\\H{o}s obtained a near optimal bound of $O(n^{r-1/t^{r-1}})$ for general hypergraphs. In recent years, several works obtained improved bounds under various algebraic assumptions -- e.g., if the hypergraph is semialgebraic.\n  In this paper we study the problem in a geometric setting -- for $r$-partite intersection hypergraphs of families of geometric objects. Our main r"},"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":"2412.06490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-09T13:46:43Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"96c56d82d2c04ac708658a47208f3af569736219dd6c48a65904949df2f5728b","abstract_canon_sha256":"a677d3f3cc6531098765802d5697544d41421a9f5d12edf588283b9d1794c18f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:11.890380Z","signature_b64":"9wNtzZ9P0Lnihf9yiUDy25u1t443IEorsaOGi0cL5pQsM4BoRzZ8Jn0F4E0yr2q3csZ+b2x/lh4YATjdzWncBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a0683d4d06a150e931ee0531afbbd8ae5b142b73cf2d7d2b62f73da16d23b6","last_reissued_at":"2026-07-05T12:09:11.889926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:11.889926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky, Timothy M. Chan","submitted_at":"2024-12-09T13:46:43Z","abstract_excerpt":"The hypergraph Zarankiewicz's problem, introduced by Erd\\H{o}s in 1964, asks for the maximum number of hyperedges in an $r$-partite hypergraph with $n$ vertices in each part that does not contain a copy of $K_{t,t,\\ldots,t}$. Erd\\H{o}s obtained a near optimal bound of $O(n^{r-1/t^{r-1}})$ for general hypergraphs. In recent years, several works obtained improved bounds under various algebraic assumptions -- e.g., if the hypergraph is semialgebraic.\n  In this paper we study the problem in a geometric setting -- for $r$-partite intersection hypergraphs of families of geometric objects. Our main r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06490","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/2412.06490/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":"2412.06490","created_at":"2026-07-05T12:09:11.889978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06490v2","created_at":"2026-07-05T12:09:11.889978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06490","created_at":"2026-07-05T12:09:11.889978+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOQGQPKNA2QV","created_at":"2026-07-05T12:09:11.889978+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOQGQPKNA2QVB2JR","created_at":"2026-07-05T12:09:11.889978+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOQGQPKN","created_at":"2026-07-05T12:09:11.889978+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20815","citing_title":"A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C","json":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C.json","graph_json":"https://pith.science/api/pith-number/QOQGQPKNA2QVB2JR5YCTDL533C/graph.json","events_json":"https://pith.science/api/pith-number/QOQGQPKNA2QVB2JR5YCTDL533C/events.json","paper":"https://pith.science/paper/QOQGQPKN"},"agent_actions":{"view_html":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C","download_json":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C.json","view_paper":"https://pith.science/paper/QOQGQPKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06490&json=true","fetch_graph":"https://pith.science/api/pith-number/QOQGQPKNA2QVB2JR5YCTDL533C/graph.json","fetch_events":"https://pith.science/api/pith-number/QOQGQPKNA2QVB2JR5YCTDL533C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C/action/storage_attestation","attest_author":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C/action/author_attestation","sign_citation":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C/action/citation_signature","submit_replication":"https://pith.science/pith/QOQGQPKNA2QVB2JR5YCTDL533C/action/replication_record"}},"created_at":"2026-07-05T12:09:11.889978+00:00","updated_at":"2026-07-05T12:09:11.889978+00:00"}