{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:G4LMIF43SXLFBVKFQHV5HMK2NE","short_pith_number":"pith:G4LMIF43","canonical_record":{"source":{"id":"1402.2903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-12T17:22:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0963a761f0aac99624e3a6e4f4f7d04439d34d1b83f437da1f58e49155189ef","abstract_canon_sha256":"ea1cec4a8f76d730cdc095eddaaccf808c6a003a5d849a12aaf8c55c1303e90d"},"schema_version":"1.0"},"canonical_sha256":"3716c4179b95d650d54581ebd3b15a692a4751f023e18a77c932f3ec52b33a87","source":{"kind":"arxiv","id":"1402.2903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2903","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2903v1","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2903","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"pith_short_12","alias_value":"G4LMIF43SXLF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G4LMIF43SXLFBVKF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G4LMIF43","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:G4LMIF43SXLFBVKFQHV5HMK2NE","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-12T17:22:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0963a761f0aac99624e3a6e4f4f7d04439d34d1b83f437da1f58e49155189ef","abstract_canon_sha256":"ea1cec4a8f76d730cdc095eddaaccf808c6a003a5d849a12aaf8c55c1303e90d"},"schema_version":"1.0"},"canonical_sha256":"3716c4179b95d650d54581ebd3b15a692a4751f023e18a77c932f3ec52b33a87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:16.973956Z","signature_b64":"/NCHpF/BVcxBh5y1CoOFSmTAznP7vNz72xVOD4sgjP3FED8Ll9HvH51Iqz8qwmWswByf8boDBYRhUjFd1dd+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3716c4179b95d650d54581ebd3b15a692a4751f023e18a77c932f3ec52b33a87","last_reissued_at":"2026-05-18T02:59:16.973288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:16.973288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2903","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-18T02:59:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kITqCf8XXjRwFvX2UaOadjTe2UOHueQ8MsrvoSqmIChSncvODKPIF572BY8aXFNNOsWlQNZSZUvnsnb9AqeoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:45:17.399650Z"},"content_sha256":"fff8ff13c15b9a4cda416858efea2983a4378b4559f6950375ae308eb7c680d8","schema_version":"1.0","event_id":"sha256:fff8ff13c15b9a4cda416858efea2983a4378b4559f6950375ae308eb7c680d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:G4LMIF43SXLFBVKFQHV5HMK2NE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2014-02-12T17:22:46Z","abstract_excerpt":"Let alpha(G) denote the maximum size of an independent set of vertices and mu(G) be the cardinality of a maximum matching in a graph G. A matching saturating all the vertices is perfect. If alpha(G) + mu(G) equals the number of vertices of G, then it is called a Konig-Egervary graph. A graph is unicyclic if it has a unique cycle.\n  In 2010, Bartha conjectured that a unique perfect matching, if it exists, can be found in O(m) time, where m is the number of edges.\n  In this paper we validate this conjecture for Konig-Egervary graphs and unicylic graphs. We propose a variation of Karp-Sipser leaf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2903","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-18T02:59:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6StmFH/Sc9qe20E11uZM5hTYlzM+JP16QdCCo/cKE2tflbSYSB/OEKiRcoQF4eo3oxU+aOdYWc2gCHtsvG5PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:45:17.400257Z"},"content_sha256":"83b83010bd7cde309c11a23d51d180cfd18f157d996e206f74a96f347dc78221","schema_version":"1.0","event_id":"sha256:83b83010bd7cde309c11a23d51d180cfd18f157d996e206f74a96f347dc78221"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4LMIF43SXLFBVKFQHV5HMK2NE/bundle.json","state_url":"https://pith.science/pith/G4LMIF43SXLFBVKFQHV5HMK2NE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4LMIF43SXLFBVKFQHV5HMK2NE/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-05-30T15:45:17Z","links":{"resolver":"https://pith.science/pith/G4LMIF43SXLFBVKFQHV5HMK2NE","bundle":"https://pith.science/pith/G4LMIF43SXLFBVKFQHV5HMK2NE/bundle.json","state":"https://pith.science/pith/G4LMIF43SXLFBVKFQHV5HMK2NE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4LMIF43SXLFBVKFQHV5HMK2NE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:G4LMIF43SXLFBVKFQHV5HMK2NE","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":"ea1cec4a8f76d730cdc095eddaaccf808c6a003a5d849a12aaf8c55c1303e90d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-12T17:22:46Z","title_canon_sha256":"a0963a761f0aac99624e3a6e4f4f7d04439d34d1b83f437da1f58e49155189ef"},"schema_version":"1.0","source":{"id":"1402.2903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2903","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2903v1","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2903","created_at":"2026-05-18T02:59:16Z"},{"alias_kind":"pith_short_12","alias_value":"G4LMIF43SXLF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"G4LMIF43SXLFBVKF","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"G4LMIF43","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:83b83010bd7cde309c11a23d51d180cfd18f157d996e206f74a96f347dc78221","target":"graph","created_at":"2026-05-18T02:59:16Z","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":"Let alpha(G) denote the maximum size of an independent set of vertices and mu(G) be the cardinality of a maximum matching in a graph G. A matching saturating all the vertices is perfect. If alpha(G) + mu(G) equals the number of vertices of G, then it is called a Konig-Egervary graph. A graph is unicyclic if it has a unique cycle.\n  In 2010, Bartha conjectured that a unique perfect matching, if it exists, can be found in O(m) time, where m is the number of edges.\n  In this paper we validate this conjecture for Konig-Egervary graphs and unicylic graphs. We propose a variation of Karp-Sipser leaf","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-12T17:22:46Z","title":"Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2903","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:fff8ff13c15b9a4cda416858efea2983a4378b4559f6950375ae308eb7c680d8","target":"record","created_at":"2026-05-18T02:59:16Z","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":"ea1cec4a8f76d730cdc095eddaaccf808c6a003a5d849a12aaf8c55c1303e90d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-12T17:22:46Z","title_canon_sha256":"a0963a761f0aac99624e3a6e4f4f7d04439d34d1b83f437da1f58e49155189ef"},"schema_version":"1.0","source":{"id":"1402.2903","kind":"arxiv","version":1}},"canonical_sha256":"3716c4179b95d650d54581ebd3b15a692a4751f023e18a77c932f3ec52b33a87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3716c4179b95d650d54581ebd3b15a692a4751f023e18a77c932f3ec52b33a87","first_computed_at":"2026-05-18T02:59:16.973288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:16.973288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NCHpF/BVcxBh5y1CoOFSmTAznP7vNz72xVOD4sgjP3FED8Ll9HvH51Iqz8qwmWswByf8boDBYRhUjFd1dd+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:16.973956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fff8ff13c15b9a4cda416858efea2983a4378b4559f6950375ae308eb7c680d8","sha256:83b83010bd7cde309c11a23d51d180cfd18f157d996e206f74a96f347dc78221"],"state_sha256":"1159921264df9ea0d39aa8d9f32882fa038694eef35e4d8fb1d84366fbad1ce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qoZz5hLzsRLFLF0zi1dd8ZlxnyDwmXwWvsIyxq5MUG/I0y4aAn9NUVqNk2pyFw2pBU88pYEdaFi0dRftjV0yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:45:17.402899Z","bundle_sha256":"df737d48bc4fba807f8dccf8bc14e7a0c738957c68115b623abd523e14c0bbe6"}}