{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6APLJKTUMAI6MVCAZBADS673OX","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":"141e38937d1a99385dff758c18261ca0c23016958e26f9a602344915cfffef4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:15:29Z","title_canon_sha256":"ade8da8d0ea67983c1ac4e7ae8129beeaefd3e83eb57ab8bf4310a28ade7eb73"},"schema_version":"1.0","source":{"id":"1804.09393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09393","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09393v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09393","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"6APLJKTUMAI6","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6APLJKTUMAI6MVCA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6APLJKTU","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:905bdcfd45e61520d8f51cbf248a8c49b085285f1b20aa3b37d40957e18af011","target":"graph","created_at":"2026-05-18T00:17:31Z","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 present a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some of their generalizations. This improves on [Dragan, WG'97], who proposed such an algorithm for the subclass of (tent,hexahedron)-free distance-hereditary graphs. Furthermore, our result is derived from a more general one that is obtained for b-Matching. In the (unit cost) b-Matching problem, we are given a graph G = (V, E) together with a nonnegative integer capacity b v for every vertex v $\\in$ V. The objective is to assign nonnegative integer weights (x e) e$\\in$E so that: for every v $\\in$ V","authors_text":"Alexandru Popa, Guillaume Ducoffe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:15:29Z","title":"A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09393","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:a2c3f034420c6da3c8c0de0e04bc4797cdd07cbdae1eb34be865d0288cc97019","target":"record","created_at":"2026-05-18T00:17:31Z","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":"141e38937d1a99385dff758c18261ca0c23016958e26f9a602344915cfffef4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:15:29Z","title_canon_sha256":"ade8da8d0ea67983c1ac4e7ae8129beeaefd3e83eb57ab8bf4310a28ade7eb73"},"schema_version":"1.0","source":{"id":"1804.09393","kind":"arxiv","version":1}},"canonical_sha256":"f01eb4aa746011e65440c840397bfb75e95241482511f733f7c9e303b152810b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f01eb4aa746011e65440c840397bfb75e95241482511f733f7c9e303b152810b","first_computed_at":"2026-05-18T00:17:31.962926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:31.962926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8UwlO6YA4Bm6XBpClxaKMSRDKLKS3gvfe/X7OuMZvc0wUOAhjWPQo217SXL1vEkbLMUcu/UQSMvbZu8Ir2WqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:31.963502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2c3f034420c6da3c8c0de0e04bc4797cdd07cbdae1eb34be865d0288cc97019","sha256:905bdcfd45e61520d8f51cbf248a8c49b085285f1b20aa3b37d40957e18af011"],"state_sha256":"86a2ffea24da220f21853e4a3a2999bf1813afb18888c0d4a040277d33c75004"}