{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PCXK2C3WWCMS74ELZS5XPL3ADL","short_pith_number":"pith:PCXK2C3W","canonical_record":{"source":{"id":"1711.05839","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T22:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"4858ac6acf7dfad2306133e2cfe89cef534456fdc3cca06deb0af8fa55c2bc08","abstract_canon_sha256":"8089679a5aff3d0cdf64b5b81127160bbfbfa63a18eb869c6bc166b9c50d704c"},"schema_version":"1.0"},"canonical_sha256":"78aead0b76b0992ff08bccbb77af601ac8012036933a357957cbbbd765a76d7d","source":{"kind":"arxiv","id":"1711.05839","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05839","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05839v3","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05839","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"PCXK2C3WWCMS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCXK2C3WWCMS74EL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCXK2C3W","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PCXK2C3WWCMS74ELZS5XPL3ADL","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05839","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T22:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"4858ac6acf7dfad2306133e2cfe89cef534456fdc3cca06deb0af8fa55c2bc08","abstract_canon_sha256":"8089679a5aff3d0cdf64b5b81127160bbfbfa63a18eb869c6bc166b9c50d704c"},"schema_version":"1.0"},"canonical_sha256":"78aead0b76b0992ff08bccbb77af601ac8012036933a357957cbbbd765a76d7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:17.921420Z","signature_b64":"bS9BUeD3jPlvFMOxWo0F+lKoEW8lFY2rDVW/DDplV39n9tDOTUDE3828xtyFYOyXtit0nyWJCWrXEOCFFLktBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78aead0b76b0992ff08bccbb77af601ac8012036933a357957cbbbd765a76d7d","last_reissued_at":"2026-05-18T00:26:17.920793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:17.920793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05839","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-05-18T00:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBfsltzVruMHx/l1z5taqbBuB8mmjizDKMrYFJkYDhYKuFN2La1JXML96LbPTWaPPXqk5NKxvQ8v/y/Y66XyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:31:15.643632Z"},"content_sha256":"6ac0f8c164c52430be25a4d7976a921c914bdc7d71bc68a61a693de85e94ed83","schema_version":"1.0","event_id":"sha256:6ac0f8c164c52430be25a4d7976a921c914bdc7d71bc68a61a693de85e94ed83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PCXK2C3WWCMS74ELZS5XPL3ADL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact and heuristic algorithms for Cograph Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcus Ludwig, Sebastian B\\\"ocker, W. Timothy J. White","submitted_at":"2017-11-15T22:56:24Z","abstract_excerpt":"We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an $n$-vertex graph that runs in $O(3^n n)$ time and uses $O(2^n)$ space. In this problem, we are given a graph $G = (V, E)$ and the task is to find a smallest possible set $F \\subseteq V \\times V$ of vertex pairs such that $(V, E \\bigtriangleup F)$ is a cograph (or $P_4$-free graph), where $\\bigtriangleup$ represents the symmetric difference operator. We also describe a technique for speeding up the performance of the algorithm in practice. Additionally, we present a heuristic for solving the Cogra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05839","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":""},"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:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4oKQWCoj4EddVoZee6cxxBADVJ4llgoRWmKx1z9yXEUuS2+aPQ5IQwQLbAgZWI04A+SZwoNBrfzru5OnCyZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:31:15.644292Z"},"content_sha256":"d97276f3c22d16cd9b767d726d4a7e2a30ebfa5b0a627db274265f85d398f910","schema_version":"1.0","event_id":"sha256:d97276f3c22d16cd9b767d726d4a7e2a30ebfa5b0a627db274265f85d398f910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCXK2C3WWCMS74ELZS5XPL3ADL/bundle.json","state_url":"https://pith.science/pith/PCXK2C3WWCMS74ELZS5XPL3ADL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCXK2C3WWCMS74ELZS5XPL3ADL/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-06-09T02:31:15Z","links":{"resolver":"https://pith.science/pith/PCXK2C3WWCMS74ELZS5XPL3ADL","bundle":"https://pith.science/pith/PCXK2C3WWCMS74ELZS5XPL3ADL/bundle.json","state":"https://pith.science/pith/PCXK2C3WWCMS74ELZS5XPL3ADL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCXK2C3WWCMS74ELZS5XPL3ADL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PCXK2C3WWCMS74ELZS5XPL3ADL","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":"8089679a5aff3d0cdf64b5b81127160bbfbfa63a18eb869c6bc166b9c50d704c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T22:56:24Z","title_canon_sha256":"4858ac6acf7dfad2306133e2cfe89cef534456fdc3cca06deb0af8fa55c2bc08"},"schema_version":"1.0","source":{"id":"1711.05839","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05839","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05839v3","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05839","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"PCXK2C3WWCMS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PCXK2C3WWCMS74EL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PCXK2C3W","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d97276f3c22d16cd9b767d726d4a7e2a30ebfa5b0a627db274265f85d398f910","target":"graph","created_at":"2026-05-18T00:26:17Z","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 present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an $n$-vertex graph that runs in $O(3^n n)$ time and uses $O(2^n)$ space. In this problem, we are given a graph $G = (V, E)$ and the task is to find a smallest possible set $F \\subseteq V \\times V$ of vertex pairs such that $(V, E \\bigtriangleup F)$ is a cograph (or $P_4$-free graph), where $\\bigtriangleup$ represents the symmetric difference operator. We also describe a technique for speeding up the performance of the algorithm in practice. Additionally, we present a heuristic for solving the Cogra","authors_text":"Marcus Ludwig, Sebastian B\\\"ocker, W. Timothy J. White","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T22:56:24Z","title":"Exact and heuristic algorithms for Cograph Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05839","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:6ac0f8c164c52430be25a4d7976a921c914bdc7d71bc68a61a693de85e94ed83","target":"record","created_at":"2026-05-18T00:26:17Z","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":"8089679a5aff3d0cdf64b5b81127160bbfbfa63a18eb869c6bc166b9c50d704c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T22:56:24Z","title_canon_sha256":"4858ac6acf7dfad2306133e2cfe89cef534456fdc3cca06deb0af8fa55c2bc08"},"schema_version":"1.0","source":{"id":"1711.05839","kind":"arxiv","version":3}},"canonical_sha256":"78aead0b76b0992ff08bccbb77af601ac8012036933a357957cbbbd765a76d7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78aead0b76b0992ff08bccbb77af601ac8012036933a357957cbbbd765a76d7d","first_computed_at":"2026-05-18T00:26:17.920793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:17.920793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bS9BUeD3jPlvFMOxWo0F+lKoEW8lFY2rDVW/DDplV39n9tDOTUDE3828xtyFYOyXtit0nyWJCWrXEOCFFLktBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:17.921420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05839","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac0f8c164c52430be25a4d7976a921c914bdc7d71bc68a61a693de85e94ed83","sha256:d97276f3c22d16cd9b767d726d4a7e2a30ebfa5b0a627db274265f85d398f910"],"state_sha256":"289a7d9b91c261e78cfafeba1178533f5c43b68b1fdc33b82b55ff839474b50c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iE1xtE16IfTwB94EKf1uCjOFyssZIKUdGVIjn/xMLdYh0JaTty8xOQQdY643WlneT6ga+SJ3fZx3rml11vqUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:31:15.648413Z","bundle_sha256":"59fbb22499251910682bf401e83fa4df842dd1c81dcf2e6c3e3a00bc902afa11"}}