{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PYAST263Z4EQKABRC5HK77GFGT","short_pith_number":"pith:PYAST263","schema_version":"1.0","canonical_sha256":"7e0129ebdbcf09050031174eaffcc534cbb34e1c9aa669193a6dfd4252dfba35","source":{"kind":"arxiv","id":"1803.03358","version":2},"attestation_state":"computed","paper":{"title":"A Polynomial Kernel for Diamond-Free Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashutosh Rai, Junjie Ye, R. B. Sandeep, Yixin Cao","submitted_at":"2018-03-09T02:31:16Z","abstract_excerpt":"An $H$-free editing problem asks whether we can edit at most $k$ edges to make a graph contain no induced copy of the fixed graph $H$. We obtain a polynomial kernel for this problem when $H$ is a diamond. The incompressibility dichotomy for $H$ being a 3-connected graph and the classical complexity dichotomy suggest that except for $H$ being a complete/empty graph, $H$-free editing problems admit polynomial kernels only for a few small graphs $H$. Therefore, we believe that our result is an essential step toward a complete dichotomy on the compressibility of $H$-free editing. Additionally, we "},"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":"1803.03358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-09T02:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"70c45304a397fde4ebb4bfd9f1e797b793925821c386c60b2fb07567d5b446b4","abstract_canon_sha256":"3901d1449e33babc9355fc93fdea3b2342a71863ddfb59a1fc2f38986cd59519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:55.539633Z","signature_b64":"O3Xam2Qk+qiZqfixhgWO4m8CDhxGutfuzEbLpUI1tCS3u4F4lCYw6dd27JLJ7otEonD7E44ByGwfTST6Jy94DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e0129ebdbcf09050031174eaffcc534cbb34e1c9aa669193a6dfd4252dfba35","last_reissued_at":"2026-05-18T00:16:55.538924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:55.538924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial Kernel for Diamond-Free Editing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashutosh Rai, Junjie Ye, R. B. Sandeep, Yixin Cao","submitted_at":"2018-03-09T02:31:16Z","abstract_excerpt":"An $H$-free editing problem asks whether we can edit at most $k$ edges to make a graph contain no induced copy of the fixed graph $H$. We obtain a polynomial kernel for this problem when $H$ is a diamond. The incompressibility dichotomy for $H$ being a 3-connected graph and the classical complexity dichotomy suggest that except for $H$ being a complete/empty graph, $H$-free editing problems admit polynomial kernels only for a few small graphs $H$. Therefore, we believe that our result is an essential step toward a complete dichotomy on the compressibility of $H$-free editing. Additionally, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03358","kind":"arxiv","version":2},"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":"1803.03358","created_at":"2026-05-18T00:16:55.539068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03358v2","created_at":"2026-05-18T00:16:55.539068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03358","created_at":"2026-05-18T00:16:55.539068+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYAST263Z4EQ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYAST263Z4EQKABR","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYAST263","created_at":"2026-05-18T12:32:46.962924+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/PYAST263Z4EQKABRC5HK77GFGT","json":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT.json","graph_json":"https://pith.science/api/pith-number/PYAST263Z4EQKABRC5HK77GFGT/graph.json","events_json":"https://pith.science/api/pith-number/PYAST263Z4EQKABRC5HK77GFGT/events.json","paper":"https://pith.science/paper/PYAST263"},"agent_actions":{"view_html":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT","download_json":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT.json","view_paper":"https://pith.science/paper/PYAST263","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03358&json=true","fetch_graph":"https://pith.science/api/pith-number/PYAST263Z4EQKABRC5HK77GFGT/graph.json","fetch_events":"https://pith.science/api/pith-number/PYAST263Z4EQKABRC5HK77GFGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT/action/storage_attestation","attest_author":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT/action/author_attestation","sign_citation":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT/action/citation_signature","submit_replication":"https://pith.science/pith/PYAST263Z4EQKABRC5HK77GFGT/action/replication_record"}},"created_at":"2026-05-18T00:16:55.539068+00:00","updated_at":"2026-05-18T00:16:55.539068+00:00"}