{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QFORT6VTAVXURACDE5KQB4KX5F","short_pith_number":"pith:QFORT6VT","schema_version":"1.0","canonical_sha256":"815d19fab3056f488043275500f157e96a0a695e58302d5d8628cade465fbefe","source":{"kind":"arxiv","id":"1608.04153","version":2},"attestation_state":"computed","paper":{"title":"1-color-avoiding paths, special tournaments, and incidence geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Yang, Jonathan Tidor, Victor Y. Wang","submitted_at":"2016-08-14T23:19:57Z","abstract_excerpt":"We discuss two approaches to a recent question of Loh: must a 3-colored transitive tournament on $N$ vertices have a 1-color-\\emph{avoiding} path of vertex-length at least $N^{2/3}$? This question generalizes the Erd\\H{o}s--Szekeres theorem on monotone subsequences.\n  First, we define three canonical transformations on these tournaments called Color, Record, and Dual. We use these to establish a reduction to special tournaments with natural geometric and combinatorial properties. In many cases (including all known tight examples), these tournaments have recursive Gallai decompositions. Not all"},"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":"1608.04153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-14T23:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"dd88a4ae37a9f5f4b91ebd9cd1da90af8b28689c1957bbc52688b632e86ecc3c","abstract_canon_sha256":"4d19d1f2df5087924696c1036e549986579ae8e55cdc537dafa0a60a0f67b03b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:02.287220Z","signature_b64":"rONm9GSewn63JmrfyqWXlcBHbtm0Ufj2WihFQc5CotSZI1VRVMO389XhLOLyL+Ec3SrsAwKV2rLQqXjXmSArDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"815d19fab3056f488043275500f157e96a0a695e58302d5d8628cade465fbefe","last_reissued_at":"2026-05-18T01:04:02.286529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:02.286529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-color-avoiding paths, special tournaments, and incidence geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Yang, Jonathan Tidor, Victor Y. Wang","submitted_at":"2016-08-14T23:19:57Z","abstract_excerpt":"We discuss two approaches to a recent question of Loh: must a 3-colored transitive tournament on $N$ vertices have a 1-color-\\emph{avoiding} path of vertex-length at least $N^{2/3}$? This question generalizes the Erd\\H{o}s--Szekeres theorem on monotone subsequences.\n  First, we define three canonical transformations on these tournaments called Color, Record, and Dual. We use these to establish a reduction to special tournaments with natural geometric and combinatorial properties. In many cases (including all known tight examples), these tournaments have recursive Gallai decompositions. Not all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04153","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.04153","created_at":"2026-05-18T01:04:02.286655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04153v2","created_at":"2026-05-18T01:04:02.286655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04153","created_at":"2026-05-18T01:04:02.286655+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFORT6VTAVXU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFORT6VTAVXURACD","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFORT6VT","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F","json":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F.json","graph_json":"https://pith.science/api/pith-number/QFORT6VTAVXURACDE5KQB4KX5F/graph.json","events_json":"https://pith.science/api/pith-number/QFORT6VTAVXURACDE5KQB4KX5F/events.json","paper":"https://pith.science/paper/QFORT6VT"},"agent_actions":{"view_html":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F","download_json":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F.json","view_paper":"https://pith.science/paper/QFORT6VT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04153&json=true","fetch_graph":"https://pith.science/api/pith-number/QFORT6VTAVXURACDE5KQB4KX5F/graph.json","fetch_events":"https://pith.science/api/pith-number/QFORT6VTAVXURACDE5KQB4KX5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F/action/storage_attestation","attest_author":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F/action/author_attestation","sign_citation":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F/action/citation_signature","submit_replication":"https://pith.science/pith/QFORT6VTAVXURACDE5KQB4KX5F/action/replication_record"}},"created_at":"2026-05-18T01:04:02.286655+00:00","updated_at":"2026-05-18T01:04:02.286655+00:00"}