{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SH5UMCG7S7R6FH42ZNJ2DXMHIN","short_pith_number":"pith:SH5UMCG7","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"},"canonical_sha256":"91fb4608df97e3e29f9acb53a1dd87437c42f1f9b5da08a4b48e503daf3b3ccb","source":{"kind":"arxiv","id":"1309.3625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3625","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3625v2","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3625","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"SH5UMCG7S7R6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SH5UMCG7S7R6FH42","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SH5UMCG7","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SH5UMCG7S7R6FH42ZNJ2DXMHIN","target":"record","payload":{"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"},"canonical_sha256":"91fb4608df97e3e29f9acb53a1dd87437c42f1f9b5da08a4b48e503daf3b3ccb","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"},"source_kind":"arxiv","source_id":"1309.3625","source_version":2,"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-05-18T01:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2UW+LBVyUW4y0HSgq5vj0a7ftZKDfCwHCNZJuxkYmxQKphpo6IRgFUIMFMkRbGiCO2uvU+/v49+mBUznWEbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:31:07.050453Z"},"content_sha256":"c6f581b494a14f08675b2e8cfbde72eea01b8c09e268ab9773cd07ce1a377830","schema_version":"1.0","event_id":"sha256:c6f581b494a14f08675b2e8cfbde72eea01b8c09e268ab9773cd07ce1a377830"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SH5UMCG7S7R6FH42ZNJ2DXMHIN","target":"graph","payload":{"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"},"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-05-18T01:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkUuc8oIhJQrLdWDAQjdkm52qYGtnasSrQ3jpAMoZzWF2nCN/3WsWKnejWja4jFkG2P4HQ9Ecahw7/Q3nLYDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:31:07.051297Z"},"content_sha256":"88bdbe810c3837e830649d18c180a2738347f6aee2c5a27d28d5ca574c3a9703","schema_version":"1.0","event_id":"sha256:88bdbe810c3837e830649d18c180a2738347f6aee2c5a27d28d5ca574c3a9703"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/bundle.json","state_url":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/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-05-30T22:31:07Z","links":{"resolver":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN","bundle":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/bundle.json","state":"https://pith.science/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SH5UMCG7S7R6FH42ZNJ2DXMHIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SH5UMCG7S7R6FH42ZNJ2DXMHIN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ffd3aa82efcb788ae0c24f8f32302a5b3fff92f8756b8d1072ea8632f2947c14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-14T04:29:01Z","title_canon_sha256":"6318ac9a5666f57ad314a62036064f8384f6839b757d0fffdff26a12d515bd12"},"schema_version":"1.0","source":{"id":"1309.3625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3625","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3625v2","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3625","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"SH5UMCG7S7R6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SH5UMCG7S7R6FH42","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SH5UMCG7","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:88bdbe810c3837e830649d18c180a2738347f6aee2c5a27d28d5ca574c3a9703","target":"graph","created_at":"2026-05-18T01:21:38Z","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"},"paper":{"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","authors_text":"Anurag Anshu, Saswata Shannigrahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-14T04:29:01Z","title":"A Lower Bound on the Crossing Number of Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3625","kind":"arxiv","version":2},"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:c6f581b494a14f08675b2e8cfbde72eea01b8c09e268ab9773cd07ce1a377830","target":"record","created_at":"2026-05-18T01:21:38Z","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":"ffd3aa82efcb788ae0c24f8f32302a5b3fff92f8756b8d1072ea8632f2947c14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-14T04:29:01Z","title_canon_sha256":"6318ac9a5666f57ad314a62036064f8384f6839b757d0fffdff26a12d515bd12"},"schema_version":"1.0","source":{"id":"1309.3625","kind":"arxiv","version":2}},"canonical_sha256":"91fb4608df97e3e29f9acb53a1dd87437c42f1f9b5da08a4b48e503daf3b3ccb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91fb4608df97e3e29f9acb53a1dd87437c42f1f9b5da08a4b48e503daf3b3ccb","first_computed_at":"2026-05-18T01:21:38.264498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:38.264498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FGYhiAthoVKXUxk1FBgWs35dDLmUCAZ0f2euULa8WRgaTdwRpehbxnZe4bEbEdNnnGuV4aztMhf7Z/Q3Uvb/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:38.265000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6f581b494a14f08675b2e8cfbde72eea01b8c09e268ab9773cd07ce1a377830","sha256:88bdbe810c3837e830649d18c180a2738347f6aee2c5a27d28d5ca574c3a9703"],"state_sha256":"6a94960942727e4a48edf83bfd63f57e21201738192bb2e3ec00542b9042f442"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXX8Bu2vUwUK5GS4RboiA5b96Kv8gMtYnyEepC90Csy2UUdDF7ux6T7o2qlTN5x/ngIQHpWffV8Xjuin0tvpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:31:07.056339Z","bundle_sha256":"7368554c56bf7295c3c509b8897ea2a077a961452cc92bf9c65c5f5b6eb3e704"}}