{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ELFBLD722YGOK7QPTKB7DD75UH","short_pith_number":"pith:ELFBLD72","canonical_record":{"source":{"id":"1702.07499","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-24T08:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"6a71632320ac8dd89ddb73e9f63270010bfcd14e04c411ef8c7b7f4bd5874ce0","abstract_canon_sha256":"1e9b6e63eb5a15b084f14196d88c7b033f50b9c480da39157452c643f5c714fc"},"schema_version":"1.0"},"canonical_sha256":"22ca158ffad60ce57e0f9a83f18ffda1e3e74bcfe3b34a990f0988b4e931b72a","source":{"kind":"arxiv","id":"1702.07499","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07499","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07499v3","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07499","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"ELFBLD722YGO","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"ELFBLD722YGOK7QP","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"ELFBLD72","created_at":"2026-07-05T00:03:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ELFBLD722YGOK7QPTKB7DD75UH","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07499","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-24T08:51:13Z","cross_cats_sorted":[],"title_canon_sha256":"6a71632320ac8dd89ddb73e9f63270010bfcd14e04c411ef8c7b7f4bd5874ce0","abstract_canon_sha256":"1e9b6e63eb5a15b084f14196d88c7b033f50b9c480da39157452c643f5c714fc"},"schema_version":"1.0"},"canonical_sha256":"22ca158ffad60ce57e0f9a83f18ffda1e3e74bcfe3b34a990f0988b4e931b72a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:11.444217Z","signature_b64":"g6ljwCYe+1Ok5zoGdGh/nAfDNcwX0NH61hyldAaYxmbDuxLniAkIxdxJuVi1Jsf7SXFYAOjxLNXkmatd8XzcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ca158ffad60ce57e0f9a83f18ffda1e3e74bcfe3b34a990f0988b4e931b72a","last_reissued_at":"2026-07-05T00:03:11.443873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:11.443873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07499","source_version":3,"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-07-05T00:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"erBMptf2HhrvjbSOyduZbajXN535QdTMWpDmCbCPYuVUryVUprEQ0CNV4V5dlwAQtBbrFufm0jlgM5slWOCeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:49:30.322140Z"},"content_sha256":"9e9c610a1f2f56bfc147defad100e35a706c4664801f795549591e4666e3ec01","schema_version":"1.0","event_id":"sha256:9e9c610a1f2f56bfc147defad100e35a706c4664801f795549591e4666e3ec01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ELFBLD722YGOK7QPTKB7DD75UH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cograph Editing: Merging Modules is equivalent to Editing P4's","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":"2017-02-24T08:51:13Z","abstract_excerpt":"The modular decomposition of a graph $G=(V,E)$ does not contain prime modules if and only if $G$ is a cograph, that is, if no quadruple of vertices induces a simple connected path $P_4$. The cograph editing problem consists in inserting into and deleting from $G$ a set $F$ of edges so that $H=(V,E\\Delta F)$ is a cograph and $|F|$ is minimum. This NP-hard combinatorial optimization problem has recently found applications, e.g., in the context of phylogenetics. Efficient heuristics are hence of practical importance. The simple characterization of cographs in terms of their modular decomposition "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07499","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1702.07499/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dx7P4nmLySbSneb4Q+1Ob1VshriRksybGJm0j41HBaPQ6A5o2bh59JPSBWQbWd/WvfMPhwDOTb0KF5CSI8sxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:49:30.323028Z"},"content_sha256":"531b00fa71f73f1f1efe88ca4bd50006c05dbe74aa09b2ad4d2de8b36eff9b7e","schema_version":"1.0","event_id":"sha256:531b00fa71f73f1f1efe88ca4bd50006c05dbe74aa09b2ad4d2de8b36eff9b7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELFBLD722YGOK7QPTKB7DD75UH/bundle.json","state_url":"https://pith.science/pith/ELFBLD722YGOK7QPTKB7DD75UH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELFBLD722YGOK7QPTKB7DD75UH/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-08-13T14:49:30Z","links":{"resolver":"https://pith.science/pith/ELFBLD722YGOK7QPTKB7DD75UH","bundle":"https://pith.science/pith/ELFBLD722YGOK7QPTKB7DD75UH/bundle.json","state":"https://pith.science/pith/ELFBLD722YGOK7QPTKB7DD75UH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELFBLD722YGOK7QPTKB7DD75UH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ELFBLD722YGOK7QPTKB7DD75UH","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":"1e9b6e63eb5a15b084f14196d88c7b033f50b9c480da39157452c643f5c714fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-24T08:51:13Z","title_canon_sha256":"6a71632320ac8dd89ddb73e9f63270010bfcd14e04c411ef8c7b7f4bd5874ce0"},"schema_version":"1.0","source":{"id":"1702.07499","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07499","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07499v3","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07499","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"ELFBLD722YGO","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"ELFBLD722YGOK7QP","created_at":"2026-07-05T00:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"ELFBLD72","created_at":"2026-07-05T00:03:11Z"}],"graph_snapshots":[{"event_id":"sha256:531b00fa71f73f1f1efe88ca4bd50006c05dbe74aa09b2ad4d2de8b36eff9b7e","target":"graph","created_at":"2026-07-05T00:03:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1702.07499/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The modular decomposition of a graph $G=(V,E)$ does not contain prime modules if and only if $G$ is a cograph, that is, if no quadruple of vertices induces a simple connected path $P_4$. The cograph editing problem consists in inserting into and deleting from $G$ a set $F$ of edges so that $H=(V,E\\Delta F)$ is a cograph and $|F|$ is minimum. This NP-hard combinatorial optimization problem has recently found applications, e.g., in the context of phylogenetics. Efficient heuristics are hence of practical importance. The simple characterization of cographs in terms of their modular decomposition ","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":"2017-02-24T08:51:13Z","title":"Cograph Editing: Merging Modules is equivalent to Editing P4's"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07499","kind":"arxiv","version":3},"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:9e9c610a1f2f56bfc147defad100e35a706c4664801f795549591e4666e3ec01","target":"record","created_at":"2026-07-05T00:03:11Z","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":"1e9b6e63eb5a15b084f14196d88c7b033f50b9c480da39157452c643f5c714fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-24T08:51:13Z","title_canon_sha256":"6a71632320ac8dd89ddb73e9f63270010bfcd14e04c411ef8c7b7f4bd5874ce0"},"schema_version":"1.0","source":{"id":"1702.07499","kind":"arxiv","version":3}},"canonical_sha256":"22ca158ffad60ce57e0f9a83f18ffda1e3e74bcfe3b34a990f0988b4e931b72a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22ca158ffad60ce57e0f9a83f18ffda1e3e74bcfe3b34a990f0988b4e931b72a","first_computed_at":"2026-07-05T00:03:11.443873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:03:11.443873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g6ljwCYe+1Ok5zoGdGh/nAfDNcwX0NH61hyldAaYxmbDuxLniAkIxdxJuVi1Jsf7SXFYAOjxLNXkmatd8XzcBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:03:11.444217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07499","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e9c610a1f2f56bfc147defad100e35a706c4664801f795549591e4666e3ec01","sha256:531b00fa71f73f1f1efe88ca4bd50006c05dbe74aa09b2ad4d2de8b36eff9b7e"],"state_sha256":"5174dd0f78687b2418e758c51ec55291df105d62f54cd59acfb6e99168c2dcd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQkNHW03Vv8ngZWzY8vTTUrSTJwHlkdp5gjuZTKyTQvO4ZHVQcLp17iRjj9kvsi2/kj3YyACBSQJJvhmh6tFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:49:30.339251Z","bundle_sha256":"d5460272c84b19e14058e4ae4452fddad3540c396f15e4601421db14228e6fe5"}}