{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PBMV5Q2AYWJXEHK767YENKBIAV","short_pith_number":"pith:PBMV5Q2A","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"},"canonical_sha256":"78595ec340c593721d5ff7f046a8280557f1128aca0189f328949bc54bb19f25","source":{"kind":"arxiv","id":"1509.06983","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06983","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06983v2","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06983","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"PBMV5Q2AYWJX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PBMV5Q2AYWJXEHK7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PBMV5Q2A","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PBMV5Q2AYWJXEHK767YENKBIAV","target":"record","payload":{"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"},"canonical_sha256":"78595ec340c593721d5ff7f046a8280557f1128aca0189f328949bc54bb19f25","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"},"source_kind":"arxiv","source_id":"1509.06983","source_version":2,"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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1vGLQhcs5XPuf9pxJtOh0uaGCwj92F2zRX7KWvSNdzDL4TkR0/ey2s2ZfOPG8ZthXeQHIXobRFrHqo0D2qwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:25:09.207207Z"},"content_sha256":"121bb8beee2a8b0f4751a45121961bc1646f170696b6343fc7d11fbe3ee752d0","schema_version":"1.0","event_id":"sha256:121bb8beee2a8b0f4751a45121961bc1646f170696b6343fc7d11fbe3ee752d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PBMV5Q2AYWJXEHK767YENKBIAV","target":"graph","payload":{"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"},"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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7y0C3ms9WUDQxeSWsflnk8jR66IslbafBPKr/N1HM6l5OweJ6k0IyU7fflu6/dVCmi4sTJYjj6vlGHDEQR3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:25:09.207901Z"},"content_sha256":"84641f634a6446ea97e7833ab0d88d65a59552a33f5cc5413db6fc81c553e874","schema_version":"1.0","event_id":"sha256:84641f634a6446ea97e7833ab0d88d65a59552a33f5cc5413db6fc81c553e874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/bundle.json","state_url":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBMV5Q2AYWJXEHK767YENKBIAV/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-29T17:25:09Z","links":{"resolver":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV","bundle":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/bundle.json","state":"https://pith.science/pith/PBMV5Q2AYWJXEHK767YENKBIAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBMV5Q2AYWJXEHK767YENKBIAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PBMV5Q2AYWJXEHK767YENKBIAV","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":"2468503b37fb4e1c0cbc409ef175d3c6bd265104b5cae8e206c66776c63a837a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-23T13:54:15Z","title_canon_sha256":"c2be1a2349c161fdc6620f36546738ad4192ce765c061e2fd6618df190b86464"},"schema_version":"1.0","source":{"id":"1509.06983","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06983","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06983v2","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06983","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"PBMV5Q2AYWJX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PBMV5Q2AYWJXEHK7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PBMV5Q2A","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:84641f634a6446ea97e7833ab0d88d65a59552a33f5cc5413db6fc81c553e874","target":"graph","created_at":"2026-05-18T01:32:09Z","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":"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","authors_text":"Adrian Fritz, Marc Hellmuth, Nicolas Wieseke, Peter F. Stadler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-23T13:54:15Z","title":"Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06983","kind":"arxiv","version":2},"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:121bb8beee2a8b0f4751a45121961bc1646f170696b6343fc7d11fbe3ee752d0","target":"record","created_at":"2026-05-18T01:32:09Z","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":"2468503b37fb4e1c0cbc409ef175d3c6bd265104b5cae8e206c66776c63a837a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-09-23T13:54:15Z","title_canon_sha256":"c2be1a2349c161fdc6620f36546738ad4192ce765c061e2fd6618df190b86464"},"schema_version":"1.0","source":{"id":"1509.06983","kind":"arxiv","version":2}},"canonical_sha256":"78595ec340c593721d5ff7f046a8280557f1128aca0189f328949bc54bb19f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78595ec340c593721d5ff7f046a8280557f1128aca0189f328949bc54bb19f25","first_computed_at":"2026-05-18T01:32:09.784884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:09.784884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G3DXSZu7EfZUeh3nGDJgPWwSmVqskMSjJDIZWnSE6o2L/BZ5csJpbPYblpe7b2COU3wSJqGLti9JsLReInD6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:09.785606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06983","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:121bb8beee2a8b0f4751a45121961bc1646f170696b6343fc7d11fbe3ee752d0","sha256:84641f634a6446ea97e7833ab0d88d65a59552a33f5cc5413db6fc81c553e874"],"state_sha256":"970e22a13ebcbfaca4f2cff21efc05d71454a09f16111e7811edaaa376b30103"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGL5S4B0E3BeC+OdDZCibrPsH6cNB31bAmVy4TokUvnBFbiXbya1y/BL4J9nXPODTnYVvth8xS45uAgThV/GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:25:09.211192Z","bundle_sha256":"26448579bc4dc8f56faa3e34e9889ea6c3a1f24f2bec4e61ca9e4d727ca113ff"}}