{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HNXE7XHQC3LNU4LC4F6DQAHDJD","short_pith_number":"pith:HNXE7XHQ","schema_version":"1.0","canonical_sha256":"3b6e4fdcf016d6da7162e17c3800e348dd12e13e7d3c2c5432fb6bbe34ea1d81","source":{"kind":"arxiv","id":"1312.7253","version":1},"attestation_state":"computed","paper":{"title":"Complexity Results for Rainbow Matchings","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Florian Pfender, Van Bang Le","submitted_at":"2013-12-27T12:53:47Z","abstract_excerpt":"A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, \\mrbm: Given an edge-colored graph $G$, how large is the largest rainbow matching in $G$? We present several sharp contrasts in the complexity of this problem.\n  We show, among others, that \n\n* can be approximated by a polynomial algorithm with approximation ratio $2/3-\\eps$. \n* is APX-complete, even when restricted to properly edge-colored linear forests without a $5$-vertex path, and is solvable in %time $O(m^{3/2})$ on edge-colored $m$-edge po"},"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":"1312.7253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2013-12-27T12:53:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"125f547875f71c9a2577a6ceef1ab0f15ea9634f90686750d12fdd9ca13de179","abstract_canon_sha256":"efbbb7cb6cf6e54cb83db8cf444d458756addbc2434a71a80cfa12a80e7395db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:45.338455Z","signature_b64":"BJAZl57JMWVB9/LMMZOnsc0A8mySLtwFrNAwqNHge7FOmHyfFgGmStWI4xE4P9y/57EDReiZvhlKzfJRPfiTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b6e4fdcf016d6da7162e17c3800e348dd12e13e7d3c2c5432fb6bbe34ea1d81","last_reissued_at":"2026-05-18T03:03:45.337734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:45.337734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Results for Rainbow Matchings","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Florian Pfender, Van Bang Le","submitted_at":"2013-12-27T12:53:47Z","abstract_excerpt":"A rainbow matching in an edge-colored graph is a matching whose edges have distinct colors. We address the complexity issue of the following problem, \\mrbm: Given an edge-colored graph $G$, how large is the largest rainbow matching in $G$? We present several sharp contrasts in the complexity of this problem.\n  We show, among others, that \n\n* can be approximated by a polynomial algorithm with approximation ratio $2/3-\\eps$. \n* is APX-complete, even when restricted to properly edge-colored linear forests without a $5$-vertex path, and is solvable in %time $O(m^{3/2})$ on edge-colored $m$-edge po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7253","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":""},"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":"1312.7253","created_at":"2026-05-18T03:03:45.337852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7253v1","created_at":"2026-05-18T03:03:45.337852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7253","created_at":"2026-05-18T03:03:45.337852+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNXE7XHQC3LN","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNXE7XHQC3LNU4LC","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNXE7XHQ","created_at":"2026-05-18T12:27:46.883200+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/HNXE7XHQC3LNU4LC4F6DQAHDJD","json":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD.json","graph_json":"https://pith.science/api/pith-number/HNXE7XHQC3LNU4LC4F6DQAHDJD/graph.json","events_json":"https://pith.science/api/pith-number/HNXE7XHQC3LNU4LC4F6DQAHDJD/events.json","paper":"https://pith.science/paper/HNXE7XHQ"},"agent_actions":{"view_html":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD","download_json":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD.json","view_paper":"https://pith.science/paper/HNXE7XHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7253&json=true","fetch_graph":"https://pith.science/api/pith-number/HNXE7XHQC3LNU4LC4F6DQAHDJD/graph.json","fetch_events":"https://pith.science/api/pith-number/HNXE7XHQC3LNU4LC4F6DQAHDJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/action/storage_attestation","attest_author":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/action/author_attestation","sign_citation":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/action/citation_signature","submit_replication":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/action/replication_record"}},"created_at":"2026-05-18T03:03:45.337852+00:00","updated_at":"2026-05-18T03:03:45.337852+00:00"}