{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZJZ3ZYGFD23NIT5NWXW6EPEMKU","short_pith_number":"pith:ZJZ3ZYGF","schema_version":"1.0","canonical_sha256":"ca73bce0c51eb6d44fadb5ede23c8c550499b808253a8aaabdd4573b096afd62","source":{"kind":"arxiv","id":"1706.05628","version":1},"attestation_state":"computed","paper":{"title":"An improved kernel for the cycle contraction problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Yuefang Sun","submitted_at":"2017-06-18T10:01:12Z","abstract_excerpt":"The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge contractions. The problem has been studied {by Belmonte et al. [IPEC 2013]} who obtained a linear kernel with at most $6k+6$ vertices. We provide an improved kernel with at most $5k+4$ vertices for it in this paper."},"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":"1706.05628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-18T10:01:12Z","cross_cats_sorted":[],"title_canon_sha256":"0656780fc1691827899a50076a0870ddeb3183d0b2c2dc9e0f872571ef390f86","abstract_canon_sha256":"34f0589cbe11255cbc65bfdb520e05aeed1133e57fe3a06abaeb07eda2feb682"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:09.369562Z","signature_b64":"FxwevUFFiU6rfFMvLb/n0TrKg+rW6NiS3LXQRD9vG5qftXO8BI8dWmpKxar7vi0hQ4jYazxfNj9sD8FFcDpGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca73bce0c51eb6d44fadb5ede23c8c550499b808253a8aaabdd4573b096afd62","last_reissued_at":"2026-05-18T00:42:09.369096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:09.369096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved kernel for the cycle contraction problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Sheng, Yuefang Sun","submitted_at":"2017-06-18T10:01:12Z","abstract_excerpt":"The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge contractions. The problem has been studied {by Belmonte et al. [IPEC 2013]} who obtained a linear kernel with at most $6k+6$ vertices. We provide an improved kernel with at most $5k+4$ vertices for it in this paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05628","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":"1706.05628","created_at":"2026-05-18T00:42:09.369166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05628v1","created_at":"2026-05-18T00:42:09.369166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05628","created_at":"2026-05-18T00:42:09.369166+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJZ3ZYGFD23N","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJZ3ZYGFD23NIT5N","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJZ3ZYGF","created_at":"2026-05-18T12:31:59.375834+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/ZJZ3ZYGFD23NIT5NWXW6EPEMKU","json":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU.json","graph_json":"https://pith.science/api/pith-number/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/graph.json","events_json":"https://pith.science/api/pith-number/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/events.json","paper":"https://pith.science/paper/ZJZ3ZYGF"},"agent_actions":{"view_html":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU","download_json":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU.json","view_paper":"https://pith.science/paper/ZJZ3ZYGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05628&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/action/storage_attestation","attest_author":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/action/author_attestation","sign_citation":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/action/citation_signature","submit_replication":"https://pith.science/pith/ZJZ3ZYGFD23NIT5NWXW6EPEMKU/action/replication_record"}},"created_at":"2026-05-18T00:42:09.369166+00:00","updated_at":"2026-05-18T00:42:09.369166+00:00"}