{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4KB5PE6LCOYTGS6HF5BZR4W7CS","short_pith_number":"pith:4KB5PE6L","schema_version":"1.0","canonical_sha256":"e283d793cb13b1334bc72f4398f2df14a76f8086579f6e8389a3d372674806fc","source":{"kind":"arxiv","id":"1703.10424","version":2},"attestation_state":"computed","paper":{"title":"Monochromatic paths in random tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matija Buci\\'c, Shoham Letzter","submitted_at":"2017-03-30T11:50:19Z","abstract_excerpt":"We prove that, with high probability, any $2$-edge-colouring of a random tournament on $n$ vertices contains a monochromatic path of length $\\Omega(n / \\sqrt{\\log n})$. This resolves a conjecture of Ben-Eliezer, Krivelevich and Sudakov and implies a nearly tight upper bound on the oriented size Ramsey number of a directed path."},"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":"1703.10424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-30T11:50:19Z","cross_cats_sorted":[],"title_canon_sha256":"ce214dc009a8c11664e9b4c4bb0ae0a2539a321afc2abc04626373089d3dff27","abstract_canon_sha256":"29f96f65b124f42b15587c289cdf663b1f93db55102db2602ccbdd99db6305f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.291643Z","signature_b64":"4QECMB7ZsxcvrHoc4TkJFNCszeZ1nO/2HfFOY5owdEHunPN8TV+N75U4ONsy6tGADIS14azQyA9GNaF2S5VuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e283d793cb13b1334bc72f4398f2df14a76f8086579f6e8389a3d372674806fc","last_reissued_at":"2026-05-17T23:58:50.291132Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.291132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monochromatic paths in random tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Matija Buci\\'c, Shoham Letzter","submitted_at":"2017-03-30T11:50:19Z","abstract_excerpt":"We prove that, with high probability, any $2$-edge-colouring of a random tournament on $n$ vertices contains a monochromatic path of length $\\Omega(n / \\sqrt{\\log n})$. This resolves a conjecture of Ben-Eliezer, Krivelevich and Sudakov and implies a nearly tight upper bound on the oriented size Ramsey number of a directed path."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10424","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":"1703.10424","created_at":"2026-05-17T23:58:50.291205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10424v2","created_at":"2026-05-17T23:58:50.291205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10424","created_at":"2026-05-17T23:58:50.291205+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KB5PE6LCOYT","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KB5PE6LCOYTGS6H","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KB5PE6L","created_at":"2026-05-18T12:31:00.734936+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/4KB5PE6LCOYTGS6HF5BZR4W7CS","json":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS.json","graph_json":"https://pith.science/api/pith-number/4KB5PE6LCOYTGS6HF5BZR4W7CS/graph.json","events_json":"https://pith.science/api/pith-number/4KB5PE6LCOYTGS6HF5BZR4W7CS/events.json","paper":"https://pith.science/paper/4KB5PE6L"},"agent_actions":{"view_html":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS","download_json":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS.json","view_paper":"https://pith.science/paper/4KB5PE6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10424&json=true","fetch_graph":"https://pith.science/api/pith-number/4KB5PE6LCOYTGS6HF5BZR4W7CS/graph.json","fetch_events":"https://pith.science/api/pith-number/4KB5PE6LCOYTGS6HF5BZR4W7CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS/action/storage_attestation","attest_author":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS/action/author_attestation","sign_citation":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS/action/citation_signature","submit_replication":"https://pith.science/pith/4KB5PE6LCOYTGS6HF5BZR4W7CS/action/replication_record"}},"created_at":"2026-05-17T23:58:50.291205+00:00","updated_at":"2026-05-17T23:58:50.291205+00:00"}