{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6APLJKTUMAI6MVCAZBADS673OX","short_pith_number":"pith:6APLJKTU","schema_version":"1.0","canonical_sha256":"f01eb4aa746011e65440c840397bfb75e95241482511f733f7c9e303b152810b","source":{"kind":"arxiv","id":"1804.09393","version":1},"attestation_state":"computed","paper":{"title":"A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Guillaume Ducoffe","submitted_at":"2018-04-25T07:15:29Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.09393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:15:29Z","cross_cats_sorted":[],"title_canon_sha256":"ade8da8d0ea67983c1ac4e7ae8129beeaefd3e83eb57ab8bf4310a28ade7eb73","abstract_canon_sha256":"141e38937d1a99385dff758c18261ca0c23016958e26f9a602344915cfffef4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.963502Z","signature_b64":"8UwlO6YA4Bm6XBpClxaKMSRDKLKS3gvfe/X7OuMZvc0wUOAhjWPQo217SXL1vEkbLMUcu/UQSMvbZu8Ir2WqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01eb4aa746011e65440c840397bfb75e95241482511f733f7c9e303b152810b","last_reissued_at":"2026-05-18T00:17:31.962926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.962926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Guillaume Ducoffe","submitted_at":"2018-04-25T07:15:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09393","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.09393","created_at":"2026-05-18T00:17:31.963026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09393v1","created_at":"2026-05-18T00:17:31.963026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09393","created_at":"2026-05-18T00:17:31.963026+00:00"},{"alias_kind":"pith_short_12","alias_value":"6APLJKTUMAI6","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6APLJKTUMAI6MVCA","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6APLJKTU","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX","json":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX.json","graph_json":"https://pith.science/api/pith-number/6APLJKTUMAI6MVCAZBADS673OX/graph.json","events_json":"https://pith.science/api/pith-number/6APLJKTUMAI6MVCAZBADS673OX/events.json","paper":"https://pith.science/paper/6APLJKTU"},"agent_actions":{"view_html":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX","download_json":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX.json","view_paper":"https://pith.science/paper/6APLJKTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09393&json=true","fetch_graph":"https://pith.science/api/pith-number/6APLJKTUMAI6MVCAZBADS673OX/graph.json","fetch_events":"https://pith.science/api/pith-number/6APLJKTUMAI6MVCAZBADS673OX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX/action/storage_attestation","attest_author":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX/action/author_attestation","sign_citation":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX/action/citation_signature","submit_replication":"https://pith.science/pith/6APLJKTUMAI6MVCAZBADS673OX/action/replication_record"}},"created_at":"2026-05-18T00:17:31.963026+00:00","updated_at":"2026-05-18T00:17:31.963026+00:00"}