{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PBMV5Q2AYWJXEHK767YENKBIAV","short_pith_number":"pith:PBMV5Q2A","schema_version":"1.0","canonical_sha256":"78595ec340c593721d5ff7f046a8280557f1128aca0189f328949bc54bb19f25","source":{"kind":"arxiv","id":"1509.06983","version":2},"attestation_state":"computed","paper":{"title":"Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Adrian Fritz, Marc Hellmuth, Nicolas Wieseke, Peter F. Stadler","submitted_at":"2015-09-23T13:54:15Z","abstract_excerpt":"Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at most $k$ edge additions and deletions that transform $G$ into a cograph. This combinatorial optimization problem is NP-hard. It has, recently found applications in the context of phylogenetics, hence good heuristics are of practical importance.\n  It is well-known that the cograph editing problem can be solved independently on the so-called strong prime modules of the modular decomposition of $G$. We show here that editing the induced $P_4$'s o"},"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":"1509.06983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-23T13:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"c2be1a2349c161fdc6620f36546738ad4192ce765c061e2fd6618df190b86464","abstract_canon_sha256":"2468503b37fb4e1c0cbc409ef175d3c6bd265104b5cae8e206c66776c63a837a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:09.785606Z","signature_b64":"G3DXSZu7EfZUeh3nGDJgPWwSmVqskMSjJDIZWnSE6o2L/BZ5csJpbPYblpe7b2COU3wSJqGLti9JsLReInD6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78595ec340c593721d5ff7f046a8280557f1128aca0189f328949bc54bb19f25","last_reissued_at":"2026-05-18T01:32:09.784884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:09.784884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Adrian Fritz, Marc Hellmuth, Nicolas Wieseke, Peter F. Stadler","submitted_at":"2015-09-23T13:54:15Z","abstract_excerpt":"Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at most $k$ edge additions and deletions that transform $G$ into a cograph. This combinatorial optimization problem is NP-hard. It has, recently found applications in the context of phylogenetics, hence good heuristics are of practical importance.\n  It is well-known that the cograph editing problem can be solved independently on the so-called strong prime modules of the modular decomposition of $G$. We show here that editing the induced $P_4$'s o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06983","kind":"arxiv","version":2},"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":"1509.06983","created_at":"2026-05-18T01:32:09.784998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06983v2","created_at":"2026-05-18T01:32:09.784998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06983","created_at":"2026-05-18T01:32:09.784998+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBMV5Q2AYWJX","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBMV5Q2AYWJXEHK7","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBMV5Q2A","created_at":"2026-05-18T12:29:37.295048+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/PBMV5Q2AYWJXEHK767YENKBIAV","json":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV.json","graph_json":"https://pith.science/api/pith-number/PBMV5Q2AYWJXEHK767YENKBIAV/graph.json","events_json":"https://pith.science/api/pith-number/PBMV5Q2AYWJXEHK767YENKBIAV/events.json","paper":"https://pith.science/paper/PBMV5Q2A"},"agent_actions":{"view_html":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV","download_json":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV.json","view_paper":"https://pith.science/paper/PBMV5Q2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06983&json=true","fetch_graph":"https://pith.science/api/pith-number/PBMV5Q2AYWJXEHK767YENKBIAV/graph.json","fetch_events":"https://pith.science/api/pith-number/PBMV5Q2AYWJXEHK767YENKBIAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/action/storage_attestation","attest_author":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/action/author_attestation","sign_citation":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/action/citation_signature","submit_replication":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/action/replication_record"}},"created_at":"2026-05-18T01:32:09.784998+00:00","updated_at":"2026-05-18T01:32:09.784998+00:00"}