{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z5AUJN3FDJSWPLPDVU6BD55JU2","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":"11c0412c5ffb9921b44ace9f9c4ce366cd2d6f0502948fcfe1c2cfd0ad5db8db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-21T11:25:46Z","title_canon_sha256":"5127fcd52c682c6d84e40ee1d6691f9377e127709db7603733e5d2850f5b28a7"},"schema_version":"1.0","source":{"id":"1711.07723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07723","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07723v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07723","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"Z5AUJN3FDJSW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z5AUJN3FDJSWPLPD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z5AUJN3F","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:cae1338d2ac4ff1e053338392c848accf8e7feb153601ac95941b787bee8222b","target":"graph","created_at":"2026-05-18T00:29:56Z","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 graph $H$ is a simple graph with a linear order on its vertex set. The corresponding Tur\\'an problem, first studied by Pach and Tardos, asks for the maximum number $\\text{ex}_<(n,H)$ of edges in an ordered graph on $n$ vertices that does not contain $H$ as an ordered subgraph. It is known that $\\text{ex}_<(n,H) > n^{1+\\varepsilon}$ for some positive $\\varepsilon=\\varepsilon(H)$ unless $H$ is a forest that has a proper 2-coloring with one color class totally preceding the other one. Making progress towards a conjecture of Pach and Tardos, we prove that $\\text{ex}_<(n,H) =n^{1+o(1)}$ ","authors_text":"Craig Weidert, D\\'aniel Kor\\'andi, G\\'abor Tardos, Istv\\'an Tomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-21T11:25:46Z","title":"On the Tur\\'an number of ordered forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07723","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:8597caabc98dcfa791e911ed92a9c234a9577dbe17231421ccac36e858cb08ff","target":"record","created_at":"2026-05-18T00:29:56Z","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":"11c0412c5ffb9921b44ace9f9c4ce366cd2d6f0502948fcfe1c2cfd0ad5db8db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-21T11:25:46Z","title_canon_sha256":"5127fcd52c682c6d84e40ee1d6691f9377e127709db7603733e5d2850f5b28a7"},"schema_version":"1.0","source":{"id":"1711.07723","kind":"arxiv","version":1}},"canonical_sha256":"cf4144b7651a6567ade3ad3c11f7a9a686ad9ce028d1292bd46642034049b3ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf4144b7651a6567ade3ad3c11f7a9a686ad9ce028d1292bd46642034049b3ea","first_computed_at":"2026-05-18T00:29:56.642991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:56.642991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1yp90iNqQ7JD5Qfi2Zq+J7GuAVXy19rlGYO6Ppbpwe+YSiA/4pTR/qBuY4ZftAFuJiy6TbHUQ3MdeIFf2WVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:56.643592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8597caabc98dcfa791e911ed92a9c234a9577dbe17231421ccac36e858cb08ff","sha256:cae1338d2ac4ff1e053338392c848accf8e7feb153601ac95941b787bee8222b"],"state_sha256":"c92c3d7caaf97ce1a9f6b890b223f2b6fd6ca9846aa037fa4a2b5c256eb36c14"}