{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J3I57JXAZ6AMSR6S6ICJGYLWMK","short_pith_number":"pith:J3I57JXA","schema_version":"1.0","canonical_sha256":"4ed1dfa6e0cf80c947d2f2049361766282685c2dbcddbb119982e7d01bb48220","source":{"kind":"arxiv","id":"1907.00964","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'an theorems for unavoidable patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Bhargav Narayanan","submitted_at":"2019-07-01T17:57:28Z","abstract_excerpt":"We prove Tur\\'an-type theorems for two related Ramsey problems raised by Bollob\\'as and by Fox and Sudakov. First, for $t \\ge 3$, we show that any two-colouring of the complete graph on $n$ vertices that is $\\delta$-far from being monochromatic contains an \\emph{unavoidable $t$-colouring} when $\\delta \\gg n^{-1/t}$, where an unavoidable $t$-colouring is any two-colouring of a clique of order $2t$ in which one colour forms either a clique of order $t$ or two disjoint cliques of order $t$. Next, for $ t\\ge 3$, we show that any tournament on $n$ vertices that is $\\delta$-far from being transitive"},"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":"1907.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T17:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"5d63344ea97f4945a51dd3e2a49f21bf73193ec1cbc51d116a8fcd7f5c8b0c6e","abstract_canon_sha256":"beb2a796778f8c36d6d59e35ba3ce5c16d04b46ba3e2d5432ee8d37dd6d0aa9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:47.462979Z","signature_b64":"UWYU6hRtAsWbfiiibZZ0NCdbKSPhNTGpKNAwA2eGkk5kRQix9nS9P7gUBKSvMKr4PlneROI48fYCpsB4bZX4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed1dfa6e0cf80c947d2f2049361766282685c2dbcddbb119982e7d01bb48220","last_reissued_at":"2026-05-17T23:41:47.462285Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:47.462285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an theorems for unavoidable patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Bhargav Narayanan","submitted_at":"2019-07-01T17:57:28Z","abstract_excerpt":"We prove Tur\\'an-type theorems for two related Ramsey problems raised by Bollob\\'as and by Fox and Sudakov. First, for $t \\ge 3$, we show that any two-colouring of the complete graph on $n$ vertices that is $\\delta$-far from being monochromatic contains an \\emph{unavoidable $t$-colouring} when $\\delta \\gg n^{-1/t}$, where an unavoidable $t$-colouring is any two-colouring of a clique of order $2t$ in which one colour forms either a clique of order $t$ or two disjoint cliques of order $t$. Next, for $ t\\ge 3$, we show that any tournament on $n$ vertices that is $\\delta$-far from being transitive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00964","kind":"arxiv","version":1},"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":"1907.00964","created_at":"2026-05-17T23:41:47.462391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00964v1","created_at":"2026-05-17T23:41:47.462391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00964","created_at":"2026-05-17T23:41:47.462391+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3I57JXAZ6AM","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3I57JXAZ6AMSR6S","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3I57JXA","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2011.11119","citing_title":"The balancing number and list balancing number of some graph classes","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK","json":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK.json","graph_json":"https://pith.science/api/pith-number/J3I57JXAZ6AMSR6S6ICJGYLWMK/graph.json","events_json":"https://pith.science/api/pith-number/J3I57JXAZ6AMSR6S6ICJGYLWMK/events.json","paper":"https://pith.science/paper/J3I57JXA"},"agent_actions":{"view_html":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK","download_json":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK.json","view_paper":"https://pith.science/paper/J3I57JXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00964&json=true","fetch_graph":"https://pith.science/api/pith-number/J3I57JXAZ6AMSR6S6ICJGYLWMK/graph.json","fetch_events":"https://pith.science/api/pith-number/J3I57JXAZ6AMSR6S6ICJGYLWMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/action/storage_attestation","attest_author":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/action/author_attestation","sign_citation":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/action/citation_signature","submit_replication":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/action/replication_record"}},"created_at":"2026-05-17T23:41:47.462391+00:00","updated_at":"2026-05-17T23:41:47.462391+00:00"}