{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ODF7Y3OAJNN7XBX2TFZYDAMPAK","short_pith_number":"pith:ODF7Y3OA","canonical_record":{"source":{"id":"1612.00943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-03T09:03:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"94873560f835c6313cd26263f2fce132213145f2a02adde23a67f50a8fa17b31","abstract_canon_sha256":"3739494b0d3107d3dc8447cd4c4ac9345dad4e924fba947e9dd95869cca843ac"},"schema_version":"1.0"},"canonical_sha256":"70cbfc6dc04b5bfb86fa997381818f029c7ddf20c980dde8e0cefea8e8a983d4","source":{"kind":"arxiv","id":"1612.00943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00943","created_at":"2026-05-18T00:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00943v1","created_at":"2026-05-18T00:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00943","created_at":"2026-05-18T00:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"ODF7Y3OAJNN7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ODF7Y3OAJNN7XBX2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ODF7Y3OA","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ODF7Y3OAJNN7XBX2TFZYDAMPAK","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-03T09:03:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"94873560f835c6313cd26263f2fce132213145f2a02adde23a67f50a8fa17b31","abstract_canon_sha256":"3739494b0d3107d3dc8447cd4c4ac9345dad4e924fba947e9dd95869cca843ac"},"schema_version":"1.0"},"canonical_sha256":"70cbfc6dc04b5bfb86fa997381818f029c7ddf20c980dde8e0cefea8e8a983d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:53.768644Z","signature_b64":"xDpezD2ILsU2pv9zXLVqRZEdHr/OTNoWGPfmtdtD4KRgpa0+UxNG9cvyC2+rJ2+Q/V67eHuMRbMpzIZnby00Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70cbfc6dc04b5bfb86fa997381818f029c7ddf20c980dde8e0cefea8e8a983d4","last_reissued_at":"2026-05-18T00:55:53.768210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:53.768210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00943","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-18T00:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SaVTAhfGPqVeeEafetH0K4pCvHFGDrgGUqBaBTYfaAJgndj47z/rv5ITRmgWCdqbPE1gmzdqakCHEw55O4q7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:46:22.031282Z"},"content_sha256":"83b7518e9c18ef14e71a54f51909ccff957a72bf6929842ed5998825b135253a","schema_version":"1.0","event_id":"sha256:83b7518e9c18ef14e71a54f51909ccff957a72bf6929842ed5998825b135253a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ODF7Y3OAJNN7XBX2TFZYDAMPAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on Matching Cover Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Jinjiang Yuan, Xiaoxin Song, Xiumei Wang","submitted_at":"2016-12-03T09:03:53Z","abstract_excerpt":"A $k$-matching cover of a graph $G$ is a union of $k$ matchings of $G$ which covers $V(G)$. A matching cover of $G$ is optimal if it consists of the fewest matchings of $G$. In this paper, we present an algorithm for finding an optimal matching cover of a graph on $n$ vertices and $m$ edges in $O(nm)$ time. This algorithm corrects an error of Matching Cover Algorithm in (Xiumei Wang, Xiaoxin Song, Jinjiang Yuan, On matching cover of graphs, Math. Program. Ser. A (2014)147: 499-518)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00943","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-18T00:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YN1/+oMrXMXGMQm///Clr8TNCXYyHzW11R/hPxbxUdPd0zemlXacumyRkWTVzgPb9EnRdtKfmRbcjlcEc+ozDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:46:22.031635Z"},"content_sha256":"7c7bec7ae66716479df9f4434115eedab7ea4a491ff7ecd6ce6f43f4f83f360a","schema_version":"1.0","event_id":"sha256:7c7bec7ae66716479df9f4434115eedab7ea4a491ff7ecd6ce6f43f4f83f360a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK/bundle.json","state_url":"https://pith.science/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK/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-22T07:46:22Z","links":{"resolver":"https://pith.science/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK","bundle":"https://pith.science/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK/bundle.json","state":"https://pith.science/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODF7Y3OAJNN7XBX2TFZYDAMPAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ODF7Y3OAJNN7XBX2TFZYDAMPAK","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":"3739494b0d3107d3dc8447cd4c4ac9345dad4e924fba947e9dd95869cca843ac","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-03T09:03:53Z","title_canon_sha256":"94873560f835c6313cd26263f2fce132213145f2a02adde23a67f50a8fa17b31"},"schema_version":"1.0","source":{"id":"1612.00943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00943","created_at":"2026-05-18T00:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00943v1","created_at":"2026-05-18T00:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00943","created_at":"2026-05-18T00:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"ODF7Y3OAJNN7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ODF7Y3OAJNN7XBX2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ODF7Y3OA","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:7c7bec7ae66716479df9f4434115eedab7ea4a491ff7ecd6ce6f43f4f83f360a","target":"graph","created_at":"2026-05-18T00:55:53Z","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 $k$-matching cover of a graph $G$ is a union of $k$ matchings of $G$ which covers $V(G)$. A matching cover of $G$ is optimal if it consists of the fewest matchings of $G$. In this paper, we present an algorithm for finding an optimal matching cover of a graph on $n$ vertices and $m$ edges in $O(nm)$ time. This algorithm corrects an error of Matching Cover Algorithm in (Xiumei Wang, Xiaoxin Song, Jinjiang Yuan, On matching cover of graphs, Math. Program. Ser. A (2014)147: 499-518).","authors_text":"Jinjiang Yuan, Xiaoxin Song, Xiumei Wang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-03T09:03:53Z","title":"A note on Matching Cover Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00943","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:83b7518e9c18ef14e71a54f51909ccff957a72bf6929842ed5998825b135253a","target":"record","created_at":"2026-05-18T00:55:53Z","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":"3739494b0d3107d3dc8447cd4c4ac9345dad4e924fba947e9dd95869cca843ac","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-03T09:03:53Z","title_canon_sha256":"94873560f835c6313cd26263f2fce132213145f2a02adde23a67f50a8fa17b31"},"schema_version":"1.0","source":{"id":"1612.00943","kind":"arxiv","version":1}},"canonical_sha256":"70cbfc6dc04b5bfb86fa997381818f029c7ddf20c980dde8e0cefea8e8a983d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70cbfc6dc04b5bfb86fa997381818f029c7ddf20c980dde8e0cefea8e8a983d4","first_computed_at":"2026-05-18T00:55:53.768210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:53.768210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xDpezD2ILsU2pv9zXLVqRZEdHr/OTNoWGPfmtdtD4KRgpa0+UxNG9cvyC2+rJ2+Q/V67eHuMRbMpzIZnby00Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:53.768644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b7518e9c18ef14e71a54f51909ccff957a72bf6929842ed5998825b135253a","sha256:7c7bec7ae66716479df9f4434115eedab7ea4a491ff7ecd6ce6f43f4f83f360a"],"state_sha256":"4b72dd7bdc77f5eaacfc00cc35af66921d9d3f9e61b33f45ce21833307437641"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N06bWSplSiV4DVfYPzZzmWA3BGRrorYkHXz9lhVdhvQfD9KlPu4TcwOdgnYXNNajcncmsuY6S7OgCvDnICYyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:46:22.033819Z","bundle_sha256":"cde5bbdcfe25aed57fdbf5421f03a23b50c5dbc21e832ab73cabd60ca54a8041"}}