{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WWIQYGVYYL7AONGCUH3U74LEVY","short_pith_number":"pith:WWIQYGVY","canonical_record":{"source":{"id":"1908.04654","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T14:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"a8032b63c0b3983570ea511d194823abae0e033fb9ec14ebc3d2cf2c27f0db07","abstract_canon_sha256":"223d8d52f4a6f827ddee77dd1d9ab42f8ac50b05638a6671f0f2d4dbed537973"},"schema_version":"1.0"},"canonical_sha256":"b5910c1ab8c2fe0734c2a1f74ff164ae1393406b85025ba2a2172ec5e236346d","source":{"kind":"arxiv","id":"1908.04654","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04654","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04654v6","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04654","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"pith_short_12","alias_value":"WWIQYGVYYL7A","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"pith_short_16","alias_value":"WWIQYGVYYL7AONGC","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"pith_short_8","alias_value":"WWIQYGVY","created_at":"2026-07-05T06:52:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WWIQYGVYYL7AONGCUH3U74LEVY","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04654","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T14:18:24Z","cross_cats_sorted":[],"title_canon_sha256":"a8032b63c0b3983570ea511d194823abae0e033fb9ec14ebc3d2cf2c27f0db07","abstract_canon_sha256":"223d8d52f4a6f827ddee77dd1d9ab42f8ac50b05638a6671f0f2d4dbed537973"},"schema_version":"1.0"},"canonical_sha256":"b5910c1ab8c2fe0734c2a1f74ff164ae1393406b85025ba2a2172ec5e236346d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:17.884489Z","signature_b64":"FWFdpldqk6+Z5O/L4HmH5QtBGoi6kPGbiTyuLns3dRUZV6SxLsN3xvGLymEWA1V8GItWvIAqQ6r+kZdq5xZrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5910c1ab8c2fe0734c2a1f74ff164ae1393406b85025ba2a2172ec5e236346d","last_reissued_at":"2026-07-05T06:52:17.883922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:17.883922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04654","source_version":6,"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-07-05T06:52:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vPghmw9WGclE1kJrUCWBczHT+hgcSXTcw3yZFaXQ1D6APgaFNDIbrd9X4frN6zHNFVWxZg65g2bvZII1veUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:50:20.729310Z"},"content_sha256":"0ebd6341f70be0dcc7475b237e509419949036af94ffab5419bf389ff8ffd4f0","schema_version":"1.0","event_id":"sha256:0ebd6341f70be0dcc7475b237e509419949036af94ffab5419bf389ff8ffd4f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WWIQYGVYYL7AONGCUH3U74LEVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ayan, Rahul Gangopadhyay","submitted_at":"2019-08-13T14:18:24Z","abstract_excerpt":"We improve the lower bound on the $d$-dimensional rectilinear crossing number of the complete $d$-uniform hypergraph having $2d$ vertices to $\\Omega\\left(\\dfrac{(4\\sqrt{2}/3^{3/4})^d}{d}\\right)$ from $\\Omega(2^d \\sqrt{d})$. We also establish that the $3$-dimensional rectilinear crossing number of a complete $3$-uniform hypergraph having $n \\geq 9$ vertices is at least $\\dfrac{43}{42}\\dbinom{n}{6}$.\n  We prove that the maximum number of crossing pairs of hyperedges in a $4$-dimensional rectilinear drawing of the complete $4$-uniform hypergraph having $n$ vertices is $13\\dbinom{n}{8}$. We also p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04654","kind":"arxiv","version":6},"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/1908.04654/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"},"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-07-05T06:52:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWs086W9ZmvIvGknx8gbqbxSdF8x3PZXTwbIjl5v6ZKhNKEkLxaa6AEgBRfrYApBZRsbLj9C0j/mRure2NYlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:50:20.730367Z"},"content_sha256":"284d5f58447bab126813ade9b079a33edb9dc331780d2bad7e8b949d483c9fec","schema_version":"1.0","event_id":"sha256:284d5f58447bab126813ade9b079a33edb9dc331780d2bad7e8b949d483c9fec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWIQYGVYYL7AONGCUH3U74LEVY/bundle.json","state_url":"https://pith.science/pith/WWIQYGVYYL7AONGCUH3U74LEVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWIQYGVYYL7AONGCUH3U74LEVY/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-08-16T06:50:20Z","links":{"resolver":"https://pith.science/pith/WWIQYGVYYL7AONGCUH3U74LEVY","bundle":"https://pith.science/pith/WWIQYGVYYL7AONGCUH3U74LEVY/bundle.json","state":"https://pith.science/pith/WWIQYGVYYL7AONGCUH3U74LEVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWIQYGVYYL7AONGCUH3U74LEVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WWIQYGVYYL7AONGCUH3U74LEVY","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":"223d8d52f4a6f827ddee77dd1d9ab42f8ac50b05638a6671f0f2d4dbed537973","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T14:18:24Z","title_canon_sha256":"a8032b63c0b3983570ea511d194823abae0e033fb9ec14ebc3d2cf2c27f0db07"},"schema_version":"1.0","source":{"id":"1908.04654","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04654","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04654v6","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04654","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"pith_short_12","alias_value":"WWIQYGVYYL7A","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"pith_short_16","alias_value":"WWIQYGVYYL7AONGC","created_at":"2026-07-05T06:52:17Z"},{"alias_kind":"pith_short_8","alias_value":"WWIQYGVY","created_at":"2026-07-05T06:52:17Z"}],"graph_snapshots":[{"event_id":"sha256:284d5f58447bab126813ade9b079a33edb9dc331780d2bad7e8b949d483c9fec","target":"graph","created_at":"2026-07-05T06:52:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04654/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We improve the lower bound on the $d$-dimensional rectilinear crossing number of the complete $d$-uniform hypergraph having $2d$ vertices to $\\Omega\\left(\\dfrac{(4\\sqrt{2}/3^{3/4})^d}{d}\\right)$ from $\\Omega(2^d \\sqrt{d})$. We also establish that the $3$-dimensional rectilinear crossing number of a complete $3$-uniform hypergraph having $n \\geq 9$ vertices is at least $\\dfrac{43}{42}\\dbinom{n}{6}$.\n  We prove that the maximum number of crossing pairs of hyperedges in a $4$-dimensional rectilinear drawing of the complete $4$-uniform hypergraph having $n$ vertices is $13\\dbinom{n}{8}$. We also p","authors_text":"Ayan, Rahul Gangopadhyay","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T14:18:24Z","title":"Maximum Rectilinear Crossing Number of Uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04654","kind":"arxiv","version":6},"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:0ebd6341f70be0dcc7475b237e509419949036af94ffab5419bf389ff8ffd4f0","target":"record","created_at":"2026-07-05T06:52:17Z","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":"223d8d52f4a6f827ddee77dd1d9ab42f8ac50b05638a6671f0f2d4dbed537973","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-08-13T14:18:24Z","title_canon_sha256":"a8032b63c0b3983570ea511d194823abae0e033fb9ec14ebc3d2cf2c27f0db07"},"schema_version":"1.0","source":{"id":"1908.04654","kind":"arxiv","version":6}},"canonical_sha256":"b5910c1ab8c2fe0734c2a1f74ff164ae1393406b85025ba2a2172ec5e236346d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5910c1ab8c2fe0734c2a1f74ff164ae1393406b85025ba2a2172ec5e236346d","first_computed_at":"2026-07-05T06:52:17.883922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:17.883922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FWFdpldqk6+Z5O/L4HmH5QtBGoi6kPGbiTyuLns3dRUZV6SxLsN3xvGLymEWA1V8GItWvIAqQ6r+kZdq5xZrBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:17.884489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04654","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ebd6341f70be0dcc7475b237e509419949036af94ffab5419bf389ff8ffd4f0","sha256:284d5f58447bab126813ade9b079a33edb9dc331780d2bad7e8b949d483c9fec"],"state_sha256":"2d77f771173c8822aa7c3502de403b5c8765b760cd5a2e1270eeb8161ab08500"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ry1UZz1E/zDSUen5ulEwnF8S50YV3y6R6tVBjrbg1In7ZrygpIHmAG51kgqlVeKzPEGvOpGaSWcmVPXsgvnZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:50:20.737606Z","bundle_sha256":"c1f9515ef8bd66a989ad290020630144437f980a244212e77a00e5f772e2e2f4"}}