{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LSVH3TOHJ3I2WEVDS23Z5UI2L5","short_pith_number":"pith:LSVH3TOH","schema_version":"1.0","canonical_sha256":"5caa7dcdc74ed1ab12a396b79ed11a5f7c24acdfbc632f6d13a939525a840caa","source":{"kind":"arxiv","id":"1908.06795","version":2},"attestation_state":"computed","paper":{"title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Darren Strash, Demian Hespe, Sebastian Lamm","submitted_at":"2019-08-19T13:34:15Z","abstract_excerpt":"We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelization---the repeated reducing of the input size via data reduction rules---is known to be highly effective in practice. Our algorithm uses a portfolio of techniques, including an aggressive kernelization strategy, local search, branch-and-reduce, and a state-of-the-art branch-and-bound solver. Of particular interest is that several of our techniques were not from the literature on the vertex over problem: they were origi"},"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":"1908.06795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-19T13:34:15Z","cross_cats_sorted":[],"title_canon_sha256":"fc84a783131bcb9415ecb2b2f2dccb49e8ce69a5469a8de76c066cf1bce8a02b","abstract_canon_sha256":"415302502cf9943a80951c358612a1e7d64d3171c13fb79081ce26c24125df1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:29.532844Z","signature_b64":"bj41LCNz+OgBTnCdTT7VIM3X8jnWU68iIXDQ/YZ4krR23cU1yiOYiV4ljPPtUHjQL3gYSNY8HEByOQzIUKMFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5caa7dcdc74ed1ab12a396b79ed11a5f7c24acdfbc632f6d13a939525a840caa","last_reissued_at":"2026-07-04T23:58:29.532429Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:29.532429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Darren Strash, Demian Hespe, Sebastian Lamm","submitted_at":"2019-08-19T13:34:15Z","abstract_excerpt":"We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover Track. The minimum vertex cover problem is one of a handful of problems for which kernelization---the repeated reducing of the input size via data reduction rules---is known to be highly effective in practice. Our algorithm uses a portfolio of techniques, including an aggressive kernelization strategy, local search, branch-and-reduce, and a state-of-the-art branch-and-bound solver. Of particular interest is that several of our techniques were not from the literature on the vertex over problem: they were origi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06795","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06795/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":"1908.06795","created_at":"2026-07-04T23:58:29.532485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06795v2","created_at":"2026-07-04T23:58:29.532485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06795","created_at":"2026-07-04T23:58:29.532485+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSVH3TOHJ3I2","created_at":"2026-07-04T23:58:29.532485+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSVH3TOHJ3I2WEVD","created_at":"2026-07-04T23:58:29.532485+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSVH3TOH","created_at":"2026-07-04T23:58:29.532485+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/LSVH3TOHJ3I2WEVDS23Z5UI2L5","json":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5.json","graph_json":"https://pith.science/api/pith-number/LSVH3TOHJ3I2WEVDS23Z5UI2L5/graph.json","events_json":"https://pith.science/api/pith-number/LSVH3TOHJ3I2WEVDS23Z5UI2L5/events.json","paper":"https://pith.science/paper/LSVH3TOH"},"agent_actions":{"view_html":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5","download_json":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5.json","view_paper":"https://pith.science/paper/LSVH3TOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06795&json=true","fetch_graph":"https://pith.science/api/pith-number/LSVH3TOHJ3I2WEVDS23Z5UI2L5/graph.json","fetch_events":"https://pith.science/api/pith-number/LSVH3TOHJ3I2WEVDS23Z5UI2L5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5/action/storage_attestation","attest_author":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5/action/author_attestation","sign_citation":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5/action/citation_signature","submit_replication":"https://pith.science/pith/LSVH3TOHJ3I2WEVDS23Z5UI2L5/action/replication_record"}},"created_at":"2026-07-04T23:58:29.532485+00:00","updated_at":"2026-07-04T23:58:29.532485+00:00"}