{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y7JSCDBCMHWYOKPFJDICIWNZO6","short_pith_number":"pith:Y7JSCDBC","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"},"canonical_sha256":"c7d3210c2261ed8729e548d02459b977b1f251e62a81613da866d6a7ce18bdd1","source":{"kind":"arxiv","id":"1505.00612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00612","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00612v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00612","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y7JSCDBCMHWY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y7JSCDBCMHWYOKPF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y7JSCDBC","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y7JSCDBCMHWYOKPFJDICIWNZO6","target":"record","payload":{"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"},"canonical_sha256":"c7d3210c2261ed8729e548d02459b977b1f251e62a81613da866d6a7ce18bdd1","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"},"source_kind":"arxiv","source_id":"1505.00612","source_version":1,"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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKtDxF2tgnm/QTXxDcMsgqczsc5DHeO3Bp7S0t18GytzrE3iFGxd2MzKG0RNtd77+Ife2A44WwaxGF+wZW2sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:25:06.192064Z"},"content_sha256":"9739ff3a4e1093257b1a6bc19cc7ce7ae836ce2edac7cf8890805e6bb49f87e9","schema_version":"1.0","event_id":"sha256:9739ff3a4e1093257b1a6bc19cc7ce7ae836ce2edac7cf8890805e6bb49f87e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y7JSCDBCMHWYOKPFJDICIWNZO6","target":"graph","payload":{"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"},"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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoaThLlN9LJvkUQ2mQbkpea6o5NSbpzmVAJZJLTxgaFQuI3UXHH3jLRrAHjoFMZgrOD8mprUT1r924zUBirOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:25:06.192532Z"},"content_sha256":"5b2595777dd4c2bae4eb1fcc06df40617c7861082eef3c80a27579b92755a443","schema_version":"1.0","event_id":"sha256:5b2595777dd4c2bae4eb1fcc06df40617c7861082eef3c80a27579b92755a443"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/bundle.json","state_url":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/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-05-27T18:25:06Z","links":{"resolver":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6","bundle":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/bundle.json","state":"https://pith.science/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y7JSCDBCMHWYOKPFJDICIWNZO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y7JSCDBCMHWYOKPFJDICIWNZO6","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":"d2e530ea0e0e9db860478ed12c346e518301098a02fa9b761fe17795507e33a9","cross_cats_sorted":["cs.CC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T12:46:20Z","title_canon_sha256":"1d1793d2226fb4a8f84036bfa0f45accc916854d41b2ff16c5ad3a261ef26eb8"},"schema_version":"1.0","source":{"id":"1505.00612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00612","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00612v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00612","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"Y7JSCDBCMHWY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y7JSCDBCMHWYOKPF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y7JSCDBC","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:5b2595777dd4c2bae4eb1fcc06df40617c7861082eef3c80a27579b92755a443","target":"graph","created_at":"2026-05-18T02:17:02Z","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 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","authors_text":"Blair D. Sullivan, Daniel Lokshtanov, Markus Sortland Dregi, P{\\aa}l Gr{\\o}n{\\aa}s Drange","cross_cats":["cs.CC","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T12:46:20Z","title":"On the Threshold of Intractability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00612","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:9739ff3a4e1093257b1a6bc19cc7ce7ae836ce2edac7cf8890805e6bb49f87e9","target":"record","created_at":"2026-05-18T02:17:02Z","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":"d2e530ea0e0e9db860478ed12c346e518301098a02fa9b761fe17795507e33a9","cross_cats_sorted":["cs.CC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-04T12:46:20Z","title_canon_sha256":"1d1793d2226fb4a8f84036bfa0f45accc916854d41b2ff16c5ad3a261ef26eb8"},"schema_version":"1.0","source":{"id":"1505.00612","kind":"arxiv","version":1}},"canonical_sha256":"c7d3210c2261ed8729e548d02459b977b1f251e62a81613da866d6a7ce18bdd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7d3210c2261ed8729e548d02459b977b1f251e62a81613da866d6a7ce18bdd1","first_computed_at":"2026-05-18T02:17:02.385733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:02.385733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13GQW1nW4mG2UhpoVEd7IWBxACOw493XDe3zJfC4tLTCcJB2g1YrU7PQxsC7IuMi2gTdLIhhiHIddabFRIVtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:02.386460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9739ff3a4e1093257b1a6bc19cc7ce7ae836ce2edac7cf8890805e6bb49f87e9","sha256:5b2595777dd4c2bae4eb1fcc06df40617c7861082eef3c80a27579b92755a443"],"state_sha256":"f80e1734feb79ba843156b73055377a9cdd0aeb7785d6ad5c7dbcb9a5ea2d7b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVk7fvDxLxXPdgGVhRjOpjzGK9KG/dlCyBYcqmrVsmDZ5uyJ47uy4au3zpCChxbGpJ6ZX4gSZ1JSsuJUWEWJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:25:06.195217Z","bundle_sha256":"b629d799b8f71f24c1e01772d25c42d83b2c1d51e23289fb1af782e03c0f922a"}}