{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UJTU4X7FB6HTIVKZXWOKGFPKJE","short_pith_number":"pith:UJTU4X7F","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"},"canonical_sha256":"a2674e5fe50f8f345559bd9ca315ea4904257a89dcf8684c86a91c289a1006c2","source":{"kind":"arxiv","id":"1910.00277","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.00277","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1910.00277v5","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00277","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"UJTU4X7FB6HT","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"UJTU4X7FB6HTIVKZ","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"UJTU4X7F","created_at":"2026-07-05T05:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UJTU4X7FB6HTIVKZXWOKGFPKJE","target":"record","payload":{"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"},"canonical_sha256":"a2674e5fe50f8f345559bd9ca315ea4904257a89dcf8684c86a91c289a1006c2","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"},"source_kind":"arxiv","source_id":"1910.00277","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sDKTrf+kYKY0YO3VtJmRSM87HITQ1cgf8bzzFxX/wdX49OBHqmUZJ6kGvYrp75evoRUX9Ed6mEtASjC//4PkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:24:01.636992Z"},"content_sha256":"4a9ccab1a51e3e2ecb539fc621b5ed47e185c1c7932722047678efb37eacdd47","schema_version":"1.0","event_id":"sha256:4a9ccab1a51e3e2ecb539fc621b5ed47e185c1c7932722047678efb37eacdd47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UJTU4X7FB6HTIVKZXWOKGFPKJE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:27:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmeKJ/zuuI/VTH5FxNjjX7kRuuCRE341Bw1sgfNtJHbYAEl89XTz+NLqI41exp//TlC7kaeorfsJ7jlOPUr1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:24:01.637401Z"},"content_sha256":"d3c36cc7d31762723c2f656d7175bfa797eade7a60737200e6060e37115a0804","schema_version":"1.0","event_id":"sha256:d3c36cc7d31762723c2f656d7175bfa797eade7a60737200e6060e37115a0804"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/bundle.json","state_url":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T16:24:01Z","links":{"resolver":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE","bundle":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/bundle.json","state":"https://pith.science/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJTU4X7FB6HTIVKZXWOKGFPKJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UJTU4X7FB6HTIVKZXWOKGFPKJE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"82746867371e6a6e5a2c268cf0315d6931adbf87be0fc1d4714854f4b3e1a7ce","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-01T09:45:08Z","title_canon_sha256":"1aa4b78dc04e82a9c56d19d55f38c7a53e9beff1e9e55924266a5699729c7409"},"schema_version":"1.0","source":{"id":"1910.00277","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.00277","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"arxiv_version","alias_value":"1910.00277v5","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00277","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"pith_short_12","alias_value":"UJTU4X7FB6HT","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"UJTU4X7FB6HTIVKZ","created_at":"2026-07-05T05:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"UJTU4X7F","created_at":"2026-07-05T05:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:d3c36cc7d31762723c2f656d7175bfa797eade7a60737200e6060e37115a0804","target":"graph","created_at":"2026-07-05T05:27:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.00277/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andr\\'e Nichterlein, Matthias Bentert, Ren\\'e van Bevern, Rolf Niedermeier, Till Fluschnik","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-01T09:45:08Z","title":"Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00277","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4a9ccab1a51e3e2ecb539fc621b5ed47e185c1c7932722047678efb37eacdd47","target":"record","created_at":"2026-07-05T05:27:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"82746867371e6a6e5a2c268cf0315d6931adbf87be0fc1d4714854f4b3e1a7ce","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-01T09:45:08Z","title_canon_sha256":"1aa4b78dc04e82a9c56d19d55f38c7a53e9beff1e9e55924266a5699729c7409"},"schema_version":"1.0","source":{"id":"1910.00277","kind":"arxiv","version":5}},"canonical_sha256":"a2674e5fe50f8f345559bd9ca315ea4904257a89dcf8684c86a91c289a1006c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2674e5fe50f8f345559bd9ca315ea4904257a89dcf8684c86a91c289a1006c2","first_computed_at":"2026-07-05T05:27:45.522684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:27:45.522684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JwKB0LSDweWiYVtmtPaiF5FCFAN+ylCAE4PbEDilYljd1S4wnznfHfqEWgp/m/tKUu6E1MVY4GpnEWmQa8gpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:27:45.523197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.00277","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a9ccab1a51e3e2ecb539fc621b5ed47e185c1c7932722047678efb37eacdd47","sha256:d3c36cc7d31762723c2f656d7175bfa797eade7a60737200e6060e37115a0804"],"state_sha256":"bf0b4f2fa0e87d6c1ea76021eda8ea4eeb9be26c2fa3cd68bcc31634885bcd3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+SKdcNmEKItLUxAh9iDRp3qTnsYm3cyVIjN4thtCx2l6ia+oCW0JUUyDD4bbsdBvANnt+B8Xa/eHaCSKUd8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:24:01.639403Z","bundle_sha256":"67f1f224e6b40ec3ba1fa5e27f35661b7ac46dfc81f93ca95da0b417a6abd93a"}}