{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:76WDPIRV6VWYP4U3OSNSPU35NO","short_pith_number":"pith:76WDPIRV","schema_version":"1.0","canonical_sha256":"ffac37a235f56d87f29b749b27d37d6bb4368bb9ed533eb64044cf0be0cb971b","source":{"kind":"arxiv","id":"2504.15167","version":2},"attestation_state":"computed","paper":{"title":"Almost-perfect colorful matchings in three-edge-colored bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Micha Christoph, Simona Boyadzhiyska, Tibor Szab\\'o","submitted_at":"2025-04-21T15:22:13Z","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."},"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":"2504.15167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-21T15:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"650c38340fdb7249d402355180da9ad3f53b60fe421b6f4fb1e6bd2492817571","abstract_canon_sha256":"b0d6fed0c04bfe8776906656ea3d2b91f6f52df8c3bdd22a174bb3d75a3a7c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:47.998832Z","signature_b64":"d8hq2V7ZpsozJ3EyQ0gUF6GU8Kkp/dLfxrhxYpnKbDp2MpDD7Nzfhm2bsQOl3Vs9PwI0wn6wFHvhhaqMiZ8ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffac37a235f56d87f29b749b27d37d6bb4368bb9ed533eb64044cf0be0cb971b","last_reissued_at":"2026-07-05T11:44:47.998330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:47.998330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-perfect colorful matchings in three-edge-colored bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Micha Christoph, Simona Boyadzhiyska, Tibor Szab\\'o","submitted_at":"2025-04-21T15:22:13Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15167","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.15167/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":"2504.15167","created_at":"2026-07-05T11:44:47.998393+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15167v2","created_at":"2026-07-05T11:44:47.998393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15167","created_at":"2026-07-05T11:44:47.998393+00:00"},{"alias_kind":"pith_short_12","alias_value":"76WDPIRV6VWY","created_at":"2026-07-05T11:44:47.998393+00:00"},{"alias_kind":"pith_short_16","alias_value":"76WDPIRV6VWYP4U3","created_at":"2026-07-05T11:44:47.998393+00:00"},{"alias_kind":"pith_short_8","alias_value":"76WDPIRV","created_at":"2026-07-05T11:44:47.998393+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/76WDPIRV6VWYP4U3OSNSPU35NO","json":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO.json","graph_json":"https://pith.science/api/pith-number/76WDPIRV6VWYP4U3OSNSPU35NO/graph.json","events_json":"https://pith.science/api/pith-number/76WDPIRV6VWYP4U3OSNSPU35NO/events.json","paper":"https://pith.science/paper/76WDPIRV"},"agent_actions":{"view_html":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO","download_json":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO.json","view_paper":"https://pith.science/paper/76WDPIRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15167&json=true","fetch_graph":"https://pith.science/api/pith-number/76WDPIRV6VWYP4U3OSNSPU35NO/graph.json","fetch_events":"https://pith.science/api/pith-number/76WDPIRV6VWYP4U3OSNSPU35NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO/action/storage_attestation","attest_author":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO/action/author_attestation","sign_citation":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO/action/citation_signature","submit_replication":"https://pith.science/pith/76WDPIRV6VWYP4U3OSNSPU35NO/action/replication_record"}},"created_at":"2026-07-05T11:44:47.998393+00:00","updated_at":"2026-07-05T11:44:47.998393+00:00"}