{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZJ725ZAPMGM2CRP7YUXRF3EKOY","short_pith_number":"pith:ZJ725ZAP","schema_version":"1.0","canonical_sha256":"ca7faee40f6199a145ffc52f12ec8a763c1c7b106e522c49889ce422d2701cf9","source":{"kind":"arxiv","id":"1812.03155","version":1},"attestation_state":"computed","paper":{"title":"Kernelization of Packing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Holger Dell","submitted_at":"2018-12-07T18:41:10Z","abstract_excerpt":"Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size at least k in a given d-uniform hypergraph and has kernels with O(k^d) edges. Bodlaender et al. [JCSS 2009], Fortnow and Santhanam [JCSS 2011], Dell and Van Melkebeek [JACM 2014] developed a framework for proving lower bounds on the kernel size for certain problems, under the complexity-theoretic hypothesis that coNP is not contained in NP/poly. Under the sa"},"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":"1812.03155","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-12-07T18:41:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0558fb9694df48d7983602e3aeb3e2ea5066418185b245bcf853c0fc4f6a16bf","abstract_canon_sha256":"f72339dbb85e1211e4b6e64c9aff791b684bbcf1b2bda0aebd30f968b93f7ad4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:50.791160Z","signature_b64":"quGLFixBtjDb7kMh+vI/7LjW5FWDyOlwAmUFS+mHt1QqoFL5QmdZQ0b4M6NTVeEX7tgJH5MVrepJX9zB707aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca7faee40f6199a145ffc52f12ec8a763c1c7b106e522c49889ce422d2701cf9","last_reissued_at":"2026-05-17T23:58:50.790723Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:50.790723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization of Packing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Holger Dell","submitted_at":"2018-12-07T18:41:10Z","abstract_excerpt":"Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size at least k in a given d-uniform hypergraph and has kernels with O(k^d) edges. Bodlaender et al. [JCSS 2009], Fortnow and Santhanam [JCSS 2011], Dell and Van Melkebeek [JACM 2014] developed a framework for proving lower bounds on the kernel size for certain problems, under the complexity-theoretic hypothesis that coNP is not contained in NP/poly. Under the sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03155","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":"1812.03155","created_at":"2026-05-17T23:58:50.790789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03155v1","created_at":"2026-05-17T23:58:50.790789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03155","created_at":"2026-05-17T23:58:50.790789+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJ725ZAPMGM2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJ725ZAPMGM2CRP7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJ725ZAP","created_at":"2026-05-18T12:33:07.085635+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/ZJ725ZAPMGM2CRP7YUXRF3EKOY","json":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY.json","graph_json":"https://pith.science/api/pith-number/ZJ725ZAPMGM2CRP7YUXRF3EKOY/graph.json","events_json":"https://pith.science/api/pith-number/ZJ725ZAPMGM2CRP7YUXRF3EKOY/events.json","paper":"https://pith.science/paper/ZJ725ZAP"},"agent_actions":{"view_html":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY","download_json":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY.json","view_paper":"https://pith.science/paper/ZJ725ZAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03155&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJ725ZAPMGM2CRP7YUXRF3EKOY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJ725ZAPMGM2CRP7YUXRF3EKOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY/action/storage_attestation","attest_author":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY/action/author_attestation","sign_citation":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY/action/citation_signature","submit_replication":"https://pith.science/pith/ZJ725ZAPMGM2CRP7YUXRF3EKOY/action/replication_record"}},"created_at":"2026-05-17T23:58:50.790789+00:00","updated_at":"2026-05-17T23:58:50.790789+00:00"}