{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DN4KPS3BO7PZIRKZBTUEWDKXVE","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":"db9ec7fc2e207acab48254ad8f3b57c1536d5a23978d778d1b5b2b9ed68d8def","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-31T15:51:32Z","title_canon_sha256":"95ce241601817c0f4f3ca8893d6de1b57c882a5d83e084265f8459ded991b4df"},"schema_version":"1.0","source":{"id":"2003.14317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.14317","created_at":"2026-07-05T00:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"2003.14317v1","created_at":"2026-07-05T00:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.14317","created_at":"2026-07-05T00:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"DN4KPS3BO7PZ","created_at":"2026-07-05T00:51:49Z"},{"alias_kind":"pith_short_16","alias_value":"DN4KPS3BO7PZIRKZ","created_at":"2026-07-05T00:51:49Z"},{"alias_kind":"pith_short_8","alias_value":"DN4KPS3B","created_at":"2026-07-05T00:51:49Z"}],"graph_snapshots":[{"event_id":"sha256:ee5ef65e0cc00aa07f8cf4681fd927ff0a35449aab3377c281fdd6f88a22fe70","target":"graph","created_at":"2026-07-05T00:51:49Z","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/2003.14317/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quasi-threshold graphs are $\\{C_4, P_4\\}$-free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the $\\{C_4, P_4\\}$-free editing problem, which is the problem of finding a minimum number of edge insertions or deletions to transform an input graph into a quasi-threshold graph. This problem is NP-hard but fixed-parameter tractable (FPT) in the number of edits by using a branch-and-bound algorithm and admits a simple integer linear programming formulation (ILP). Both methods are also applicable to the general $F$-free editing problem for any finite","authors_text":"Ben Strasser, Dorothea Wagner, Lars Gottesb\\\"uren, Michael Hamann, Philipp Schoch, Sven Z\\\"uhlsdorf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-31T15:51:32Z","title":"Engineering Exact Quasi-Threshold Editing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.14317","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:7ca5efe4148e306d179eabf838523aaceaf42d19c9468df5523ff1cc9db8b891","target":"record","created_at":"2026-07-05T00:51:49Z","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":"db9ec7fc2e207acab48254ad8f3b57c1536d5a23978d778d1b5b2b9ed68d8def","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-31T15:51:32Z","title_canon_sha256":"95ce241601817c0f4f3ca8893d6de1b57c882a5d83e084265f8459ded991b4df"},"schema_version":"1.0","source":{"id":"2003.14317","kind":"arxiv","version":1}},"canonical_sha256":"1b78a7cb6177df9445590ce84b0d57a91107796aff6ae171fb9ca39081a91efa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b78a7cb6177df9445590ce84b0d57a91107796aff6ae171fb9ca39081a91efa","first_computed_at":"2026-07-05T00:51:49.507289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:51:49.507289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f3AbzxEuKuKziQ/27AsCt6dPlWSa3PKsnXV54v+GDy683JaNhSqzRZbhxj4m0JobX9fPd+meelQEmyeLtPO7Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:51:49.507686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.14317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ca5efe4148e306d179eabf838523aaceaf42d19c9468df5523ff1cc9db8b891","sha256:ee5ef65e0cc00aa07f8cf4681fd927ff0a35449aab3377c281fdd6f88a22fe70"],"state_sha256":"6e64fc3ed93fe804fcf23c2fb526956c7e59bf6ee3c5db649a81fa9a648b24ec"}