{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HNXE7XHQC3LNU4LC4F6DQAHDJD","short_pith_number":"pith:HNXE7XHQ","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"},"canonical_sha256":"3b6e4fdcf016d6da7162e17c3800e348dd12e13e7d3c2c5432fb6bbe34ea1d81","source":{"kind":"arxiv","id":"1312.7253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7253","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7253v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7253","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"HNXE7XHQC3LN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HNXE7XHQC3LNU4LC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HNXE7XHQ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HNXE7XHQC3LNU4LC4F6DQAHDJD","target":"record","payload":{"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"},"canonical_sha256":"3b6e4fdcf016d6da7162e17c3800e348dd12e13e7d3c2c5432fb6bbe34ea1d81","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"},"source_kind":"arxiv","source_id":"1312.7253","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5Seo8hG+h0VPv4DagRQR3rVQ7X8jBea2zQi/t2FNr1JUJGkbDdO8sDmMYrSUKt7vR60qUzVF/ofkDWnFJz/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:04:16.364853Z"},"content_sha256":"0139ee43712bad0f93d28c8f47c3b39c242b2e740fd22cc25a496963bb47f815","schema_version":"1.0","event_id":"sha256:0139ee43712bad0f93d28c8f47c3b39c242b2e740fd22cc25a496963bb47f815"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HNXE7XHQC3LNU4LC4F6DQAHDJD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:03:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2JS+k6MV3UoMIeiqVBm2iJ6JqqB+w+BNHJCbz0+rrjzkpD8JUsTzwfKRJwlh2gtA9uc/BJqEYjwv2xEpUg3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:04:16.365615Z"},"content_sha256":"d0cbae9b3c14794ba591ef26b2dbeffdff432a228d3c728911883a956b6c172a","schema_version":"1.0","event_id":"sha256:d0cbae9b3c14794ba591ef26b2dbeffdff432a228d3c728911883a956b6c172a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/bundle.json","state_url":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T23:04:16Z","links":{"resolver":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD","bundle":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/bundle.json","state":"https://pith.science/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNXE7XHQC3LNU4LC4F6DQAHDJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HNXE7XHQC3LNU4LC4F6DQAHDJD","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":"efbbb7cb6cf6e54cb83db8cf444d458756addbc2434a71a80cfa12a80e7395db","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2013-12-27T12:53:47Z","title_canon_sha256":"125f547875f71c9a2577a6ceef1ab0f15ea9634f90686750d12fdd9ca13de179"},"schema_version":"1.0","source":{"id":"1312.7253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7253","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7253v1","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7253","created_at":"2026-05-18T03:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"HNXE7XHQC3LN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HNXE7XHQC3LNU4LC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HNXE7XHQ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:d0cbae9b3c14794ba591ef26b2dbeffdff432a228d3c728911883a956b6c172a","target":"graph","created_at":"2026-05-18T03:03:45Z","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"},"paper":{"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","authors_text":"Florian Pfender, Van Bang Le","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2013-12-27T12:53:47Z","title":"Complexity Results for Rainbow Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7253","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:0139ee43712bad0f93d28c8f47c3b39c242b2e740fd22cc25a496963bb47f815","target":"record","created_at":"2026-05-18T03:03:45Z","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":"efbbb7cb6cf6e54cb83db8cf444d458756addbc2434a71a80cfa12a80e7395db","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DM","submitted_at":"2013-12-27T12:53:47Z","title_canon_sha256":"125f547875f71c9a2577a6ceef1ab0f15ea9634f90686750d12fdd9ca13de179"},"schema_version":"1.0","source":{"id":"1312.7253","kind":"arxiv","version":1}},"canonical_sha256":"3b6e4fdcf016d6da7162e17c3800e348dd12e13e7d3c2c5432fb6bbe34ea1d81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b6e4fdcf016d6da7162e17c3800e348dd12e13e7d3c2c5432fb6bbe34ea1d81","first_computed_at":"2026-05-18T03:03:45.337734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:45.337734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BJAZl57JMWVB9/LMMZOnsc0A8mySLtwFrNAwqNHge7FOmHyfFgGmStWI4xE4P9y/57EDReiZvhlKzfJRPfiTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:45.338455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0139ee43712bad0f93d28c8f47c3b39c242b2e740fd22cc25a496963bb47f815","sha256:d0cbae9b3c14794ba591ef26b2dbeffdff432a228d3c728911883a956b6c172a"],"state_sha256":"de50dd671b2f0c85a72077e79e8dd68b8e742c6cb1a2015d1c4209bfc02c165b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plAWAiTwNDpf+Db4zkBtrk7U/Q5whWY6TWnaR126b8IowxnUE4/KRhSiBAQJ7bfUVp7f0kK51dkBYko+oKwnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:04:16.370034Z","bundle_sha256":"e28b882980dbba5f3baf86579fdf4905080367deebbf0c1d3a18ff137b8d0109"}}