{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XKHOPS2OH4ZQ53NHSGGPMI33NE","short_pith_number":"pith:XKHOPS2O","schema_version":"1.0","canonical_sha256":"ba8ee7cb4e3f330eeda7918cf6237b693d344ff0fd6a4384f87625f8bab648ff","source":{"kind":"arxiv","id":"1604.04111","version":2},"attestation_state":"computed","paper":{"title":"Lossy Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-04-14T11:08:54Z","abstract_excerpt":"In this paper we propose a new framework for analyzing the performance of preprocessing algorithms. Our framework builds on the notion of kernelization from parameterized complexity. However, as opposed to the original notion of kernelization, our definitions combine well with approximation algorithms and heuristics. The key new definition is that of a polynomial size $\\alpha$-approximate kernel. Loosely speaking, a polynomial size $\\alpha$-approximate kernel is a polynomial time pre-processing algorithm that takes as input an instance $(I,k)$ to a parameterized problem, and outputs another in"},"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":"1604.04111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-14T11:08:54Z","cross_cats_sorted":[],"title_canon_sha256":"c5ed606b49ec02210852e3fd9be15a0a9a5e9a69378651c7c89fc8234239dd22","abstract_canon_sha256":"4092e129681e7aaf511731d326ab9350df98e813b148030aa4e8f8337da15366"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:12.429409Z","signature_b64":"i6hKue1xXI8ZY5ipuG4YhH7Ty8VjXU9WN16mjGYd/WJHMBL6nB6DW8SHEIJZ7kRfcGBnaGqC/NxOKD6ScjAmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba8ee7cb4e3f330eeda7918cf6237b693d344ff0fd6a4384f87625f8bab648ff","last_reissued_at":"2026-05-18T01:00:12.428688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:12.428688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossy Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh","submitted_at":"2016-04-14T11:08:54Z","abstract_excerpt":"In this paper we propose a new framework for analyzing the performance of preprocessing algorithms. Our framework builds on the notion of kernelization from parameterized complexity. However, as opposed to the original notion of kernelization, our definitions combine well with approximation algorithms and heuristics. The key new definition is that of a polynomial size $\\alpha$-approximate kernel. Loosely speaking, a polynomial size $\\alpha$-approximate kernel is a polynomial time pre-processing algorithm that takes as input an instance $(I,k)$ to a parameterized problem, and outputs another in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04111","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":"1604.04111","created_at":"2026-05-18T01:00:12.428808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04111v2","created_at":"2026-05-18T01:00:12.428808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04111","created_at":"2026-05-18T01:00:12.428808+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKHOPS2OH4ZQ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKHOPS2OH4ZQ53NH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKHOPS2O","created_at":"2026-05-18T12:30:51.357362+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/XKHOPS2OH4ZQ53NHSGGPMI33NE","json":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE.json","graph_json":"https://pith.science/api/pith-number/XKHOPS2OH4ZQ53NHSGGPMI33NE/graph.json","events_json":"https://pith.science/api/pith-number/XKHOPS2OH4ZQ53NHSGGPMI33NE/events.json","paper":"https://pith.science/paper/XKHOPS2O"},"agent_actions":{"view_html":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE","download_json":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE.json","view_paper":"https://pith.science/paper/XKHOPS2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04111&json=true","fetch_graph":"https://pith.science/api/pith-number/XKHOPS2OH4ZQ53NHSGGPMI33NE/graph.json","fetch_events":"https://pith.science/api/pith-number/XKHOPS2OH4ZQ53NHSGGPMI33NE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE/action/storage_attestation","attest_author":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE/action/author_attestation","sign_citation":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE/action/citation_signature","submit_replication":"https://pith.science/pith/XKHOPS2OH4ZQ53NHSGGPMI33NE/action/replication_record"}},"created_at":"2026-05-18T01:00:12.428808+00:00","updated_at":"2026-05-18T01:00:12.428808+00:00"}