{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7DUN3VUDPSJOFLQ2IA3FS4SRZJ","short_pith_number":"pith:7DUN3VUD","schema_version":"1.0","canonical_sha256":"f8e8ddd6837c92e2ae1a4036597251ca742cc7def613181594b74fd21bf4217a","source":{"kind":"arxiv","id":"1606.01925","version":3},"attestation_state":"computed","paper":{"title":"Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Jianxin Wang, Wenjun Li, Yongjie Yang","submitted_at":"2016-06-06T20:15:42Z","abstract_excerpt":"In the Proper Interval Vertex Deletion problem (PIVD for short), we are given a graph $G$ and an integer parameter $k>0$, and the question is whether there are at most $k$ vertices in $G$ whose removal results in a proper interval graph. It is known that the PIVD problem is fixed-parameter tractable and admits a polynomial but \"unreasonably\" large kernel of $O(k^{53})$ vertices. A natural question is whether the problem admits a polynomial kernel of \"reasonable\" size. In this paper, we answer this question by deriving an $O(k^7)$-vertex kernel for the PIVD problem. Our kernelization is based o"},"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":"1606.01925","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-06T20:15:42Z","cross_cats_sorted":[],"title_canon_sha256":"d30f0472cedfbbe4e801ab8ddfba9c0e8c26fbbeec86e48193dce0281921d494","abstract_canon_sha256":"7de030fb14dfc6ddabcf0157d8f7fb99c282621f6b0f99c5319e7c321e998991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:46.021656Z","signature_b64":"h0EjGaKDV84bPjUlrrYGKPd0VYVcAaR/aWHvIb9W/QeLVLLLYvxGqDVvQruJhhHdC66p3bIh1yuiaF/fY4FIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8e8ddd6837c92e2ae1a4036597251ca742cc7def613181594b74fd21bf4217a","last_reissued_at":"2026-05-18T00:56:46.021028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:46.021028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Jianxin Wang, Wenjun Li, Yongjie Yang","submitted_at":"2016-06-06T20:15:42Z","abstract_excerpt":"In the Proper Interval Vertex Deletion problem (PIVD for short), we are given a graph $G$ and an integer parameter $k>0$, and the question is whether there are at most $k$ vertices in $G$ whose removal results in a proper interval graph. It is known that the PIVD problem is fixed-parameter tractable and admits a polynomial but \"unreasonably\" large kernel of $O(k^{53})$ vertices. A natural question is whether the problem admits a polynomial kernel of \"reasonable\" size. In this paper, we answer this question by deriving an $O(k^7)$-vertex kernel for the PIVD problem. Our kernelization is based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01925","kind":"arxiv","version":3},"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":"1606.01925","created_at":"2026-05-18T00:56:46.021139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01925v3","created_at":"2026-05-18T00:56:46.021139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01925","created_at":"2026-05-18T00:56:46.021139+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DUN3VUDPSJO","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DUN3VUDPSJOFLQ2","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DUN3VUD","created_at":"2026-05-18T12:30:04.600751+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/7DUN3VUDPSJOFLQ2IA3FS4SRZJ","json":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ.json","graph_json":"https://pith.science/api/pith-number/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/graph.json","events_json":"https://pith.science/api/pith-number/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/events.json","paper":"https://pith.science/paper/7DUN3VUD"},"agent_actions":{"view_html":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ","download_json":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ.json","view_paper":"https://pith.science/paper/7DUN3VUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01925&json=true","fetch_graph":"https://pith.science/api/pith-number/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/action/storage_attestation","attest_author":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/action/author_attestation","sign_citation":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/action/citation_signature","submit_replication":"https://pith.science/pith/7DUN3VUDPSJOFLQ2IA3FS4SRZJ/action/replication_record"}},"created_at":"2026-05-18T00:56:46.021139+00:00","updated_at":"2026-05-18T00:56:46.021139+00:00"}