{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VGXDATHM2R4EYYJMC6VJA4DJ32","short_pith_number":"pith:VGXDATHM","schema_version":"1.0","canonical_sha256":"a9ae304cecd4784c612c17aa907069de8e8bbd3a10716ac772fa99637e68aef5","source":{"kind":"arxiv","id":"1806.00791","version":1},"attestation_state":"computed","paper":{"title":"Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Benjamin Hellouin de Menibus, Takeaki Uno","submitted_at":"2018-06-03T13:21:55Z","abstract_excerpt":"In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matching-cover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, we develop a way to classify the path matchings in a polynomial number of equivalent classes. Using these, we develop dynamic programing algorithms that run in polynomial time of the graph size, but in e"},"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":"1806.00791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-03T13:21:55Z","cross_cats_sorted":[],"title_canon_sha256":"26191658ddfdbc100d1a769d24e043c6a332d50df4ddd34d3d6c995a9ca2fc1e","abstract_canon_sha256":"fce27f8c96e921b0db0808baecc350f8e8e525abd9ceed483269f44156543d28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.397743Z","signature_b64":"7sonTDr21tl/ROr7k6tMpOr9KTR+j31bqn+B/QOtSr2gi097C4/aiaRH51gUIzXoN756EPmkR/2WRjS8K0uCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9ae304cecd4784c612c17aa907069de8e8bbd3a10716ac772fa99637e68aef5","last_reissued_at":"2026-05-18T00:14:18.397235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.397235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Benjamin Hellouin de Menibus, Takeaki Uno","submitted_at":"2018-06-03T13:21:55Z","abstract_excerpt":"In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matching-cover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, we develop a way to classify the path matchings in a polynomial number of equivalent classes. Using these, we develop dynamic programing algorithms that run in polynomial time of the graph size, but in e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00791","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":"1806.00791","created_at":"2026-05-18T00:14:18.397348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00791v1","created_at":"2026-05-18T00:14:18.397348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00791","created_at":"2026-05-18T00:14:18.397348+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGXDATHM2R4E","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGXDATHM2R4EYYJM","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGXDATHM","created_at":"2026-05-18T12:32:59.047623+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/VGXDATHM2R4EYYJMC6VJA4DJ32","json":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32.json","graph_json":"https://pith.science/api/pith-number/VGXDATHM2R4EYYJMC6VJA4DJ32/graph.json","events_json":"https://pith.science/api/pith-number/VGXDATHM2R4EYYJMC6VJA4DJ32/events.json","paper":"https://pith.science/paper/VGXDATHM"},"agent_actions":{"view_html":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32","download_json":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32.json","view_paper":"https://pith.science/paper/VGXDATHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00791&json=true","fetch_graph":"https://pith.science/api/pith-number/VGXDATHM2R4EYYJMC6VJA4DJ32/graph.json","fetch_events":"https://pith.science/api/pith-number/VGXDATHM2R4EYYJMC6VJA4DJ32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/action/storage_attestation","attest_author":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/action/author_attestation","sign_citation":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/action/citation_signature","submit_replication":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/action/replication_record"}},"created_at":"2026-05-18T00:14:18.397348+00:00","updated_at":"2026-05-18T00:14:18.397348+00:00"}