{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DN4KPS3BO7PZIRKZBTUEWDKXVE","short_pith_number":"pith:DN4KPS3B","schema_version":"1.0","canonical_sha256":"1b78a7cb6177df9445590ce84b0d57a91107796aff6ae171fb9ca39081a91efa","source":{"kind":"arxiv","id":"2003.14317","version":1},"attestation_state":"computed","paper":{"title":"Engineering Exact Quasi-Threshold Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser, Dorothea Wagner, Lars Gottesb\\\"uren, Michael Hamann, Philipp Schoch, Sven Z\\\"uhlsdorf","submitted_at":"2020-03-31T15:51:32Z","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"},"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":"2003.14317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-31T15:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"95ce241601817c0f4f3ca8893d6de1b57c882a5d83e084265f8459ded991b4df","abstract_canon_sha256":"db9ec7fc2e207acab48254ad8f3b57c1536d5a23978d778d1b5b2b9ed68d8def"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:49.507686Z","signature_b64":"f3AbzxEuKuKziQ/27AsCt6dPlWSa3PKsnXV54v+GDy683JaNhSqzRZbhxj4m0JobX9fPd+meelQEmyeLtPO7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b78a7cb6177df9445590ce84b0d57a91107796aff6ae171fb9ca39081a91efa","last_reissued_at":"2026-07-05T00:51:49.507289Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:49.507289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Engineering Exact Quasi-Threshold Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ben Strasser, Dorothea Wagner, Lars Gottesb\\\"uren, Michael Hamann, Philipp Schoch, Sven Z\\\"uhlsdorf","submitted_at":"2020-03-31T15:51:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.14317","kind":"arxiv","version":1},"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/2003.14317/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.14317","created_at":"2026-07-05T00:51:49.507361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.14317v1","created_at":"2026-07-05T00:51:49.507361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.14317","created_at":"2026-07-05T00:51:49.507361+00:00"},{"alias_kind":"pith_short_12","alias_value":"DN4KPS3BO7PZ","created_at":"2026-07-05T00:51:49.507361+00:00"},{"alias_kind":"pith_short_16","alias_value":"DN4KPS3BO7PZIRKZ","created_at":"2026-07-05T00:51:49.507361+00:00"},{"alias_kind":"pith_short_8","alias_value":"DN4KPS3B","created_at":"2026-07-05T00:51:49.507361+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/DN4KPS3BO7PZIRKZBTUEWDKXVE","json":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE.json","graph_json":"https://pith.science/api/pith-number/DN4KPS3BO7PZIRKZBTUEWDKXVE/graph.json","events_json":"https://pith.science/api/pith-number/DN4KPS3BO7PZIRKZBTUEWDKXVE/events.json","paper":"https://pith.science/paper/DN4KPS3B"},"agent_actions":{"view_html":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE","download_json":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE.json","view_paper":"https://pith.science/paper/DN4KPS3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.14317&json=true","fetch_graph":"https://pith.science/api/pith-number/DN4KPS3BO7PZIRKZBTUEWDKXVE/graph.json","fetch_events":"https://pith.science/api/pith-number/DN4KPS3BO7PZIRKZBTUEWDKXVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE/action/storage_attestation","attest_author":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE/action/author_attestation","sign_citation":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE/action/citation_signature","submit_replication":"https://pith.science/pith/DN4KPS3BO7PZIRKZBTUEWDKXVE/action/replication_record"}},"created_at":"2026-07-05T00:51:49.507361+00:00","updated_at":"2026-07-05T00:51:49.507361+00:00"}