{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FEEUVERDCKV4PMYMPBK5IU3BP7","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":"a8f547899b93d2c6241bbc86e3cc30963cd765ead72d388b7acb965147aecbe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T07:00:39Z","title_canon_sha256":"efd5b70213c05143e8a8ba7177bc53644a1ce5c365f541e9d2aa8f009de97959"},"schema_version":"1.0","source":{"id":"2606.19851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19851","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19851v1","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19851","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"FEEUVERDCKV4","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_16","alias_value":"FEEUVERDCKV4PMYM","created_at":"2026-06-19T16:12:36Z"},{"alias_kind":"pith_short_8","alias_value":"FEEUVERD","created_at":"2026-06-19T16:12:36Z"}],"graph_snapshots":[{"event_id":"sha256:5d7c022d6cb598c356d82f67a21cdd49aeae0a04f264e331401ff486ba515271","target":"graph","created_at":"2026-06-19T16:12:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.19851/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Lanchao Wang, Mengyuan Niu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T07:00:39Z","title":"An exact robust Ramsey theorem for matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19851","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:f8269437a385e441144be723e9387ecba056769e178149ecb1f065de2a9e1a63","target":"record","created_at":"2026-06-19T16:12:36Z","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":"a8f547899b93d2c6241bbc86e3cc30963cd765ead72d388b7acb965147aecbe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T07:00:39Z","title_canon_sha256":"efd5b70213c05143e8a8ba7177bc53644a1ce5c365f541e9d2aa8f009de97959"},"schema_version":"1.0","source":{"id":"2606.19851","kind":"arxiv","version":1}},"canonical_sha256":"29094a922312abc7b30c7855d453617fd6fcfe4a6aac1eda49d4fe63d868f48b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29094a922312abc7b30c7855d453617fd6fcfe4a6aac1eda49d4fe63d868f48b","first_computed_at":"2026-06-19T16:12:36.956089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:36.956089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nrP1oRN/S2CoWluADXWnIIog3qCRJLKsB6SinY181B2ybitRxYzSvE+qYvN2rPZubIXm33rnPfMeDjHdp6o+Dw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:36.956468Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8269437a385e441144be723e9387ecba056769e178149ecb1f065de2a9e1a63","sha256:5d7c022d6cb598c356d82f67a21cdd49aeae0a04f264e331401ff486ba515271"],"state_sha256":"7fb4d3ccaaeeec300edc9c69d8c486607fd868f8a2048421d8305da5a2c375c1"}