{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KKRXHNNEKHRUMWERLEAD6HMPAC","short_pith_number":"pith:KKRXHNNE","schema_version":"1.0","canonical_sha256":"52a373b5a451e346589159003f1d8f00959b7105ec0c3be74bad4750320e574c","source":{"kind":"arxiv","id":"1512.01335","version":3},"attestation_state":"computed","paper":{"title":"On the Rectilinear Crossing Number of Complete Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, Satyanarayana Vusirikala","submitted_at":"2015-12-04T08:08:24Z","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"},"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":"1512.01335","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-04T08:08:24Z","cross_cats_sorted":[],"title_canon_sha256":"c3a6a6e82d46a7a5170901f3fbd665d5aaa1e5803bd9c5d17ad304d7545e2a3a","abstract_canon_sha256":"5a011cc6d88dfb5f06a5fca7b96f6e005fccf29906a6e659f4b263c911e6590f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:56.291270Z","signature_b64":"SKNukYszO+V3ruOCKUgUPFL45o4rkqx3rP4qeibuUz0mRfDJuH+ueAaOKDeHjnJuKW17Ho3HmS5CapVePIV7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52a373b5a451e346589159003f1d8f00959b7105ec0c3be74bad4750320e574c","last_reissued_at":"2026-05-17T23:56:56.290696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:56.290696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Rectilinear Crossing Number of Complete Uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Anshu, Rahul Gangopadhyay, Saswata Shannigrahi, Satyanarayana Vusirikala","submitted_at":"2015-12-04T08:08:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01335","kind":"arxiv","version":3},"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":"1512.01335","created_at":"2026-05-17T23:56:56.290777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01335v3","created_at":"2026-05-17T23:56:56.290777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01335","created_at":"2026-05-17T23:56:56.290777+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKRXHNNEKHRU","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKRXHNNEKHRUMWER","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKRXHNNE","created_at":"2026-05-18T12:29:29.992203+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/KKRXHNNEKHRUMWERLEAD6HMPAC","json":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC.json","graph_json":"https://pith.science/api/pith-number/KKRXHNNEKHRUMWERLEAD6HMPAC/graph.json","events_json":"https://pith.science/api/pith-number/KKRXHNNEKHRUMWERLEAD6HMPAC/events.json","paper":"https://pith.science/paper/KKRXHNNE"},"agent_actions":{"view_html":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC","download_json":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC.json","view_paper":"https://pith.science/paper/KKRXHNNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01335&json=true","fetch_graph":"https://pith.science/api/pith-number/KKRXHNNEKHRUMWERLEAD6HMPAC/graph.json","fetch_events":"https://pith.science/api/pith-number/KKRXHNNEKHRUMWERLEAD6HMPAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC/action/storage_attestation","attest_author":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC/action/author_attestation","sign_citation":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC/action/citation_signature","submit_replication":"https://pith.science/pith/KKRXHNNEKHRUMWERLEAD6HMPAC/action/replication_record"}},"created_at":"2026-05-17T23:56:56.290777+00:00","updated_at":"2026-05-17T23:56:56.290777+00:00"}