{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G6QVJNPIDW67FQMNAPEFE5YME7","short_pith_number":"pith:G6QVJNPI","canonical_record":{"source":{"id":"1804.09407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"9af77e12cf32cc37d5f56b168efc56bbb6b32f9d758d96097cc94e81f76b580e","abstract_canon_sha256":"37ec00616711bb1b366b9bd84d832fb9cdaeec1dec39d35e0b9c27e32198391c"},"schema_version":"1.0"},"canonical_sha256":"37a154b5e81dbdf2c18d03c852770c27c97b41aa501e22e2bbb9883a93cde1df","source":{"kind":"arxiv","id":"1804.09407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09407","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09407v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09407","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"G6QVJNPIDW67","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G6QVJNPIDW67FQMN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G6QVJNPI","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G6QVJNPIDW67FQMNAPEFE5YME7","target":"record","payload":{"canonical_record":{"source":{"id":"1804.09407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"9af77e12cf32cc37d5f56b168efc56bbb6b32f9d758d96097cc94e81f76b580e","abstract_canon_sha256":"37ec00616711bb1b366b9bd84d832fb9cdaeec1dec39d35e0b9c27e32198391c"},"schema_version":"1.0"},"canonical_sha256":"37a154b5e81dbdf2c18d03c852770c27c97b41aa501e22e2bbb9883a93cde1df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.904990Z","signature_b64":"Z8p3n4upe/aDvp7WUX8ZxBbtchuAMzyBWjnHnAS27ctQJ9+0SMOPIHJC8fZ2fzdpfLfPakw38I8MwQBoAhuABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a154b5e81dbdf2c18d03c852770c27c97b41aa501e22e2bbb9883a93cde1df","last_reissued_at":"2026-05-18T00:17:31.904302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.904302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.09407","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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tCUcwDE3tONQ/NO51xBYeAEYJMPHy+lurMqdxPv8vUINXkwrwS1ILj55wZAOYd7fkypQCKi4SRdFfrtEC6gpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:58:56.324174Z"},"content_sha256":"aa028d5dba5abe35ef0a75cfd2dd52516803f0fc456d063e943776f100d89103","schema_version":"1.0","event_id":"sha256:aa028d5dba5abe35ef0a75cfd2dd52516803f0fc456d063e943776f100d89103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G6QVJNPIDW67FQMNAPEFE5YME7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes","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:51:46Z","abstract_excerpt":"We address the following general question: given a graph class C on which we can solve Maximum Matching in (quasi) linear time, does the same hold true for the class of graphs that can be modularly decomposed into C ? A major difficulty in this task is that the Maximum Matching problem is not preserved by quotient, thereby making difficult to exploit the structural properties of the quotient subgraphs of the modular decomposition. So far, we are only aware of a recent framework in [Coudert et al., SODA'18] that only applies when the quotient subgraphs have bounded order and/or under additional"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09407","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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueJTyLxXTuNMng1xUJTLbHjuscQ0UIkYmRilmKwE3msSq4GwWEW+5NJE2pDnlUyF1Ayt6BllsQAem9UTCq7AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T08:58:56.324536Z"},"content_sha256":"e7b10bcdb733bc9df47b85a9e24f5d7f2bcfba5828384ad8cc84f80f582f55d7","schema_version":"1.0","event_id":"sha256:e7b10bcdb733bc9df47b85a9e24f5d7f2bcfba5828384ad8cc84f80f582f55d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6QVJNPIDW67FQMNAPEFE5YME7/bundle.json","state_url":"https://pith.science/pith/G6QVJNPIDW67FQMNAPEFE5YME7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6QVJNPIDW67FQMNAPEFE5YME7/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-07-03T08:58:56Z","links":{"resolver":"https://pith.science/pith/G6QVJNPIDW67FQMNAPEFE5YME7","bundle":"https://pith.science/pith/G6QVJNPIDW67FQMNAPEFE5YME7/bundle.json","state":"https://pith.science/pith/G6QVJNPIDW67FQMNAPEFE5YME7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6QVJNPIDW67FQMNAPEFE5YME7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G6QVJNPIDW67FQMNAPEFE5YME7","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":"37ec00616711bb1b366b9bd84d832fb9cdaeec1dec39d35e0b9c27e32198391c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:51:46Z","title_canon_sha256":"9af77e12cf32cc37d5f56b168efc56bbb6b32f9d758d96097cc94e81f76b580e"},"schema_version":"1.0","source":{"id":"1804.09407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.09407","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1804.09407v1","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09407","created_at":"2026-05-18T00:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"G6QVJNPIDW67","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G6QVJNPIDW67FQMN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G6QVJNPI","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:e7b10bcdb733bc9df47b85a9e24f5d7f2bcfba5828384ad8cc84f80f582f55d7","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 address the following general question: given a graph class C on which we can solve Maximum Matching in (quasi) linear time, does the same hold true for the class of graphs that can be modularly decomposed into C ? A major difficulty in this task is that the Maximum Matching problem is not preserved by quotient, thereby making difficult to exploit the structural properties of the quotient subgraphs of the modular decomposition. So far, we are only aware of a recent framework in [Coudert et al., SODA'18] that only applies when the quotient subgraphs have bounded order and/or under additional","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:51:46Z","title":"The use of a pruned modular decomposition for Maximum Matching algorithms on some graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09407","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:aa028d5dba5abe35ef0a75cfd2dd52516803f0fc456d063e943776f100d89103","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":"37ec00616711bb1b366b9bd84d832fb9cdaeec1dec39d35e0b9c27e32198391c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-25T07:51:46Z","title_canon_sha256":"9af77e12cf32cc37d5f56b168efc56bbb6b32f9d758d96097cc94e81f76b580e"},"schema_version":"1.0","source":{"id":"1804.09407","kind":"arxiv","version":1}},"canonical_sha256":"37a154b5e81dbdf2c18d03c852770c27c97b41aa501e22e2bbb9883a93cde1df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37a154b5e81dbdf2c18d03c852770c27c97b41aa501e22e2bbb9883a93cde1df","first_computed_at":"2026-05-18T00:17:31.904302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:31.904302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z8p3n4upe/aDvp7WUX8ZxBbtchuAMzyBWjnHnAS27ctQJ9+0SMOPIHJC8fZ2fzdpfLfPakw38I8MwQBoAhuABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:31.904990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.09407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa028d5dba5abe35ef0a75cfd2dd52516803f0fc456d063e943776f100d89103","sha256:e7b10bcdb733bc9df47b85a9e24f5d7f2bcfba5828384ad8cc84f80f582f55d7"],"state_sha256":"013cbcdeb6abe63fb8142140bce4bdbe02ac8f7d98f30348d403e75a9c0d73d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xi/P1pkGIM/c7fa6Tx+Hc7ns5Boezn1ch1rV03K81jirPdqvhRIkj9BhjFxdO/y08672sq0wCynpbrzDNqdiBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T08:58:56.326545Z","bundle_sha256":"ba17a806b0d88be6e7aabae62d12692c5ab939a037343742350477c5af263231"}}