{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T6XF3PT56PCBNDEF7KBWW7XRBX","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":"555279e91f9d68f0df8ab1c8929504e4d9b80bf9f4caa38c53729aa6c24323f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T21:57:21Z","title_canon_sha256":"55319eb6aa3e1f9486bc83496057f0645f610cd7e5b0a27f3cbb5a62e7eb6904"},"schema_version":"1.0","source":{"id":"1906.03342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03342","created_at":"2026-07-05T00:54:11Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03342v2","created_at":"2026-07-05T00:54:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03342","created_at":"2026-07-05T00:54:11Z"},{"alias_kind":"pith_short_12","alias_value":"T6XF3PT56PCB","created_at":"2026-07-05T00:54:11Z"},{"alias_kind":"pith_short_16","alias_value":"T6XF3PT56PCBNDEF","created_at":"2026-07-05T00:54:11Z"},{"alias_kind":"pith_short_8","alias_value":"T6XF3PT5","created_at":"2026-07-05T00:54:11Z"}],"graph_snapshots":[{"event_id":"sha256:baf5b792791dfb1433bd2f18b9667df4ae5a91cb8660733c0b48bbe22d97e944","target":"graph","created_at":"2026-07-05T00:54:11Z","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/1906.03342/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An {\\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\\leq k\\leq r$, an ordered $r$-graph $H$ is {\\em interval} $k$-{\\em partite} if there exist at least $k$ disjoint intervals in the ordering such that every edge of $H$ has nonempty intersection with each of the intervals and is contained in their union.\n  Our main result implies that for each $\\alpha > k - 1$ and $d>0$, every $n$-vertex ordered $r$-graph with $d \\,n^{\\alpha}$ edges has for some $m\\leq n$ an $m$-vertex interval $k$-partite subgraph with $\\Omega(d\\, m^{\\alpha})$ edges. This is an","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-07T21:57:21Z","title":"Partitioning ordered hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03342","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:733dd98bf3f55559cdc2d3026f6018943c88d310b66627fc2c9b76d5133042b4","target":"record","created_at":"2026-07-05T00:54:11Z","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":"555279e91f9d68f0df8ab1c8929504e4d9b80bf9f4caa38c53729aa6c24323f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T21:57:21Z","title_canon_sha256":"55319eb6aa3e1f9486bc83496057f0645f610cd7e5b0a27f3cbb5a62e7eb6904"},"schema_version":"1.0","source":{"id":"1906.03342","kind":"arxiv","version":2}},"canonical_sha256":"9fae5dbe7df3c4168c85fa836b7ef10ddc56c91d09e5b1ee1fb09bed1dc5d8d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fae5dbe7df3c4168c85fa836b7ef10ddc56c91d09e5b1ee1fb09bed1dc5d8d2","first_computed_at":"2026-07-05T00:54:11.993759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:11.993759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WngpRDfSP7WTh3hBe6t+TIJ/ELK6/DgnUbFvqbZOUYDAHq/VeMzqdzQ+J/0tXdG8zJuENTKmV3GFD/F8+hP6DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:11.994132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:733dd98bf3f55559cdc2d3026f6018943c88d310b66627fc2c9b76d5133042b4","sha256:baf5b792791dfb1433bd2f18b9667df4ae5a91cb8660733c0b48bbe22d97e944"],"state_sha256":"60bed2bd9b13141201ae02d91961b435dcdd44ff25b0b74f03d40492e33d7dc6"}