{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ATTZWNMXMKYZM34QLQEOU5HHPF","short_pith_number":"pith:ATTZWNMX","canonical_record":{"source":{"id":"1905.10902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T23:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"d60168d7048f1bbdd42b254e6b2def4e5e5d5d4602b2aeb576eab2aeb68905c9","abstract_canon_sha256":"f133035e69421a20daa76f0abb06fd2c14731c342b43e31f3ef04536564d3342"},"schema_version":"1.0"},"canonical_sha256":"04e79b359762b1966f905c08ea74e7796e4f65736f15b9270da8acc18b8d31c6","source":{"kind":"arxiv","id":"1905.10902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10902","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10902v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10902","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"ATTZWNMXMKYZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ATTZWNMXMKYZM34Q","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ATTZWNMX","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ATTZWNMXMKYZM34QLQEOU5HHPF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T23:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"d60168d7048f1bbdd42b254e6b2def4e5e5d5d4602b2aeb576eab2aeb68905c9","abstract_canon_sha256":"f133035e69421a20daa76f0abb06fd2c14731c342b43e31f3ef04536564d3342"},"schema_version":"1.0"},"canonical_sha256":"04e79b359762b1966f905c08ea74e7796e4f65736f15b9270da8acc18b8d31c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.465610Z","signature_b64":"7PNU2Wk832hCsMLU+ndZZA1fLrfdYrRHFwaw4MHee4QlfF0zqwKgGv+sJ0Nsr0+/8Nc4Jl2JmCEdRCm4H4n7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e79b359762b1966f905c08ea74e7796e4f65736f15b9270da8acc18b8d31c6","last_reissued_at":"2026-05-17T23:45:03.464996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.464996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10902","source_version":1,"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-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"erwko489acBEFyRu2aajHpmYQuVzkx8QFW58mkFNHGC3VVqcLMEoK2/l+NLFyWR2iQiG+Ad8PBX7O/dxpxhIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:25.641780Z"},"content_sha256":"38222ee95e0e3782bb1ce491e11f10549f580de583cc304e77b43d069ac11f55","schema_version":"1.0","event_id":"sha256:38222ee95e0e3782bb1ce491e11f10549f580de583cc304e77b43d069ac11f55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ATTZWNMXMKYZM34QLQEOU5HHPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Engineering Kernelization for Maximum Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Damir Ferizovic, Darren Strash, Demian Hespe, Matthias Mnich, Sebastian Lamm","submitted_at":"2019-05-26T23:12:33Z","abstract_excerpt":"Kernelization is a general theoretical framework for preprocessing instances of NP-hard problems into (generally smaller) instances with bounded size, via the repeated application of data reduction rules. For the fundamental Max Cut problem, kernelization algorithms are theoretically highly efficient for various parameterizations. However, the efficacy of these reduction rules in practice---to aid solving highly challenging benchmark instances to optimality---remains entirely unexplored.\n  We engineer a new suite of efficient data reduction rules that subsume most of the previously published r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10902","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"},"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-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaqPM6LxS8SaopKelSftcXqAEzaT7pZcCOnZTrYnom9H9fELODeVtYBC2AHqEwqBQKqXuwaGDbxepd/n5Q1cAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:25.642449Z"},"content_sha256":"7142f4b5d6e7058eaae589bf0c719f042c0d76d7e37a95a6dfbe295388249308","schema_version":"1.0","event_id":"sha256:7142f4b5d6e7058eaae589bf0c719f042c0d76d7e37a95a6dfbe295388249308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATTZWNMXMKYZM34QLQEOU5HHPF/bundle.json","state_url":"https://pith.science/pith/ATTZWNMXMKYZM34QLQEOU5HHPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATTZWNMXMKYZM34QLQEOU5HHPF/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-05-30T03:33:25Z","links":{"resolver":"https://pith.science/pith/ATTZWNMXMKYZM34QLQEOU5HHPF","bundle":"https://pith.science/pith/ATTZWNMXMKYZM34QLQEOU5HHPF/bundle.json","state":"https://pith.science/pith/ATTZWNMXMKYZM34QLQEOU5HHPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATTZWNMXMKYZM34QLQEOU5HHPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ATTZWNMXMKYZM34QLQEOU5HHPF","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":"f133035e69421a20daa76f0abb06fd2c14731c342b43e31f3ef04536564d3342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T23:12:33Z","title_canon_sha256":"d60168d7048f1bbdd42b254e6b2def4e5e5d5d4602b2aeb576eab2aeb68905c9"},"schema_version":"1.0","source":{"id":"1905.10902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10902","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10902v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10902","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"ATTZWNMXMKYZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ATTZWNMXMKYZM34Q","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ATTZWNMX","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:7142f4b5d6e7058eaae589bf0c719f042c0d76d7e37a95a6dfbe295388249308","target":"graph","created_at":"2026-05-17T23:45:03Z","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"},"paper":{"abstract_excerpt":"Kernelization is a general theoretical framework for preprocessing instances of NP-hard problems into (generally smaller) instances with bounded size, via the repeated application of data reduction rules. For the fundamental Max Cut problem, kernelization algorithms are theoretically highly efficient for various parameterizations. However, the efficacy of these reduction rules in practice---to aid solving highly challenging benchmark instances to optimality---remains entirely unexplored.\n  We engineer a new suite of efficient data reduction rules that subsume most of the previously published r","authors_text":"Christian Schulz, Damir Ferizovic, Darren Strash, Demian Hespe, Matthias Mnich, Sebastian Lamm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T23:12:33Z","title":"Engineering Kernelization for Maximum Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10902","kind":"arxiv","version":1},"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:38222ee95e0e3782bb1ce491e11f10549f580de583cc304e77b43d069ac11f55","target":"record","created_at":"2026-05-17T23:45:03Z","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":"f133035e69421a20daa76f0abb06fd2c14731c342b43e31f3ef04536564d3342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T23:12:33Z","title_canon_sha256":"d60168d7048f1bbdd42b254e6b2def4e5e5d5d4602b2aeb576eab2aeb68905c9"},"schema_version":"1.0","source":{"id":"1905.10902","kind":"arxiv","version":1}},"canonical_sha256":"04e79b359762b1966f905c08ea74e7796e4f65736f15b9270da8acc18b8d31c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04e79b359762b1966f905c08ea74e7796e4f65736f15b9270da8acc18b8d31c6","first_computed_at":"2026-05-17T23:45:03.464996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.464996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7PNU2Wk832hCsMLU+ndZZA1fLrfdYrRHFwaw4MHee4QlfF0zqwKgGv+sJ0Nsr0+/8Nc4Jl2JmCEdRCm4H4n7Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.465610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38222ee95e0e3782bb1ce491e11f10549f580de583cc304e77b43d069ac11f55","sha256:7142f4b5d6e7058eaae589bf0c719f042c0d76d7e37a95a6dfbe295388249308"],"state_sha256":"3195cc46ba536b314efe4f3b89ad4377e184ab96403b6e2b933b50dd36239e60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6daLc5qQgFu2jtnQwQuFQe7eSQEGwILDp9/Kucux7tW+5d+IUPimjAjp9TUhpIzz6XZB5axqF6XeAobyBVVgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:33:25.645199Z","bundle_sha256":"db1a439cc97b459c90e43a921962246b1dc751da9aa8e2bcd34dadda887db2fd"}}