{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GL3XNIONXOEM4QXW5BSE4HAQYE","short_pith_number":"pith:GL3XNION","schema_version":"1.0","canonical_sha256":"32f776a1cdbb88ce42f6e8644e1c10c120508ab8e516df5e565f5d82b686b591","source":{"kind":"arxiv","id":"2411.16600","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Combinatorial Optimization with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam Polak, Antonios Antoniadis, Marek Eli\\'a\\v{s}, Moritz Venzin","submitted_at":"2024-11-25T17:31:34Z","abstract_excerpt":"We initiate a systematic study of utilizing predictions to improve over approximation guarantees of classic algorithms, without increasing the running time. We propose a systematic method for a wide class of optimization problems that ask to select a feasible subset of input items of minimal (or maximal) total weight. This gives simple (near-)linear time algorithms for, e.g., Vertex Cover, Steiner Tree, Min-Weight Perfect Matching, Knapsack, and Clique. Our algorithms produce optimal solutions when provided with perfect predictions and their approximation ratios smoothly degrade with increasin"},"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":"2411.16600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T17:31:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1434d54bbcc5d8ef2eb1b58bd0f74a9a9984fc8adacff6ac03f80f82d7f434b3","abstract_canon_sha256":"e1bad0887a16b0dc821c705594ac2d571579ddc84bd62eb71a63b3bff0e0fab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:11.695376Z","signature_b64":"7FPvqD0eSh22G8cIH0nP0zYn8vH18qnCGW+6HW8JLoXsbFb8nar5GN9Idplm30MDfhfLsPaBrqtz8tWViMSDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f776a1cdbb88ce42f6e8644e1c10c120508ab8e516df5e565f5d82b686b591","last_reissued_at":"2026-07-05T09:40:11.694981Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:11.694981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Combinatorial Optimization with Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Adam Polak, Antonios Antoniadis, Marek Eli\\'a\\v{s}, Moritz Venzin","submitted_at":"2024-11-25T17:31:34Z","abstract_excerpt":"We initiate a systematic study of utilizing predictions to improve over approximation guarantees of classic algorithms, without increasing the running time. We propose a systematic method for a wide class of optimization problems that ask to select a feasible subset of input items of minimal (or maximal) total weight. This gives simple (near-)linear time algorithms for, e.g., Vertex Cover, Steiner Tree, Min-Weight Perfect Matching, Knapsack, and Clique. Our algorithms produce optimal solutions when provided with perfect predictions and their approximation ratios smoothly degrade with increasin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16600","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.16600/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":"2411.16600","created_at":"2026-07-05T09:40:11.695040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16600v1","created_at":"2026-07-05T09:40:11.695040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16600","created_at":"2026-07-05T09:40:11.695040+00:00"},{"alias_kind":"pith_short_12","alias_value":"GL3XNIONXOEM","created_at":"2026-07-05T09:40:11.695040+00:00"},{"alias_kind":"pith_short_16","alias_value":"GL3XNIONXOEM4QXW","created_at":"2026-07-05T09:40:11.695040+00:00"},{"alias_kind":"pith_short_8","alias_value":"GL3XNION","created_at":"2026-07-05T09:40:11.695040+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07756","citing_title":"The Importance of Encoder Choice:A Tabular-Image Study","ref_index":187,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE","json":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE.json","graph_json":"https://pith.science/api/pith-number/GL3XNIONXOEM4QXW5BSE4HAQYE/graph.json","events_json":"https://pith.science/api/pith-number/GL3XNIONXOEM4QXW5BSE4HAQYE/events.json","paper":"https://pith.science/paper/GL3XNION"},"agent_actions":{"view_html":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE","download_json":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE.json","view_paper":"https://pith.science/paper/GL3XNION","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16600&json=true","fetch_graph":"https://pith.science/api/pith-number/GL3XNIONXOEM4QXW5BSE4HAQYE/graph.json","fetch_events":"https://pith.science/api/pith-number/GL3XNIONXOEM4QXW5BSE4HAQYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE/action/storage_attestation","attest_author":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE/action/author_attestation","sign_citation":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE/action/citation_signature","submit_replication":"https://pith.science/pith/GL3XNIONXOEM4QXW5BSE4HAQYE/action/replication_record"}},"created_at":"2026-07-05T09:40:11.695040+00:00","updated_at":"2026-07-05T09:40:11.695040+00:00"}