{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:76WDPIRV6VWYP4U3OSNSPU35NO","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":"b0d6fed0c04bfe8776906656ea3d2b91f6f52df8c3bdd22a174bb3d75a3a7c02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T15:22:13Z","title_canon_sha256":"650c38340fdb7249d402355180da9ad3f53b60fe421b6f4fb1e6bd2492817571"},"schema_version":"1.0","source":{"id":"2504.15167","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15167","created_at":"2026-07-05T11:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15167v2","created_at":"2026-07-05T11:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15167","created_at":"2026-07-05T11:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"76WDPIRV6VWY","created_at":"2026-07-05T11:44:47Z"},{"alias_kind":"pith_short_16","alias_value":"76WDPIRV6VWYP4U3","created_at":"2026-07-05T11:44:47Z"},{"alias_kind":"pith_short_8","alias_value":"76WDPIRV","created_at":"2026-07-05T11:44:47Z"}],"graph_snapshots":[{"event_id":"sha256:b21e92a8b959acc99e1da245077b2d26f7470fe43f75bfe688870a40832788f0","target":"graph","created_at":"2026-07-05T11:44:47Z","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/2504.15167/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that, for positive integers $n,a_1, a_2, a_3$ satisfying $a_1+a_2+a_3 = n-1$, it holds that any bipartite graph $G$ which is the union of three perfect matchings $M_1$, $M_2$, and $M_3$ on $2n$ vertices contains a matching $M$ such that $|M\\cap M_i| =a_i$ for $i= 1,2,$ and $3$. The bound $n-1$ on the sum is best possible in general. Our result verifies the multiplicity extension of the Ryser-Brualdi-Stein Conjecture, proposed recently by Anastos, Fabian, M\\\"uyesser, and Szab\\'o, for three colors.","authors_text":"Micha Christoph, Simona Boyadzhiyska, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T15:22:13Z","title":"Almost-perfect colorful matchings in three-edge-colored bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15167","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:193ed39794fd1bd667aac2ece4091468d3a41928f24d360fc525493ad41fd7d5","target":"record","created_at":"2026-07-05T11:44:47Z","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":"b0d6fed0c04bfe8776906656ea3d2b91f6f52df8c3bdd22a174bb3d75a3a7c02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T15:22:13Z","title_canon_sha256":"650c38340fdb7249d402355180da9ad3f53b60fe421b6f4fb1e6bd2492817571"},"schema_version":"1.0","source":{"id":"2504.15167","kind":"arxiv","version":2}},"canonical_sha256":"ffac37a235f56d87f29b749b27d37d6bb4368bb9ed533eb64044cf0be0cb971b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffac37a235f56d87f29b749b27d37d6bb4368bb9ed533eb64044cf0be0cb971b","first_computed_at":"2026-07-05T11:44:47.998330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:47.998330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d8hq2V7ZpsozJ3EyQ0gUF6GU8Kkp/dLfxrhxYpnKbDp2MpDD7Nzfhm2bsQOl3Vs9PwI0wn6wFHvhhaqMiZ8ADw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:47.998832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15167","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:193ed39794fd1bd667aac2ece4091468d3a41928f24d360fc525493ad41fd7d5","sha256:b21e92a8b959acc99e1da245077b2d26f7470fe43f75bfe688870a40832788f0"],"state_sha256":"e93ee5b15b18e4100ae9fab750390c9d7f81ff9e6567f0e90733a198333c7189"}