{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LB7OA4HIAUS72REE6PZRHY6PUT","short_pith_number":"pith:LB7OA4HI","canonical_record":{"source":{"id":"1906.04575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-08T15:55:44Z","cross_cats_sorted":[],"title_canon_sha256":"e672f47fdc65b9da0eecf5e41d7c4433bb2e1f7962d94da223aa482981c1e40a","abstract_canon_sha256":"2364eac8ba74d4a00617f59f3d8625564a9e5460604c126c80c5f857aae1c5af"},"schema_version":"1.0"},"canonical_sha256":"587ee070e80525fd4484f3f313e3cfa4c709bc177a53fda7bf251f8dbc9cdf1f","source":{"kind":"arxiv","id":"1906.04575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04575","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04575v1","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04575","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"LB7OA4HIAUS7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LB7OA4HIAUS72REE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LB7OA4HI","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LB7OA4HIAUS72REE6PZRHY6PUT","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-08T15:55:44Z","cross_cats_sorted":[],"title_canon_sha256":"e672f47fdc65b9da0eecf5e41d7c4433bb2e1f7962d94da223aa482981c1e40a","abstract_canon_sha256":"2364eac8ba74d4a00617f59f3d8625564a9e5460604c126c80c5f857aae1c5af"},"schema_version":"1.0"},"canonical_sha256":"587ee070e80525fd4484f3f313e3cfa4c709bc177a53fda7bf251f8dbc9cdf1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:38.861385Z","signature_b64":"+O4WrwoPbnONkHUoIeaB3tRyTrnFMpgAE9kNYK0Tb3/564IH4MChrEqTs5zvAELmzmG4SPCElgUncK6sjEKZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"587ee070e80525fd4484f3f313e3cfa4c709bc177a53fda7bf251f8dbc9cdf1f","last_reissued_at":"2026-05-17T23:43:38.860643Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:38.860643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04575","source_version":1,"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-17T23:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7HyY4K7xfnF4ZMOkKGcMG5NxwUVKf+8g9ChZQHisCXTNFyDLXdUrMmF2ZYIZm51l3lbOWkJGhGcNHHnjPw6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:24:21.547141Z"},"content_sha256":"a15ee5296ee50cb21d17d7db95a0e3e8801ca233a83b1bebed4ec7f398d63b6f","schema_version":"1.0","event_id":"sha256:a15ee5296ee50cb21d17d7db95a0e3e8801ca233a83b1bebed4ec7f398d63b6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LB7OA4HIAUS72REE6PZRHY6PUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal problems for convex geometric hypergraphs and ordered 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":"2019-06-08T15:55:44Z","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 determine the order of magnitude of the extremal function for various ordered and convex geometric paths and matchings. Our results generalize earlier works of Bra{\\ss}-K\\'{a}rolyi-Valtr, Capoyleas-Pach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04575","kind":"arxiv","version":1},"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-17T23:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzhlEr/YhdhwOsD+dNB7FNZiVEb6CYEUqbQifBSCw3w4NKH9T4e9BMaKTGcMiLErCd2iKJa3cjZqvFdeqUwKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:24:21.547507Z"},"content_sha256":"01520d18af2ec616a45e8aef54f248b6a2f858b1db738259ba17689bfe92c816","schema_version":"1.0","event_id":"sha256:01520d18af2ec616a45e8aef54f248b6a2f858b1db738259ba17689bfe92c816"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LB7OA4HIAUS72REE6PZRHY6PUT/bundle.json","state_url":"https://pith.science/pith/LB7OA4HIAUS72REE6PZRHY6PUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LB7OA4HIAUS72REE6PZRHY6PUT/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-01T09:24:21Z","links":{"resolver":"https://pith.science/pith/LB7OA4HIAUS72REE6PZRHY6PUT","bundle":"https://pith.science/pith/LB7OA4HIAUS72REE6PZRHY6PUT/bundle.json","state":"https://pith.science/pith/LB7OA4HIAUS72REE6PZRHY6PUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LB7OA4HIAUS72REE6PZRHY6PUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LB7OA4HIAUS72REE6PZRHY6PUT","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":"2364eac8ba74d4a00617f59f3d8625564a9e5460604c126c80c5f857aae1c5af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-08T15:55:44Z","title_canon_sha256":"e672f47fdc65b9da0eecf5e41d7c4433bb2e1f7962d94da223aa482981c1e40a"},"schema_version":"1.0","source":{"id":"1906.04575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04575","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04575v1","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04575","created_at":"2026-05-17T23:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"LB7OA4HIAUS7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LB7OA4HIAUS72REE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LB7OA4HI","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:01520d18af2ec616a45e8aef54f248b6a2f858b1db738259ba17689bfe92c816","target":"graph","created_at":"2026-05-17T23:43: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":"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 determine the order of magnitude of the extremal function for various ordered and convex geometric paths and matchings. Our results generalize earlier works of Bra{\\ss}-K\\'{a}rolyi-Valtr, Capoyleas-Pach","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":"2019-06-08T15:55:44Z","title":"Extremal problems for convex geometric hypergraphs and ordered hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04575","kind":"arxiv","version":1},"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:a15ee5296ee50cb21d17d7db95a0e3e8801ca233a83b1bebed4ec7f398d63b6f","target":"record","created_at":"2026-05-17T23:43: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":"2364eac8ba74d4a00617f59f3d8625564a9e5460604c126c80c5f857aae1c5af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-08T15:55:44Z","title_canon_sha256":"e672f47fdc65b9da0eecf5e41d7c4433bb2e1f7962d94da223aa482981c1e40a"},"schema_version":"1.0","source":{"id":"1906.04575","kind":"arxiv","version":1}},"canonical_sha256":"587ee070e80525fd4484f3f313e3cfa4c709bc177a53fda7bf251f8dbc9cdf1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"587ee070e80525fd4484f3f313e3cfa4c709bc177a53fda7bf251f8dbc9cdf1f","first_computed_at":"2026-05-17T23:43:38.860643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:38.860643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+O4WrwoPbnONkHUoIeaB3tRyTrnFMpgAE9kNYK0Tb3/564IH4MChrEqTs5zvAELmzmG4SPCElgUncK6sjEKZAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:38.861385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a15ee5296ee50cb21d17d7db95a0e3e8801ca233a83b1bebed4ec7f398d63b6f","sha256:01520d18af2ec616a45e8aef54f248b6a2f858b1db738259ba17689bfe92c816"],"state_sha256":"422f44917bc1fe9579d1c41d6d4d48d2f01244df42d6fd07362033d2ad87ccc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei4ZNWzj9ErbNS8zmr+73T0JyOsfGSMBYMKX+O8NPZfh6TDcL8GDT+9g/Fm1E5NUDIpqpRgXBiVNsSayRgVABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:24:21.549448Z","bundle_sha256":"f4c548ee579261d53cde28fb0536412592ea7d748a7c2fec2ca46b4c41512d75"}}