{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OPCTLYTSE6U3POVTHFBWGORZEK","short_pith_number":"pith:OPCTLYTS","schema_version":"1.0","canonical_sha256":"73c535e27227a9b7bab33943633a392296bdcb57709d295c01d1a31fb1d48e90","source":{"kind":"arxiv","id":"1605.09141","version":1},"attestation_state":"computed","paper":{"title":"On edges not in monochromatic copies of a fixed bipartite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma","submitted_at":"2016-05-30T08:57:10Z","abstract_excerpt":"Let $H$ be a fixed graph. Denote $f(n,H)$ to be the maximum number of edges not contained in any monochromatic copy of $H$ in a 2-edge-coloring of the complete graph $K_n$, and $ex(n,H)$ to be the {\\it Tur\\'an number} of $H$. An easy lower bound shows $f(n,H)\\ge ex(n,H)$ for any $H$ and $n$. In \\cite{KS2}, Keevash and Sudakov proved that if $H$ is an edge-color-critical graph or $C_4$, then $f(n,H)= ex(n,H)$ holds for large $n$, and they asked if this equality holds for any graph $H$ when $n$ is sufficiently large. In this paper, we provide an affirmative answer to this problem for an abundant"},"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":"1605.09141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-30T08:57:10Z","cross_cats_sorted":[],"title_canon_sha256":"6b264a08f01041014f7454e21f854b35fe098c421a6ccf9ff216b6e0ffa26cbb","abstract_canon_sha256":"318547aea736f4243daa13278d9e7240b5fd58adf19e1143865abaff77d91ddf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:21.953704Z","signature_b64":"l2U6Tg0C84kvD0rVemnBapGwrm/vluu3v7HF8bspVMkKuHoD/LNogsJNlMfZTWVLqKyDrCsI2T2sKWD786eQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73c535e27227a9b7bab33943633a392296bdcb57709d295c01d1a31fb1d48e90","last_reissued_at":"2026-05-18T01:13:21.952989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:21.952989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On edges not in monochromatic copies of a fixed bipartite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma","submitted_at":"2016-05-30T08:57:10Z","abstract_excerpt":"Let $H$ be a fixed graph. Denote $f(n,H)$ to be the maximum number of edges not contained in any monochromatic copy of $H$ in a 2-edge-coloring of the complete graph $K_n$, and $ex(n,H)$ to be the {\\it Tur\\'an number} of $H$. An easy lower bound shows $f(n,H)\\ge ex(n,H)$ for any $H$ and $n$. In \\cite{KS2}, Keevash and Sudakov proved that if $H$ is an edge-color-critical graph or $C_4$, then $f(n,H)= ex(n,H)$ holds for large $n$, and they asked if this equality holds for any graph $H$ when $n$ is sufficiently large. In this paper, we provide an affirmative answer to this problem for an abundant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09141","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":"1605.09141","created_at":"2026-05-18T01:13:21.953095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09141v1","created_at":"2026-05-18T01:13:21.953095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09141","created_at":"2026-05-18T01:13:21.953095+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPCTLYTSE6U3","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPCTLYTSE6U3POVT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPCTLYTS","created_at":"2026-05-18T12:30:36.002864+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/OPCTLYTSE6U3POVTHFBWGORZEK","json":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK.json","graph_json":"https://pith.science/api/pith-number/OPCTLYTSE6U3POVTHFBWGORZEK/graph.json","events_json":"https://pith.science/api/pith-number/OPCTLYTSE6U3POVTHFBWGORZEK/events.json","paper":"https://pith.science/paper/OPCTLYTS"},"agent_actions":{"view_html":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK","download_json":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK.json","view_paper":"https://pith.science/paper/OPCTLYTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09141&json=true","fetch_graph":"https://pith.science/api/pith-number/OPCTLYTSE6U3POVTHFBWGORZEK/graph.json","fetch_events":"https://pith.science/api/pith-number/OPCTLYTSE6U3POVTHFBWGORZEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/action/storage_attestation","attest_author":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/action/author_attestation","sign_citation":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/action/citation_signature","submit_replication":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/action/replication_record"}},"created_at":"2026-05-18T01:13:21.953095+00:00","updated_at":"2026-05-18T01:13:21.953095+00:00"}