{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OZZYD76BKPIQKDTZCL6ACS3XGI","short_pith_number":"pith:OZZYD76B","canonical_record":{"source":{"id":"1807.05104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T14:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"af252495ad36a5bee822bb6f6e87237c61a7c92606e7358e49a0e114a02fd156","abstract_canon_sha256":"b2d0130ab0c1dafa09d155cf8eb02b2a9c4a2a6787c8b6f133553dc6a6a2ed67"},"schema_version":"1.0"},"canonical_sha256":"767381ffc153d1050e7912fc014b77321465333fcc7bdb7f4a9f40e107da3672","source":{"kind":"arxiv","id":"1807.05104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05104","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05104v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05104","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"OZZYD76BKPIQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZZYD76BKPIQKDTZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZZYD76B","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OZZYD76BKPIQKDTZCL6ACS3XGI","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T14:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"af252495ad36a5bee822bb6f6e87237c61a7c92606e7358e49a0e114a02fd156","abstract_canon_sha256":"b2d0130ab0c1dafa09d155cf8eb02b2a9c4a2a6787c8b6f133553dc6a6a2ed67"},"schema_version":"1.0"},"canonical_sha256":"767381ffc153d1050e7912fc014b77321465333fcc7bdb7f4a9f40e107da3672","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.116858Z","signature_b64":"8rCTQRwhHnFIi+JOV5Lh8Ys4BoZ2BJm+xLxoJ05K+k825/TgmTTbm+/G16L7Bs7w4QYQeufn630sPLanlXT6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"767381ffc153d1050e7912fc014b77321465333fcc7bdb7f4a9f40e107da3672","last_reissued_at":"2026-05-18T00:10:44.116309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.116309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05104","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8lQupJpG/82w7LI5TiZvyhpmMlfsYfQTHvgaEHrpbOc16FWr2EUqJksvWCm0eDB/l0KRYIPNouZvZDSwyqKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:32:08.568353Z"},"content_sha256":"c089b6109f5222d74b3b95e192e087537724b3dbac26c3dfa5d40cc854d1dba5","schema_version":"1.0","event_id":"sha256:c089b6109f5222d74b3b95e192e087537724b3dbac26c3dfa5d40cc854d1dba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OZZYD76BKPIQKDTZCL6ACS3XGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal problems on ordered and convex geometric hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Tao Jiang, Zolt\\'an F\\\"uredi","submitted_at":"2018-07-13T14:25:56Z","abstract_excerpt":"An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich history with applications to a variety of problems in combinatorial geometry. In this paper, we consider analogous extremal problems for uniform hypergraphs, and discover a general partitioning phenomenon which allows us to determine the order of magnitude of the extremal function for various ordered and convex geometric hypergraphs. A special case is the ordere"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05104","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGNJsL61FfxXDGwNPr1JnT9xitKfa93aKe3dctZk0n/CpC/ViZtJcU+l9e6KLuWI/fj1rWHcccR8FZmJPKquDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:32:08.568709Z"},"content_sha256":"6986feca4b7e33bf150443790e31f2b1693ab8286cbce01ef4b723edbb9aa7e0","schema_version":"1.0","event_id":"sha256:6986feca4b7e33bf150443790e31f2b1693ab8286cbce01ef4b723edbb9aa7e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZZYD76BKPIQKDTZCL6ACS3XGI/bundle.json","state_url":"https://pith.science/pith/OZZYD76BKPIQKDTZCL6ACS3XGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZZYD76BKPIQKDTZCL6ACS3XGI/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-06-01T00:32:08Z","links":{"resolver":"https://pith.science/pith/OZZYD76BKPIQKDTZCL6ACS3XGI","bundle":"https://pith.science/pith/OZZYD76BKPIQKDTZCL6ACS3XGI/bundle.json","state":"https://pith.science/pith/OZZYD76BKPIQKDTZCL6ACS3XGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZZYD76BKPIQKDTZCL6ACS3XGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OZZYD76BKPIQKDTZCL6ACS3XGI","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":"b2d0130ab0c1dafa09d155cf8eb02b2a9c4a2a6787c8b6f133553dc6a6a2ed67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T14:25:56Z","title_canon_sha256":"af252495ad36a5bee822bb6f6e87237c61a7c92606e7358e49a0e114a02fd156"},"schema_version":"1.0","source":{"id":"1807.05104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05104","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05104v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05104","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"OZZYD76BKPIQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZZYD76BKPIQKDTZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZZYD76B","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:6986feca4b7e33bf150443790e31f2b1693ab8286cbce01ef4b723edbb9aa7e0","target":"graph","created_at":"2026-05-18T00:10:44Z","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":"An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich history with applications to a variety of problems in combinatorial geometry. In this paper, we consider analogous extremal problems for uniform hypergraphs, and discover a general partitioning phenomenon which allows us to determine the order of magnitude of the extremal function for various ordered and convex geometric hypergraphs. A special case is the ordere","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Tao Jiang, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T14:25:56Z","title":"Extremal problems on ordered and convex geometric hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05104","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:c089b6109f5222d74b3b95e192e087537724b3dbac26c3dfa5d40cc854d1dba5","target":"record","created_at":"2026-05-18T00:10:44Z","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":"b2d0130ab0c1dafa09d155cf8eb02b2a9c4a2a6787c8b6f133553dc6a6a2ed67","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T14:25:56Z","title_canon_sha256":"af252495ad36a5bee822bb6f6e87237c61a7c92606e7358e49a0e114a02fd156"},"schema_version":"1.0","source":{"id":"1807.05104","kind":"arxiv","version":2}},"canonical_sha256":"767381ffc153d1050e7912fc014b77321465333fcc7bdb7f4a9f40e107da3672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767381ffc153d1050e7912fc014b77321465333fcc7bdb7f4a9f40e107da3672","first_computed_at":"2026-05-18T00:10:44.116309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.116309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8rCTQRwhHnFIi+JOV5Lh8Ys4BoZ2BJm+xLxoJ05K+k825/TgmTTbm+/G16L7Bs7w4QYQeufn630sPLanlXT6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.116858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c089b6109f5222d74b3b95e192e087537724b3dbac26c3dfa5d40cc854d1dba5","sha256:6986feca4b7e33bf150443790e31f2b1693ab8286cbce01ef4b723edbb9aa7e0"],"state_sha256":"f68744065b88b97a829f23720d66d88af7cbf3457999f2eaf9cf508351b4eda2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Oy6wiMHOD6D8hQd2BGaKWSsuzgLVYXclIt90aMGmzG2Ornj2yoAARAVZoi87NSTIerg3qBXpg8gCeiJmx/ZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:32:08.571482Z","bundle_sha256":"2906625e42915965198e2c68623ed46f76d7bfc3898d0b5d651a6f8d877882fb"}}