{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SH5UMCG7S7R6FH42ZNJ2DXMHIN","short_pith_number":"pith:SH5UMCG7","schema_version":"1.0","canonical_sha256":"91fb4608df97e3e29f9acb53a1dd87437c42f1f9b5da08a4b48e503daf3b3ccb","source":{"kind":"arxiv","id":"1309.3625","version":2},"attestation_state":"computed","paper":{"title":"A Lower Bound on the Crossing Number of Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Anshu, Saswata Shannigrahi","submitted_at":"2013-09-14T04:29:01Z","abstract_excerpt":"In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined to cross if they are vertex-disjoint and contains a common point in the relative interior of the simplices corresponding to them. As a corollary of the Van Kampen-Flores Theorem, it can be seen that such a hypergraph contains $\\Omega(\\frac{2^d}{\\sqrt{d}})$ $n\\choose 2d$ crossing pairs of hyperedges. Using Gale Transform and Ham Sandwich Theorem, we improve th"},"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":"1309.3625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-14T04:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"6318ac9a5666f57ad314a62036064f8384f6839b757d0fffdff26a12d515bd12","abstract_canon_sha256":"ffd3aa82efcb788ae0c24f8f32302a5b3fff92f8756b8d1072ea8632f2947c14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:38.265000Z","signature_b64":"FGYhiAthoVKXUxk1FBgWs35dDLmUCAZ0f2euULa8WRgaTdwRpehbxnZe4bEbEdNnnGuV4aztMhf7Z/Q3Uvb/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91fb4608df97e3e29f9acb53a1dd87437c42f1f9b5da08a4b48e503daf3b3ccb","last_reissued_at":"2026-05-18T01:21:38.264498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:38.264498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound on the Crossing Number of Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Anshu, Saswata Shannigrahi","submitted_at":"2013-09-14T04:29:01Z","abstract_excerpt":"In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined to cross if they are vertex-disjoint and contains a common point in the relative interior of the simplices corresponding to them. As a corollary of the Van Kampen-Flores Theorem, it can be seen that such a hypergraph contains $\\Omega(\\frac{2^d}{\\sqrt{d}})$ $n\\choose 2d$ crossing pairs of hyperedges. Using Gale Transform and Ham Sandwich Theorem, we improve th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3625","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":""},"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":"1309.3625","created_at":"2026-05-18T01:21:38.264577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3625v2","created_at":"2026-05-18T01:21:38.264577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3625","created_at":"2026-05-18T01:21:38.264577+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH5UMCG7S7R6","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH5UMCG7S7R6FH42","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH5UMCG7","created_at":"2026-05-18T12:27:59.945178+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/SH5UMCG7S7R6FH42ZNJ2DXMHIN","json":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN.json","graph_json":"https://pith.science/api/pith-number/SH5UMCG7S7R6FH42ZNJ2DXMHIN/graph.json","events_json":"https://pith.science/api/pith-number/SH5UMCG7S7R6FH42ZNJ2DXMHIN/events.json","paper":"https://pith.science/paper/SH5UMCG7"},"agent_actions":{"view_html":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN","download_json":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN.json","view_paper":"https://pith.science/paper/SH5UMCG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3625&json=true","fetch_graph":"https://pith.science/api/pith-number/SH5UMCG7S7R6FH42ZNJ2DXMHIN/graph.json","fetch_events":"https://pith.science/api/pith-number/SH5UMCG7S7R6FH42ZNJ2DXMHIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/action/storage_attestation","attest_author":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/action/author_attestation","sign_citation":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/action/citation_signature","submit_replication":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/action/replication_record"}},"created_at":"2026-05-18T01:21:38.264577+00:00","updated_at":"2026-05-18T01:21:38.264577+00:00"}