{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FEEUVERDCKV4PMYMPBK5IU3BP7","short_pith_number":"pith:FEEUVERD","schema_version":"1.0","canonical_sha256":"29094a922312abc7b30c7855d453617fd6fcfe4a6aac1eda49d4fe63d868f48b","source":{"kind":"arxiv","id":"2606.19851","version":1},"attestation_state":"computed","paper":{"title":"An exact robust Ramsey theorem for matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lanchao Wang, Mengyuan Niu","submitted_at":"2026-06-18T07:00:39Z","abstract_excerpt":"Keevash and Michaeli recently proved that, under the robustness assumption that \\(G\\) is an \\(s\\)-connector (i.e. \\(\\overline G\\) is \\(K_{s,s}\\)-free), \\(G\\) has essentially the same multicolour Ramsey matching properties as complete graphs, with an additive error \\(O(qs)\\), where \\(q\\) is the number of colours. They asked whether the dependence on \\(q\\) can be removed. We answer this question in a stronger exact form. For \\({\\bf t}=(t_1,\\ldots,t_q)\\in\\mathbb N_+^q\\), let \\(R_s({\\bf t})\\) be the smallest integer \\(N\\) such that every \\(N\\)-vertex \\(s\\)-connector \\(G\\) satisfies \\(\n  G\\to (t_1K"},"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":"2606.19851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T07:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"efd5b70213c05143e8a8ba7177bc53644a1ce5c365f541e9d2aa8f009de97959","abstract_canon_sha256":"a8f547899b93d2c6241bbc86e3cc30963cd765ead72d388b7acb965147aecbe4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:36.956468Z","signature_b64":"nrP1oRN/S2CoWluADXWnIIog3qCRJLKsB6SinY181B2ybitRxYzSvE+qYvN2rPZubIXm33rnPfMeDjHdp6o+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29094a922312abc7b30c7855d453617fd6fcfe4a6aac1eda49d4fe63d868f48b","last_reissued_at":"2026-06-19T16:12:36.956089Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:36.956089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exact robust Ramsey theorem for matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lanchao Wang, Mengyuan Niu","submitted_at":"2026-06-18T07:00:39Z","abstract_excerpt":"Keevash and Michaeli recently proved that, under the robustness assumption that \\(G\\) is an \\(s\\)-connector (i.e. \\(\\overline G\\) is \\(K_{s,s}\\)-free), \\(G\\) has essentially the same multicolour Ramsey matching properties as complete graphs, with an additive error \\(O(qs)\\), where \\(q\\) is the number of colours. They asked whether the dependence on \\(q\\) can be removed. We answer this question in a stronger exact form. For \\({\\bf t}=(t_1,\\ldots,t_q)\\in\\mathbb N_+^q\\), let \\(R_s({\\bf t})\\) be the smallest integer \\(N\\) such that every \\(N\\)-vertex \\(s\\)-connector \\(G\\) satisfies \\(\n  G\\to (t_1K"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19851","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.19851/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.19851","created_at":"2026-06-19T16:12:36.956151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19851v1","created_at":"2026-06-19T16:12:36.956151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19851","created_at":"2026-06-19T16:12:36.956151+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEEUVERDCKV4","created_at":"2026-06-19T16:12:36.956151+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEEUVERDCKV4PMYM","created_at":"2026-06-19T16:12:36.956151+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEEUVERD","created_at":"2026-06-19T16:12:36.956151+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/FEEUVERDCKV4PMYMPBK5IU3BP7","json":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7.json","graph_json":"https://pith.science/api/pith-number/FEEUVERDCKV4PMYMPBK5IU3BP7/graph.json","events_json":"https://pith.science/api/pith-number/FEEUVERDCKV4PMYMPBK5IU3BP7/events.json","paper":"https://pith.science/paper/FEEUVERD"},"agent_actions":{"view_html":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7","download_json":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7.json","view_paper":"https://pith.science/paper/FEEUVERD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19851&json=true","fetch_graph":"https://pith.science/api/pith-number/FEEUVERDCKV4PMYMPBK5IU3BP7/graph.json","fetch_events":"https://pith.science/api/pith-number/FEEUVERDCKV4PMYMPBK5IU3BP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7/action/storage_attestation","attest_author":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7/action/author_attestation","sign_citation":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7/action/citation_signature","submit_replication":"https://pith.science/pith/FEEUVERDCKV4PMYMPBK5IU3BP7/action/replication_record"}},"created_at":"2026-06-19T16:12:36.956151+00:00","updated_at":"2026-06-19T16:12:36.956151+00:00"}