{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RSDGPJLBMH2P57UKMNBW4ZCFKI","short_pith_number":"pith:RSDGPJLB","schema_version":"1.0","canonical_sha256":"8c8667a56161f4fefe8a63436e644552234c308890d3bd08bbc8cb706dc56e81","source":{"kind":"arxiv","id":"1310.5786","version":1},"attestation_state":"computed","paper":{"title":"Contracting Graphs to Split Graphs and Threshold Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chengwei Guo, Leizhen Cai","submitted_at":"2013-10-22T03:01:41Z","abstract_excerpt":"We study the parameterized complexity of Split Contraction and Threshold Contraction. In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by contracting at most k edges. We present an FPT algorithm for Split Contraction, and prove that Threshold Contraction on split graphs, i.e., contracting an input split graph to a threshold graph, is FPT when parameterized by the number of contractions. To give a complete picture, we show that these two problems admit no polynomial kernels unless NP\\subseteq coN"},"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":"1310.5786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-22T03:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"14c2ca9d3eaa9f4982839b669e49e36efb7c7d6dedd0e1ddf1d981c0e8148660","abstract_canon_sha256":"242d34b4f3b0cc28578ee882b02cb705ae66a701f99df285112d60bfaf90cc1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.325570Z","signature_b64":"wuUb//Blo0VTrOU640bimSYatUxaKC5d1LWfMP+nee5X+M0YVFkcK1IuxSZN420Xu6Zt3+G3ac0AvW6rEfdSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c8667a56161f4fefe8a63436e644552234c308890d3bd08bbc8cb706dc56e81","last_reissued_at":"2026-05-18T03:09:32.324756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.324756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contracting Graphs to Split Graphs and Threshold Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chengwei Guo, Leizhen Cai","submitted_at":"2013-10-22T03:01:41Z","abstract_excerpt":"We study the parameterized complexity of Split Contraction and Threshold Contraction. In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by contracting at most k edges. We present an FPT algorithm for Split Contraction, and prove that Threshold Contraction on split graphs, i.e., contracting an input split graph to a threshold graph, is FPT when parameterized by the number of contractions. To give a complete picture, we show that these two problems admit no polynomial kernels unless NP\\subseteq coN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5786","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":"1310.5786","created_at":"2026-05-18T03:09:32.324887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5786v1","created_at":"2026-05-18T03:09:32.324887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5786","created_at":"2026-05-18T03:09:32.324887+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSDGPJLBMH2P","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSDGPJLBMH2P57UK","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSDGPJLB","created_at":"2026-05-18T12:27:59.945178+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/RSDGPJLBMH2P57UKMNBW4ZCFKI","json":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI.json","graph_json":"https://pith.science/api/pith-number/RSDGPJLBMH2P57UKMNBW4ZCFKI/graph.json","events_json":"https://pith.science/api/pith-number/RSDGPJLBMH2P57UKMNBW4ZCFKI/events.json","paper":"https://pith.science/paper/RSDGPJLB"},"agent_actions":{"view_html":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI","download_json":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI.json","view_paper":"https://pith.science/paper/RSDGPJLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5786&json=true","fetch_graph":"https://pith.science/api/pith-number/RSDGPJLBMH2P57UKMNBW4ZCFKI/graph.json","fetch_events":"https://pith.science/api/pith-number/RSDGPJLBMH2P57UKMNBW4ZCFKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI/action/storage_attestation","attest_author":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI/action/author_attestation","sign_citation":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI/action/citation_signature","submit_replication":"https://pith.science/pith/RSDGPJLBMH2P57UKMNBW4ZCFKI/action/replication_record"}},"created_at":"2026-05-18T03:09:32.324887+00:00","updated_at":"2026-05-18T03:09:32.324887+00:00"}