{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W5QJUHYLGNHLLPIFSRO7TKWVRW","short_pith_number":"pith:W5QJUHYL","schema_version":"1.0","canonical_sha256":"b7609a1f0b334eb5bd05945df9aad58d9bf61e0c97c7076285ccb3705f1ab3c8","source":{"kind":"arxiv","id":"1905.04657","version":1},"attestation_state":"computed","paper":{"title":"Long monochromatic paths and cycles in 2-edge-colored multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, J\\'ozsef Balogh, Mikhail Lavrov, Xujun Liu","submitted_at":"2019-05-12T06:39:06Z","abstract_excerpt":"We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graph $K_{n_1,\\ldots,n_s}$ there exists a monochromatic (i) cycle $C_{2n}$ with $2n$ vertices, (ii) cycle $C_{\\geq 2n}$ with at least $2n$ vertices, (iii) path $P_{2n}$ with $2n$ vertices, and (iv) path $P_{2n+1}$ with $2n+1$ vertices.\n  This implies a generalization for large $n$ of the conjecture by Gy\\'arf\\'as, Ruszink\\'o, S\\'ark\\H{o}zy and Szemer\\'edi that for every $2$-edge-coloring of the complete $3$-partite graph"},"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":"1905.04657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-12T06:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"d2ec757b7a0ceb57f74d54bc5733aabe902ed6869f95643d2f98d162af7baaf1","abstract_canon_sha256":"87db5a57fad76c0e0ce9e64c4ae462b18d20c7a10e89542d7ffbf5fb58fe46ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.053371Z","signature_b64":"9u73JUe+/QZ0nNAa3Q51s7GBZ3PnH31b7Gic2JAWstBcOeIjU7T4AVKYOpFMkH1F8dw/RIQNV7bs8Tob9k9zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7609a1f0b334eb5bd05945df9aad58d9bf61e0c97c7076285ccb3705f1ab3c8","last_reissued_at":"2026-05-17T23:46:24.052646Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.052646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long monochromatic paths and cycles in 2-edge-colored multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, J\\'ozsef Balogh, Mikhail Lavrov, Xujun Liu","submitted_at":"2019-05-12T06:39:06Z","abstract_excerpt":"We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graph $K_{n_1,\\ldots,n_s}$ there exists a monochromatic (i) cycle $C_{2n}$ with $2n$ vertices, (ii) cycle $C_{\\geq 2n}$ with at least $2n$ vertices, (iii) path $P_{2n}$ with $2n$ vertices, and (iv) path $P_{2n+1}$ with $2n+1$ vertices.\n  This implies a generalization for large $n$ of the conjecture by Gy\\'arf\\'as, Ruszink\\'o, S\\'ark\\H{o}zy and Szemer\\'edi that for every $2$-edge-coloring of the complete $3$-partite graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04657","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":"1905.04657","created_at":"2026-05-17T23:46:24.052768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04657v1","created_at":"2026-05-17T23:46:24.052768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04657","created_at":"2026-05-17T23:46:24.052768+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5QJUHYLGNHL","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5QJUHYLGNHLLPIF","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5QJUHYL","created_at":"2026-05-18T12:33:30.264802+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/W5QJUHYLGNHLLPIFSRO7TKWVRW","json":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW.json","graph_json":"https://pith.science/api/pith-number/W5QJUHYLGNHLLPIFSRO7TKWVRW/graph.json","events_json":"https://pith.science/api/pith-number/W5QJUHYLGNHLLPIFSRO7TKWVRW/events.json","paper":"https://pith.science/paper/W5QJUHYL"},"agent_actions":{"view_html":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW","download_json":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW.json","view_paper":"https://pith.science/paper/W5QJUHYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04657&json=true","fetch_graph":"https://pith.science/api/pith-number/W5QJUHYLGNHLLPIFSRO7TKWVRW/graph.json","fetch_events":"https://pith.science/api/pith-number/W5QJUHYLGNHLLPIFSRO7TKWVRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW/action/storage_attestation","attest_author":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW/action/author_attestation","sign_citation":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW/action/citation_signature","submit_replication":"https://pith.science/pith/W5QJUHYLGNHLLPIFSRO7TKWVRW/action/replication_record"}},"created_at":"2026-05-17T23:46:24.052768+00:00","updated_at":"2026-05-17T23:46:24.052768+00:00"}