{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K52O4P5GWKNRC7HF4PIB7BTDRM","short_pith_number":"pith:K52O4P5G","schema_version":"1.0","canonical_sha256":"5774ee3fa6b29b117ce5e3d01f86638b0762abf5451fba075343adbd229c1818","source":{"kind":"arxiv","id":"1501.05619","version":2},"attestation_state":"computed","paper":{"title":"Local colourings and monochromatic partitions in complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maya Stein, Richard Lang","submitted_at":"2015-01-22T20:09:27Z","abstract_excerpt":"We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths. And, we can cover almost all vertices of any complete or balanced complete bipartite $r$-locally coloured graph with $O(r^2)$ disjoint monochromatic cycles.\\\\ We also determine the $2$-local bipartite Ramsey number of a path almost exactly: Every $2$-local colouring of the edges of $K_{n,n}$ contains a monochromatic path on $n$ vertices."},"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":"1501.05619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-22T20:09:27Z","cross_cats_sorted":[],"title_canon_sha256":"c05f3e10beb8f5f212d072f9d51a8744b0de7472e9d4c934ebc019614375d3a7","abstract_canon_sha256":"713534ac7a43ee7194a0b18ca58ea122aac12978bfcfbe3de9584f6659b2fa1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.671944Z","signature_b64":"fhEELevI0gDxIW1peEX1NX1rqlglQh31/thzuD9zisphjRzeJyUpB1HLO4L0xw3/XCa/3tpE+nntbevtlxZVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5774ee3fa6b29b117ce5e3d01f86638b0762abf5451fba075343adbd229c1818","last_reissued_at":"2026-05-18T01:04:50.671521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.671521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local colourings and monochromatic partitions in complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maya Stein, Richard Lang","submitted_at":"2015-01-22T20:09:27Z","abstract_excerpt":"We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths. And, we can cover almost all vertices of any complete or balanced complete bipartite $r$-locally coloured graph with $O(r^2)$ disjoint monochromatic cycles.\\\\ We also determine the $2$-local bipartite Ramsey number of a path almost exactly: Every $2$-local colouring of the edges of $K_{n,n}$ contains a monochromatic path on $n$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05619","kind":"arxiv","version":2},"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":"1501.05619","created_at":"2026-05-18T01:04:50.671588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05619v2","created_at":"2026-05-18T01:04:50.671588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05619","created_at":"2026-05-18T01:04:50.671588+00:00"},{"alias_kind":"pith_short_12","alias_value":"K52O4P5GWKNR","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K52O4P5GWKNRC7HF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K52O4P5G","created_at":"2026-05-18T12:29:27.538025+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/K52O4P5GWKNRC7HF4PIB7BTDRM","json":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM.json","graph_json":"https://pith.science/api/pith-number/K52O4P5GWKNRC7HF4PIB7BTDRM/graph.json","events_json":"https://pith.science/api/pith-number/K52O4P5GWKNRC7HF4PIB7BTDRM/events.json","paper":"https://pith.science/paper/K52O4P5G"},"agent_actions":{"view_html":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM","download_json":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM.json","view_paper":"https://pith.science/paper/K52O4P5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05619&json=true","fetch_graph":"https://pith.science/api/pith-number/K52O4P5GWKNRC7HF4PIB7BTDRM/graph.json","fetch_events":"https://pith.science/api/pith-number/K52O4P5GWKNRC7HF4PIB7BTDRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM/action/storage_attestation","attest_author":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM/action/author_attestation","sign_citation":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM/action/citation_signature","submit_replication":"https://pith.science/pith/K52O4P5GWKNRC7HF4PIB7BTDRM/action/replication_record"}},"created_at":"2026-05-18T01:04:50.671588+00:00","updated_at":"2026-05-18T01:04:50.671588+00:00"}