{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VGXDATHM2R4EYYJMC6VJA4DJ32","short_pith_number":"pith:VGXDATHM","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"},"canonical_sha256":"a9ae304cecd4784c612c17aa907069de8e8bbd3a10716ac772fa99637e68aef5","source":{"kind":"arxiv","id":"1806.00791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00791","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00791v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00791","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"VGXDATHM2R4E","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGXDATHM2R4EYYJM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGXDATHM","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VGXDATHM2R4EYYJMC6VJA4DJ32","target":"record","payload":{"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"},"canonical_sha256":"a9ae304cecd4784c612c17aa907069de8e8bbd3a10716ac772fa99637e68aef5","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"},"source_kind":"arxiv","source_id":"1806.00791","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-18T00:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kG9UcGrEnFSpeQq+eurtUPkXp7TldAx9Q8CAQGUA0nnTNmZ+ArRtO5YyqGIzPTYIo4FYyInRZkdzrSpx0NhXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:56:18.418019Z"},"content_sha256":"48a12ec0446954c6278fd57914e21c95577287eab3425a4132a2bcd9c3789e90","schema_version":"1.0","event_id":"sha256:48a12ec0446954c6278fd57914e21c95577287eab3425a4132a2bcd9c3789e90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VGXDATHM2R4EYYJMC6VJA4DJ32","target":"graph","payload":{"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"},"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olR4qAEJKxPtIXjKN4j2qAg0aPJ8M4nBMcE1FjkVDp7zV4YZ8ExgnNFSYAb5oQ2DIK7N0FmxcxW02mpS3lxEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:56:18.418379Z"},"content_sha256":"0df8b5677ad38f86699a00b11e09c97dc72bc0cf1022df597dd41121c5afcfe2","schema_version":"1.0","event_id":"sha256:0df8b5677ad38f86699a00b11e09c97dc72bc0cf1022df597dd41121c5afcfe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/bundle.json","state_url":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/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-28T13:56:18Z","links":{"resolver":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32","bundle":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/bundle.json","state":"https://pith.science/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGXDATHM2R4EYYJMC6VJA4DJ32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VGXDATHM2R4EYYJMC6VJA4DJ32","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":"fce27f8c96e921b0db0808baecc350f8e8e525abd9ceed483269f44156543d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-03T13:21:55Z","title_canon_sha256":"26191658ddfdbc100d1a769d24e043c6a332d50df4ddd34d3d6c995a9ca2fc1e"},"schema_version":"1.0","source":{"id":"1806.00791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00791","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00791v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00791","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"VGXDATHM2R4E","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VGXDATHM2R4EYYJM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VGXDATHM","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:0df8b5677ad38f86699a00b11e09c97dc72bc0cf1022df597dd41121c5afcfe2","target":"graph","created_at":"2026-05-18T00:14:18Z","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":"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","authors_text":"Benjamin Hellouin de Menibus, Takeaki Uno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-03T13:21:55Z","title":"Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00791","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:48a12ec0446954c6278fd57914e21c95577287eab3425a4132a2bcd9c3789e90","target":"record","created_at":"2026-05-18T00:14:18Z","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":"fce27f8c96e921b0db0808baecc350f8e8e525abd9ceed483269f44156543d28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-03T13:21:55Z","title_canon_sha256":"26191658ddfdbc100d1a769d24e043c6a332d50df4ddd34d3d6c995a9ca2fc1e"},"schema_version":"1.0","source":{"id":"1806.00791","kind":"arxiv","version":1}},"canonical_sha256":"a9ae304cecd4784c612c17aa907069de8e8bbd3a10716ac772fa99637e68aef5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9ae304cecd4784c612c17aa907069de8e8bbd3a10716ac772fa99637e68aef5","first_computed_at":"2026-05-18T00:14:18.397235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:18.397235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sonTDr21tl/ROr7k6tMpOr9KTR+j31bqn+B/QOtSr2gi097C4/aiaRH51gUIzXoN756EPmkR/2WRjS8K0uCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:18.397743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a12ec0446954c6278fd57914e21c95577287eab3425a4132a2bcd9c3789e90","sha256:0df8b5677ad38f86699a00b11e09c97dc72bc0cf1022df597dd41121c5afcfe2"],"state_sha256":"3c940a704022b5c812e903544cabf4808cf171da7ea65cabf679c101b0a1cc41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/cpni6lzhICAcDO7b4WbVKnDkez+grk2UCmOuYZ8GXkO+NAMKMKLoXEX1aUpp2a1zUn+V0wdTx0glfSFvHkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:56:18.420370Z","bundle_sha256":"2062bffcd6e79c24dfb612c9eaa4804b2e467c867b652740c1371bf94827921d"}}