{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OPCTLYTSE6U3POVTHFBWGORZEK","short_pith_number":"pith:OPCTLYTS","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"},"canonical_sha256":"73c535e27227a9b7bab33943633a392296bdcb57709d295c01d1a31fb1d48e90","source":{"kind":"arxiv","id":"1605.09141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09141","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09141v1","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09141","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"OPCTLYTSE6U3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPCTLYTSE6U3POVT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPCTLYTS","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OPCTLYTSE6U3POVTHFBWGORZEK","target":"record","payload":{"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"},"canonical_sha256":"73c535e27227a9b7bab33943633a392296bdcb57709d295c01d1a31fb1d48e90","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"},"source_kind":"arxiv","source_id":"1605.09141","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-18T01:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2VOsbrMBNznqh+13CVjxGnSPXYgEAZ4GhLrjxRv8Oj9sdd/5XfD92jwqvyFN+eZTUsE6ODRDyaSfDJ0PDjlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:55:10.529011Z"},"content_sha256":"d5a5ac6e824b2918e239ea9056deef7122a8122888f7c8d743224826a6ed8960","schema_version":"1.0","event_id":"sha256:d5a5ac6e824b2918e239ea9056deef7122a8122888f7c8d743224826a6ed8960"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OPCTLYTSE6U3POVTHFBWGORZEK","target":"graph","payload":{"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"},"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-18T01:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0ZstUgUfHsjPDBjvcg3rTgmw6EkESEBWTdyrudx6eZijBTvIv92guKUmSWbT0YD7SpDZPxWQ4vuWYWAZC3jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:55:10.529358Z"},"content_sha256":"a593b49141645ea73a2da19bc45d6ae1ec2b77d2756f958b74c8e3c59cc179d5","schema_version":"1.0","event_id":"sha256:a593b49141645ea73a2da19bc45d6ae1ec2b77d2756f958b74c8e3c59cc179d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/bundle.json","state_url":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPCTLYTSE6U3POVTHFBWGORZEK/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-07-04T15:55:10Z","links":{"resolver":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK","bundle":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/bundle.json","state":"https://pith.science/pith/OPCTLYTSE6U3POVTHFBWGORZEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPCTLYTSE6U3POVTHFBWGORZEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OPCTLYTSE6U3POVTHFBWGORZEK","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":"318547aea736f4243daa13278d9e7240b5fd58adf19e1143865abaff77d91ddf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-30T08:57:10Z","title_canon_sha256":"6b264a08f01041014f7454e21f854b35fe098c421a6ccf9ff216b6e0ffa26cbb"},"schema_version":"1.0","source":{"id":"1605.09141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09141","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09141v1","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09141","created_at":"2026-05-18T01:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"OPCTLYTSE6U3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPCTLYTSE6U3POVT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPCTLYTS","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a593b49141645ea73a2da19bc45d6ae1ec2b77d2756f958b74c8e3c59cc179d5","target":"graph","created_at":"2026-05-18T01:13:21Z","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":"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","authors_text":"Jie Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-30T08:57:10Z","title":"On edges not in monochromatic copies of a fixed bipartite graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09141","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:d5a5ac6e824b2918e239ea9056deef7122a8122888f7c8d743224826a6ed8960","target":"record","created_at":"2026-05-18T01:13:21Z","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":"318547aea736f4243daa13278d9e7240b5fd58adf19e1143865abaff77d91ddf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-30T08:57:10Z","title_canon_sha256":"6b264a08f01041014f7454e21f854b35fe098c421a6ccf9ff216b6e0ffa26cbb"},"schema_version":"1.0","source":{"id":"1605.09141","kind":"arxiv","version":1}},"canonical_sha256":"73c535e27227a9b7bab33943633a392296bdcb57709d295c01d1a31fb1d48e90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73c535e27227a9b7bab33943633a392296bdcb57709d295c01d1a31fb1d48e90","first_computed_at":"2026-05-18T01:13:21.952989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:21.952989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2U6Tg0C84kvD0rVemnBapGwrm/vluu3v7HF8bspVMkKuHoD/LNogsJNlMfZTWVLqKyDrCsI2T2sKWD786eQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:21.953704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5a5ac6e824b2918e239ea9056deef7122a8122888f7c8d743224826a6ed8960","sha256:a593b49141645ea73a2da19bc45d6ae1ec2b77d2756f958b74c8e3c59cc179d5"],"state_sha256":"93d4c686e7ed13f6990b608760bec787daa9718aa3d67dfc2c7469c4d12d68a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qC+pONV8E34a/BxCn6xcJ5GEreulgYJO2r0JQMsqNPR3bTwNblKHAyr2wtGlvQ3+J8eQKBl5tPS43BCfPBJZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T15:55:10.531292Z","bundle_sha256":"c0601b39a6f69f690da667717ea640dcec18b20e9f9d3432005a72ef00ac029d"}}