{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T6XF3PT56PCBNDEF7KBWW7XRBX","short_pith_number":"pith:T6XF3PT5","schema_version":"1.0","canonical_sha256":"9fae5dbe7df3c4168c85fa836b7ef10ddc56c91d09e5b1ee1fb09bed1dc5d8d2","source":{"kind":"arxiv","id":"1906.03342","version":2},"attestation_state":"computed","paper":{"title":"Partitioning 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-07T21:57:21Z","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"},"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":"1906.03342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-07T21:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"55319eb6aa3e1f9486bc83496057f0645f610cd7e5b0a27f3cbb5a62e7eb6904","abstract_canon_sha256":"555279e91f9d68f0df8ab1c8929504e4d9b80bf9f4caa38c53729aa6c24323f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:11.994132Z","signature_b64":"WngpRDfSP7WTh3hBe6t+TIJ/ELK6/DgnUbFvqbZOUYDAHq/VeMzqdzQ+J/0tXdG8zJuENTKmV3GFD/F8+hP6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fae5dbe7df3c4168c85fa836b7ef10ddc56c91d09e5b1ee1fb09bed1dc5d8d2","last_reissued_at":"2026-07-05T00:54:11.993759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:11.993759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning 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-07T21:57:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03342","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.03342/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.03342","created_at":"2026-07-05T00:54:11.993815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03342v2","created_at":"2026-07-05T00:54:11.993815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03342","created_at":"2026-07-05T00:54:11.993815+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6XF3PT56PCB","created_at":"2026-07-05T00:54:11.993815+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6XF3PT56PCBNDEF","created_at":"2026-07-05T00:54:11.993815+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6XF3PT5","created_at":"2026-07-05T00:54:11.993815+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03189","citing_title":"Bipartite Tur\\'an problems for ordered graphs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX","json":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX.json","graph_json":"https://pith.science/api/pith-number/T6XF3PT56PCBNDEF7KBWW7XRBX/graph.json","events_json":"https://pith.science/api/pith-number/T6XF3PT56PCBNDEF7KBWW7XRBX/events.json","paper":"https://pith.science/paper/T6XF3PT5"},"agent_actions":{"view_html":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX","download_json":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX.json","view_paper":"https://pith.science/paper/T6XF3PT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03342&json=true","fetch_graph":"https://pith.science/api/pith-number/T6XF3PT56PCBNDEF7KBWW7XRBX/graph.json","fetch_events":"https://pith.science/api/pith-number/T6XF3PT56PCBNDEF7KBWW7XRBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX/action/storage_attestation","attest_author":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX/action/author_attestation","sign_citation":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX/action/citation_signature","submit_replication":"https://pith.science/pith/T6XF3PT56PCBNDEF7KBWW7XRBX/action/replication_record"}},"created_at":"2026-07-05T00:54:11.993815+00:00","updated_at":"2026-07-05T00:54:11.993815+00:00"}