{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MBLPVWN2ZSF6BAWWW3BGC2YJX7","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":"782b1a4d112378f50114ce762b67459440c8c932a94dd56843b93fa1957d74e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-06T16:09:27Z","title_canon_sha256":"72584fe31461cc13c91d235e22fbf721ffe1f01cffa4ee1c04a9fe1211099872"},"schema_version":"1.0","source":{"id":"2212.03100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03100","created_at":"2026-07-05T06:16:14Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03100v2","created_at":"2026-07-05T06:16:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03100","created_at":"2026-07-05T06:16:14Z"},{"alias_kind":"pith_short_12","alias_value":"MBLPVWN2ZSF6","created_at":"2026-07-05T06:16:14Z"},{"alias_kind":"pith_short_16","alias_value":"MBLPVWN2ZSF6BAWW","created_at":"2026-07-05T06:16:14Z"},{"alias_kind":"pith_short_8","alias_value":"MBLPVWN2","created_at":"2026-07-05T06:16:14Z"}],"graph_snapshots":[{"event_id":"sha256:50f3fa652202a5bd94d757dcf22efb79744881f90298081eeeefbd9c9031fa50","target":"graph","created_at":"2026-07-05T06:16:14Z","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/2212.03100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study multigraphs whose edge-sets are the union of three perfect matchings, $M_1$, $M_2$, and $M_3$. Given such a graph $G$ and any $a_1,a_2,a_3\\in \\mathbb{N}$ with $a_1+a_2+a_3\\leq n-2$, we show there exists a matching $M$ of $G$ with $|M\\cap M_i|=a_i$ for each $i\\in \\{1,2,3\\}$. The bound $n-2$ in the theorem is best possible in general. We conjecture however that if $G$ is bipartite, the same result holds with $n-2$ replaced by $n-1$. We give a construction that shows such a result would be tight. We also make a conjecture generalising the Ryser-Brualdi-Stein conjecture with colour multip","authors_text":"Alp M\\\"uyesser, David Fabian, Michael Anastos, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-06T16:09:27Z","title":"Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03100","kind":"arxiv","version":2},"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:76c02f1148a2ba515404e647f6f387a29a730eace9dec69b5de89ae92180f0ce","target":"record","created_at":"2026-07-05T06:16:14Z","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":"782b1a4d112378f50114ce762b67459440c8c932a94dd56843b93fa1957d74e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-12-06T16:09:27Z","title_canon_sha256":"72584fe31461cc13c91d235e22fbf721ffe1f01cffa4ee1c04a9fe1211099872"},"schema_version":"1.0","source":{"id":"2212.03100","kind":"arxiv","version":2}},"canonical_sha256":"6056fad9bacc8be082d6b6c2616b09bfd1bc3cda9095a6e45d87e7b1862ebe88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6056fad9bacc8be082d6b6c2616b09bfd1bc3cda9095a6e45d87e7b1862ebe88","first_computed_at":"2026-07-05T06:16:14.080818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:16:14.080818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2TwCvmd38R0Zb0IZO4WL2Oi7t2H35vtEa1afWyTl4CYugVcTrRyaVUK0DecjQDw2P+2s7zyBoBwHgCiss05DBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:16:14.081300Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.03100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76c02f1148a2ba515404e647f6f387a29a730eace9dec69b5de89ae92180f0ce","sha256:50f3fa652202a5bd94d757dcf22efb79744881f90298081eeeefbd9c9031fa50"],"state_sha256":"af27bcc45402605679d9fbd13a6838f55ac40b58c4896c1bceca222c2ee38d58"}