{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UJTU4X7FB6HTIVKZXWOKGFPKJE","short_pith_number":"pith:UJTU4X7F","schema_version":"1.0","canonical_sha256":"a2674e5fe50f8f345559bd9ca315ea4904257a89dcf8684c86a91c289a1006c2","source":{"kind":"arxiv","id":"1910.00277","version":5},"attestation_state":"computed","paper":{"title":"Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Matthias Bentert, Ren\\'e van Bevern, Rolf Niedermeier, Till Fluschnik","submitted_at":"2019-10-01T09:45:08Z","abstract_excerpt":"Dealing with NP-hard problems, kernelization is a fundamental notion for polynomial-time data reduction with performance guarantees: in polynomial time, a problem instance is reduced to an equivalent instance with size upper-bounded by a function of a parameter chosen in advance. Kernelization for weighted problems particularly requires to also shrink weights. Marx and V\\'egh [ACM Trans. Algorithms 2015] and Etscheid et al. [J. Comput. Syst. Sci. 2017] used a technique of Frank and Tardos [Combinatorica 1987] to obtain polynomial-size kernels for weighted problems, mostly with additive goal fu"},"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":"1910.00277","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-01T09:45:08Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"1aa4b78dc04e82a9c56d19d55f38c7a53e9beff1e9e55924266a5699729c7409","abstract_canon_sha256":"82746867371e6a6e5a2c268cf0315d6931adbf87be0fc1d4714854f4b3e1a7ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:45.523197Z","signature_b64":"JwKB0LSDweWiYVtmtPaiF5FCFAN+ylCAE4PbEDilYljd1S4wnznfHfqEWgp/m/tKUu6E1MVY4GpnEWmQa8gpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2674e5fe50f8f345559bd9ca315ea4904257a89dcf8684c86a91c289a1006c2","last_reissued_at":"2026-07-05T05:27:45.522684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:45.522684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Matthias Bentert, Ren\\'e van Bevern, Rolf Niedermeier, Till Fluschnik","submitted_at":"2019-10-01T09:45:08Z","abstract_excerpt":"Dealing with NP-hard problems, kernelization is a fundamental notion for polynomial-time data reduction with performance guarantees: in polynomial time, a problem instance is reduced to an equivalent instance with size upper-bounded by a function of a parameter chosen in advance. Kernelization for weighted problems particularly requires to also shrink weights. Marx and V\\'egh [ACM Trans. Algorithms 2015] and Etscheid et al. [J. Comput. Syst. Sci. 2017] used a technique of Frank and Tardos [Combinatorica 1987] to obtain polynomial-size kernels for weighted problems, mostly with additive goal fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00277","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.00277/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.00277","created_at":"2026-07-05T05:27:45.522745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00277v5","created_at":"2026-07-05T05:27:45.522745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00277","created_at":"2026-07-05T05:27:45.522745+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJTU4X7FB6HT","created_at":"2026-07-05T05:27:45.522745+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJTU4X7FB6HTIVKZ","created_at":"2026-07-05T05:27:45.522745+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJTU4X7F","created_at":"2026-07-05T05:27:45.522745+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/UJTU4X7FB6HTIVKZXWOKGFPKJE","json":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE.json","graph_json":"https://pith.science/api/pith-number/UJTU4X7FB6HTIVKZXWOKGFPKJE/graph.json","events_json":"https://pith.science/api/pith-number/UJTU4X7FB6HTIVKZXWOKGFPKJE/events.json","paper":"https://pith.science/paper/UJTU4X7F"},"agent_actions":{"view_html":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE","download_json":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE.json","view_paper":"https://pith.science/paper/UJTU4X7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00277&json=true","fetch_graph":"https://pith.science/api/pith-number/UJTU4X7FB6HTIVKZXWOKGFPKJE/graph.json","fetch_events":"https://pith.science/api/pith-number/UJTU4X7FB6HTIVKZXWOKGFPKJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/action/storage_attestation","attest_author":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/action/author_attestation","sign_citation":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/action/citation_signature","submit_replication":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/action/replication_record"}},"created_at":"2026-07-05T05:27:45.522745+00:00","updated_at":"2026-07-05T05:27:45.522745+00:00"}