{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J3I57JXAZ6AMSR6S6ICJGYLWMK","short_pith_number":"pith:J3I57JXA","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"},"canonical_sha256":"4ed1dfa6e0cf80c947d2f2049361766282685c2dbcddbb119982e7d01bb48220","source":{"kind":"arxiv","id":"1907.00964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00964","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00964v1","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00964","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"J3I57JXAZ6AM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J3I57JXAZ6AMSR6S","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J3I57JXA","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J3I57JXAZ6AMSR6S6ICJGYLWMK","target":"record","payload":{"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"},"canonical_sha256":"4ed1dfa6e0cf80c947d2f2049361766282685c2dbcddbb119982e7d01bb48220","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"},"source_kind":"arxiv","source_id":"1907.00964","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9u9MeR1DqljtYRp+YWSbNhSNZaltwrHizp3kpV56S7PfMUH/vYq/IEHKw6Z+ndguI6hUOwn1gpamyth8AvSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:04:12.740211Z"},"content_sha256":"de892df924b515677cef1ed5061b425238c3c5cc14f0402ba2866921e9de5087","schema_version":"1.0","event_id":"sha256:de892df924b515677cef1ed5061b425238c3c5cc14f0402ba2866921e9de5087"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J3I57JXAZ6AMSR6S6ICJGYLWMK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"smWvW0wcjOMyTdw0Lk1ovA2Jp9I/j14FjMoJis5xG5GOGXl3Zn6mvgVQBGBDiWD+vLGSVzNWdnJZY20yu/TCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:04:12.740916Z"},"content_sha256":"823c531019eb7f15f31b8f4726f03f7804b1d26a7628f6afe441cb89757c071b","schema_version":"1.0","event_id":"sha256:823c531019eb7f15f31b8f4726f03f7804b1d26a7628f6afe441cb89757c071b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/bundle.json","state_url":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T17:04:12Z","links":{"resolver":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK","bundle":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/bundle.json","state":"https://pith.science/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3I57JXAZ6AMSR6S6ICJGYLWMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J3I57JXAZ6AMSR6S6ICJGYLWMK","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":"beb2a796778f8c36d6d59e35ba3ce5c16d04b46ba3e2d5432ee8d37dd6d0aa9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T17:57:28Z","title_canon_sha256":"5d63344ea97f4945a51dd3e2a49f21bf73193ec1cbc51d116a8fcd7f5c8b0c6e"},"schema_version":"1.0","source":{"id":"1907.00964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.00964","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1907.00964v1","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00964","created_at":"2026-05-17T23:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"J3I57JXAZ6AM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J3I57JXAZ6AMSR6S","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J3I57JXA","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:823c531019eb7f15f31b8f4726f03f7804b1d26a7628f6afe441cb89757c071b","target":"graph","created_at":"2026-05-17T23:41:47Z","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":"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","authors_text":"Ant\\'onio Gir\\~ao, Bhargav Narayanan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T17:57:28Z","title":"Tur\\'an theorems for unavoidable patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00964","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:de892df924b515677cef1ed5061b425238c3c5cc14f0402ba2866921e9de5087","target":"record","created_at":"2026-05-17T23:41:47Z","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":"beb2a796778f8c36d6d59e35ba3ce5c16d04b46ba3e2d5432ee8d37dd6d0aa9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-01T17:57:28Z","title_canon_sha256":"5d63344ea97f4945a51dd3e2a49f21bf73193ec1cbc51d116a8fcd7f5c8b0c6e"},"schema_version":"1.0","source":{"id":"1907.00964","kind":"arxiv","version":1}},"canonical_sha256":"4ed1dfa6e0cf80c947d2f2049361766282685c2dbcddbb119982e7d01bb48220","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ed1dfa6e0cf80c947d2f2049361766282685c2dbcddbb119982e7d01bb48220","first_computed_at":"2026-05-17T23:41:47.462285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:47.462285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UWYU6hRtAsWbfiiibZZ0NCdbKSPhNTGpKNAwA2eGkk5kRQix9nS9P7gUBKSvMKr4PlneROI48fYCpsB4bZX4Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:47.462979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.00964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de892df924b515677cef1ed5061b425238c3c5cc14f0402ba2866921e9de5087","sha256:823c531019eb7f15f31b8f4726f03f7804b1d26a7628f6afe441cb89757c071b"],"state_sha256":"c58322df61db674762c63074ba6a515b2134db0e9fb4642a9388ad6f835e3196"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8OE4SBf/hXxdl2/gJDiXIAO85FYG74aFKi0mOehoFyVjFyrifNMuza4IQW70QYw6e4aCK0P3aLNqG2KeAS5Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:04:12.744859Z","bundle_sha256":"bc8f267d606ee0b0a63a1f0b7f521afd8b945c602f0d66e284e3019234d9d228"}}