{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GTAWRY2IETC6GJMO53PWGCGHM2","short_pith_number":"pith:GTAWRY2I","canonical_record":{"source":{"id":"1804.08016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T19:40:55Z","cross_cats_sorted":[],"title_canon_sha256":"cc592f2ec84a07c49e4bda2ae6039b42b84dbe93260637678da54126a2bd51c1","abstract_canon_sha256":"dbe23668c74d76554fb740fe4730e5b657aa1146a6b864724734f757649aa139"},"schema_version":"1.0"},"canonical_sha256":"34c168e34824c5e3258eeedf6308c766bd0fd2240a1d15704626e62de25c78d4","source":{"kind":"arxiv","id":"1804.08016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08016","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08016v2","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08016","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"GTAWRY2IETC6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GTAWRY2IETC6GJMO","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GTAWRY2I","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GTAWRY2IETC6GJMO53PWGCGHM2","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T19:40:55Z","cross_cats_sorted":[],"title_canon_sha256":"cc592f2ec84a07c49e4bda2ae6039b42b84dbe93260637678da54126a2bd51c1","abstract_canon_sha256":"dbe23668c74d76554fb740fe4730e5b657aa1146a6b864724734f757649aa139"},"schema_version":"1.0"},"canonical_sha256":"34c168e34824c5e3258eeedf6308c766bd0fd2240a1d15704626e62de25c78d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:36.955425Z","signature_b64":"+EM1cNuQFPUpWAjYvuegnBDhH5YF2QsmGcYy1RtKOlEgUp0v7sNM36eTYKokDq6cjYPkuEWeVQWU5iWUG6ezDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34c168e34824c5e3258eeedf6308c766bd0fd2240a1d15704626e62de25c78d4","last_reissued_at":"2026-05-18T00:03:36.954990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:36.954990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08016","source_version":2,"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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJwIxwlFDCfNehKmeks+qaUrksZuWGgEFQ7YNCsEOlT7ZHjGJk5gEu1vgMbZogFdv3L3BYHYstYp+Vo4YWh9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:00.354910Z"},"content_sha256":"ea8383727851608a16b9ac66861de810a5876b6ec4d4015bafb2b7eb44148005","schema_version":"1.0","event_id":"sha256:ea8383727851608a16b9ac66861de810a5876b6ec4d4015bafb2b7eb44148005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GTAWRY2IETC6GJMO53PWGCGHM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ahmed Al-Herz, Alex Pothen, Florin Dobrian, Mahantesh Halappanavar","submitted_at":"2018-04-21T19:40:55Z","abstract_excerpt":"We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the weights of the matched vertices, and we are required to compute a matching of maximum weight. We describe an exact algorithm for MVM with $O(|V|\\, |E|)$ time complexity, and then we design a $2/3$-approximation algorithm for MVM on bipartite graphs by restricting the length of augmenting paths to at most three. The latter algorithm has time complexity $O(|E| + |V| \\log |V|)$.\n  The approximation algorithm solves two MV"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08016","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":""},"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:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ebEeoRsUDdrkJUiY0ql6zUsFoOkdormUc5cUY98M4QC/Fuucj6/I4lF1O6Zsf8YJZNAymaWEG5QJsdY+1WBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:00.355511Z"},"content_sha256":"de03517d8eddf83601f2b3dd373a97081d0c1029026172c7c587f66b7bf32fa6","schema_version":"1.0","event_id":"sha256:de03517d8eddf83601f2b3dd373a97081d0c1029026172c7c587f66b7bf32fa6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTAWRY2IETC6GJMO53PWGCGHM2/bundle.json","state_url":"https://pith.science/pith/GTAWRY2IETC6GJMO53PWGCGHM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTAWRY2IETC6GJMO53PWGCGHM2/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-01T22:22:00Z","links":{"resolver":"https://pith.science/pith/GTAWRY2IETC6GJMO53PWGCGHM2","bundle":"https://pith.science/pith/GTAWRY2IETC6GJMO53PWGCGHM2/bundle.json","state":"https://pith.science/pith/GTAWRY2IETC6GJMO53PWGCGHM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTAWRY2IETC6GJMO53PWGCGHM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GTAWRY2IETC6GJMO53PWGCGHM2","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":"dbe23668c74d76554fb740fe4730e5b657aa1146a6b864724734f757649aa139","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T19:40:55Z","title_canon_sha256":"cc592f2ec84a07c49e4bda2ae6039b42b84dbe93260637678da54126a2bd51c1"},"schema_version":"1.0","source":{"id":"1804.08016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08016","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08016v2","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08016","created_at":"2026-05-18T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"GTAWRY2IETC6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GTAWRY2IETC6GJMO","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GTAWRY2I","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:de03517d8eddf83601f2b3dd373a97081d0c1029026172c7c587f66b7bf32fa6","target":"graph","created_at":"2026-05-18T00:03:36Z","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":"We consider the maximum vertex-weighted matching problem (MVM), in which non-negative weights are assigned to the vertices of a graph, the weight of a matching is the sum of the weights of the matched vertices, and we are required to compute a matching of maximum weight. We describe an exact algorithm for MVM with $O(|V|\\, |E|)$ time complexity, and then we design a $2/3$-approximation algorithm for MVM on bipartite graphs by restricting the length of augmenting paths to at most three. The latter algorithm has time complexity $O(|E| + |V| \\log |V|)$.\n  The approximation algorithm solves two MV","authors_text":"Ahmed Al-Herz, Alex Pothen, Florin Dobrian, Mahantesh Halappanavar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T19:40:55Z","title":"A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08016","kind":"arxiv","version":2},"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:ea8383727851608a16b9ac66861de810a5876b6ec4d4015bafb2b7eb44148005","target":"record","created_at":"2026-05-18T00:03:36Z","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":"dbe23668c74d76554fb740fe4730e5b657aa1146a6b864724734f757649aa139","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-21T19:40:55Z","title_canon_sha256":"cc592f2ec84a07c49e4bda2ae6039b42b84dbe93260637678da54126a2bd51c1"},"schema_version":"1.0","source":{"id":"1804.08016","kind":"arxiv","version":2}},"canonical_sha256":"34c168e34824c5e3258eeedf6308c766bd0fd2240a1d15704626e62de25c78d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34c168e34824c5e3258eeedf6308c766bd0fd2240a1d15704626e62de25c78d4","first_computed_at":"2026-05-18T00:03:36.954990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:36.954990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+EM1cNuQFPUpWAjYvuegnBDhH5YF2QsmGcYy1RtKOlEgUp0v7sNM36eTYKokDq6cjYPkuEWeVQWU5iWUG6ezDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:36.955425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea8383727851608a16b9ac66861de810a5876b6ec4d4015bafb2b7eb44148005","sha256:de03517d8eddf83601f2b3dd373a97081d0c1029026172c7c587f66b7bf32fa6"],"state_sha256":"166e6d50543799e39bf4c50df54afe91600f9ecf349bca2518361cdb5332fb47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8XBRJacCzNZPDyGDKXcPxGtwzhgOkmZqFsLIb71kAM7uAxXlVQH9sIBcdLbFSNdrrqjblw1k87eEUb+ZT89AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:00.357534Z","bundle_sha256":"920728b7dff71425f6934aefda4280d5c59433be267281bd439bf675763870e9"}}