{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y7JSCDBCMHWYOKPFJDICIWNZO6","short_pith_number":"pith:Y7JSCDBC","schema_version":"1.0","canonical_sha256":"c7d3210c2261ed8729e548d02459b977b1f251e62a81613da866d6a7ce18bdd1","source":{"kind":"arxiv","id":"1505.00612","version":1},"attestation_state":"computed","paper":{"title":"On the Threshold of Intractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Daniel Lokshtanov, Markus Sortland Dregi, P{\\aa}l Gr{\\o}n{\\aa}s Drange","submitted_at":"2015-05-04T12:46:20Z","abstract_excerpt":"We study the computational complexity of the graph modification problems Threshold Editing and Chain Editing, adding and deleting as few edges as possible to transform the input into a threshold (or chain) graph. In this article, we show that both problems are NP-complete, resolving a conjecture by Natanzon, Shamir, and Sharan (Discrete Applied Mathematics, 113(1):109--128, 2001). On the positive side, we show the problem admits a quadratic vertex kernel. Furthermore, we give a subexponential time parameterized algorithm solving Threshold Editing in $2^{O(\\surd k \\log k)} + \\text{poly}(n)$ tim"},"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":"1505.00612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T12:46:20Z","cross_cats_sorted":["cs.CC","cs.SI"],"title_canon_sha256":"1d1793d2226fb4a8f84036bfa0f45accc916854d41b2ff16c5ad3a261ef26eb8","abstract_canon_sha256":"d2e530ea0e0e9db860478ed12c346e518301098a02fa9b761fe17795507e33a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:02.386460Z","signature_b64":"13GQW1nW4mG2UhpoVEd7IWBxACOw493XDe3zJfC4tLTCcJB2g1YrU7PQxsC7IuMi2gTdLIhhiHIddabFRIVtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7d3210c2261ed8729e548d02459b977b1f251e62a81613da866d6a7ce18bdd1","last_reissued_at":"2026-05-18T02:17:02.385733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:02.385733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Threshold of Intractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Daniel Lokshtanov, Markus Sortland Dregi, P{\\aa}l Gr{\\o}n{\\aa}s Drange","submitted_at":"2015-05-04T12:46:20Z","abstract_excerpt":"We study the computational complexity of the graph modification problems Threshold Editing and Chain Editing, adding and deleting as few edges as possible to transform the input into a threshold (or chain) graph. In this article, we show that both problems are NP-complete, resolving a conjecture by Natanzon, Shamir, and Sharan (Discrete Applied Mathematics, 113(1):109--128, 2001). On the positive side, we show the problem admits a quadratic vertex kernel. Furthermore, we give a subexponential time parameterized algorithm solving Threshold Editing in $2^{O(\\surd k \\log k)} + \\text{poly}(n)$ tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00612","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":""},"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":"1505.00612","created_at":"2026-05-18T02:17:02.385853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00612v1","created_at":"2026-05-18T02:17:02.385853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00612","created_at":"2026-05-18T02:17:02.385853+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7JSCDBCMHWY","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7JSCDBCMHWYOKPF","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7JSCDBC","created_at":"2026-05-18T12:29:50.041715+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/Y7JSCDBCMHWYOKPFJDICIWNZO6","json":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6.json","graph_json":"https://pith.science/api/pith-number/Y7JSCDBCMHWYOKPFJDICIWNZO6/graph.json","events_json":"https://pith.science/api/pith-number/Y7JSCDBCMHWYOKPFJDICIWNZO6/events.json","paper":"https://pith.science/paper/Y7JSCDBC"},"agent_actions":{"view_html":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6","download_json":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6.json","view_paper":"https://pith.science/paper/Y7JSCDBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00612&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7JSCDBCMHWYOKPFJDICIWNZO6/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7JSCDBCMHWYOKPFJDICIWNZO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/action/storage_attestation","attest_author":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/action/author_attestation","sign_citation":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/action/citation_signature","submit_replication":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/action/replication_record"}},"created_at":"2026-05-18T02:17:02.385853+00:00","updated_at":"2026-05-18T02:17:02.385853+00:00"}