{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RXTMQ56LAH6YOOI2EL5LVRGFB5","short_pith_number":"pith:RXTMQ56L","schema_version":"1.0","canonical_sha256":"8de6c877cb01fd87391a22fabac4c50f4d09750a83a77f0e54e0b174cb1d6a37","source":{"kind":"arxiv","id":"1806.05119","version":1},"attestation_state":"computed","paper":{"title":"Long monochromatic paths and cycles in 2-colored bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis DeBiasio, Robert A. Krueger","submitted_at":"2018-06-13T15:45:26Z","abstract_excerpt":"Gy\\'arf\\'as and Lehel and independently Faudree and Schelp proved that in any 2-coloring of the edges of $K_{n,n}$ there exists a monochromatic path on at least $2\\lceil n/2\\rceil$ vertices, and this is tight. We prove a stability version of this result which holds even if the host graph is not complete; that is, if $G$ is a balanced bipartite graph on $2n$ vertices with minimum degree at least $(3/4+o(1))n$, then in every 2-coloring of the edges of $G$, either there exists a monochromatic cycle on at least $(1+o(1))n$ vertices, or the coloring of $G$ is close to an extremal coloring -- in whi"},"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":"1806.05119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-13T15:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"4003d505cd2e704b8b6b5a7f0dc7eef40d269dbe84fdfa8af467298dc77e339e","abstract_canon_sha256":"3cbdfee6b6b8e229eccd0cd513ad283950c363639a913a865f6cfa23349ac31a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.087296Z","signature_b64":"7QQhcpf2N3HjZdF6bilvId6Z3Uxo36MnoBDlUDMCoYkWtyVxWtPsgw0H89fhdl52vVhItIHlSiusyzjIWE/OBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de6c877cb01fd87391a22fabac4c50f4d09750a83a77f0e54e0b174cb1d6a37","last_reissued_at":"2026-05-18T00:13:20.086642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.086642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long monochromatic paths and cycles in 2-colored bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis DeBiasio, Robert A. Krueger","submitted_at":"2018-06-13T15:45:26Z","abstract_excerpt":"Gy\\'arf\\'as and Lehel and independently Faudree and Schelp proved that in any 2-coloring of the edges of $K_{n,n}$ there exists a monochromatic path on at least $2\\lceil n/2\\rceil$ vertices, and this is tight. We prove a stability version of this result which holds even if the host graph is not complete; that is, if $G$ is a balanced bipartite graph on $2n$ vertices with minimum degree at least $(3/4+o(1))n$, then in every 2-coloring of the edges of $G$, either there exists a monochromatic cycle on at least $(1+o(1))n$ vertices, or the coloring of $G$ is close to an extremal coloring -- in whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05119","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":"1806.05119","created_at":"2026-05-18T00:13:20.086736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05119v1","created_at":"2026-05-18T00:13:20.086736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05119","created_at":"2026-05-18T00:13:20.086736+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXTMQ56LAH6Y","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXTMQ56LAH6YOOI2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXTMQ56L","created_at":"2026-05-18T12:32:50.500415+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/RXTMQ56LAH6YOOI2EL5LVRGFB5","json":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5.json","graph_json":"https://pith.science/api/pith-number/RXTMQ56LAH6YOOI2EL5LVRGFB5/graph.json","events_json":"https://pith.science/api/pith-number/RXTMQ56LAH6YOOI2EL5LVRGFB5/events.json","paper":"https://pith.science/paper/RXTMQ56L"},"agent_actions":{"view_html":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5","download_json":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5.json","view_paper":"https://pith.science/paper/RXTMQ56L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05119&json=true","fetch_graph":"https://pith.science/api/pith-number/RXTMQ56LAH6YOOI2EL5LVRGFB5/graph.json","fetch_events":"https://pith.science/api/pith-number/RXTMQ56LAH6YOOI2EL5LVRGFB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5/action/storage_attestation","attest_author":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5/action/author_attestation","sign_citation":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5/action/citation_signature","submit_replication":"https://pith.science/pith/RXTMQ56LAH6YOOI2EL5LVRGFB5/action/replication_record"}},"created_at":"2026-05-18T00:13:20.086736+00:00","updated_at":"2026-05-18T00:13:20.086736+00:00"}