{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KKRXHNNEKHRUMWERLEAD6HMPAC","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":"5a011cc6d88dfb5f06a5fca7b96f6e005fccf29906a6e659f4b263c911e6590f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-04T08:08:24Z","title_canon_sha256":"c3a6a6e82d46a7a5170901f3fbd665d5aaa1e5803bd9c5d17ad304d7545e2a3a"},"schema_version":"1.0","source":{"id":"1512.01335","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01335","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01335v3","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01335","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"KKRXHNNEKHRU","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKRXHNNEKHRUMWER","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKRXHNNE","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:aca27f7ed9eb256afd9cb39c680b8ebab91520a15229f363453f4aee0d38475b","target":"graph","created_at":"2026-05-17T23:56:56Z","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 a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedges in the $d$-dimensional rectilinear drawing of a $d$-uniform hypergraph is known as the $d$-dimensional rectilinear crossing number of the hypergraph. The currently best-known lower bound on the $d$-dimensional rectilinear crossing number of a complete $d$-uniform hypergraph with $n$ vertices in general position in $\\mathbb{R}^d$ is $\\Omega(\\frac{2^d}{\\sqrt{d}} \\log d) {n \\choose 2d}$. In this paper, we improve this","authors_text":"Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, Satyanarayana Vusirikala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-04T08:08:24Z","title":"On the Rectilinear Crossing Number of Complete Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01335","kind":"arxiv","version":3},"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:3046c32202a62e36d41c9ee442eeed3c584b703477a79ce602b880842fa62748","target":"record","created_at":"2026-05-17T23:56:56Z","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":"5a011cc6d88dfb5f06a5fca7b96f6e005fccf29906a6e659f4b263c911e6590f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-04T08:08:24Z","title_canon_sha256":"c3a6a6e82d46a7a5170901f3fbd665d5aaa1e5803bd9c5d17ad304d7545e2a3a"},"schema_version":"1.0","source":{"id":"1512.01335","kind":"arxiv","version":3}},"canonical_sha256":"52a373b5a451e346589159003f1d8f00959b7105ec0c3be74bad4750320e574c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52a373b5a451e346589159003f1d8f00959b7105ec0c3be74bad4750320e574c","first_computed_at":"2026-05-17T23:56:56.290696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:56.290696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKNukYszO+V3ruOCKUgUPFL45o4rkqx3rP4qeibuUz0mRfDJuH+ueAaOKDeHjnJuKW17Ho3HmS5CapVePIV7Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:56.291270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01335","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3046c32202a62e36d41c9ee442eeed3c584b703477a79ce602b880842fa62748","sha256:aca27f7ed9eb256afd9cb39c680b8ebab91520a15229f363453f4aee0d38475b"],"state_sha256":"2924964e7522a9abc13fd73cd73c24c52b6b6ebe4f9d4e26244c3e4106f5cd5a"}