{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MUOTMUGGQ4HRRXMLTPR5AXJJJY","short_pith_number":"pith:MUOTMUGG","schema_version":"1.0","canonical_sha256":"651d3650c6870f18dd8b9be3d05d294e231c705deac870b83e575298f597a570","source":{"kind":"arxiv","id":"2406.18752","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Adam Lechowicz, Bo Sun, Cameron Musco, Helia Karisani, Mohammad Hajiesmaili, Mohammadreza Daneshvaramoli","submitted_at":"2024-06-26T20:38:00Z","abstract_excerpt":"This paper introduces a family of learning-augmented algorithms for online knapsack problems that achieve near Pareto-optimal consistency-robustness trade-offs through a simple combination of trusted learning-augmented and worst-case algorithms. Our approach relies on succinct, practical predictions -- single values or intervals estimating the minimum value of any item in an offline solution. Additionally, we propose a novel fractional-to-integral conversion procedure, offering new insights for online algorithm design."},"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":"2406.18752","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-26T20:38:00Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d34bfdb67447dc74ece828da823d597837077d490eae8f76ef61afa6e3392dcf","abstract_canon_sha256":"205cf9efa9eb42adc14173d1b4320286d396567c48161dbb56be24b217b4f172"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:58.634067Z","signature_b64":"1YL2N2clNxt9N+x3h14uX6MseX/bNRZqm4a5QEO85o9prdG9L5jk7THi5pWRN5Vn8VRZm8uD2s41HHkwqfHeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"651d3650c6870f18dd8b9be3d05d294e231c705deac870b83e575298f597a570","last_reissued_at":"2026-07-05T11:33:58.633617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:58.633617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Adam Lechowicz, Bo Sun, Cameron Musco, Helia Karisani, Mohammad Hajiesmaili, Mohammadreza Daneshvaramoli","submitted_at":"2024-06-26T20:38:00Z","abstract_excerpt":"This paper introduces a family of learning-augmented algorithms for online knapsack problems that achieve near Pareto-optimal consistency-robustness trade-offs through a simple combination of trusted learning-augmented and worst-case algorithms. Our approach relies on succinct, practical predictions -- single values or intervals estimating the minimum value of any item in an offline solution. Additionally, we propose a novel fractional-to-integral conversion procedure, offering new insights for online algorithm design."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18752","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/2406.18752/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":"2406.18752","created_at":"2026-07-05T11:33:58.633673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18752v2","created_at":"2026-07-05T11:33:58.633673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18752","created_at":"2026-07-05T11:33:58.633673+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUOTMUGGQ4HR","created_at":"2026-07-05T11:33:58.633673+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUOTMUGGQ4HRRXML","created_at":"2026-07-05T11:33:58.633673+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUOTMUGG","created_at":"2026-07-05T11:33:58.633673+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09717","citing_title":"Carbon- and Precedence-Aware Scheduling for Data Processing Clusters","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY","json":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY.json","graph_json":"https://pith.science/api/pith-number/MUOTMUGGQ4HRRXMLTPR5AXJJJY/graph.json","events_json":"https://pith.science/api/pith-number/MUOTMUGGQ4HRRXMLTPR5AXJJJY/events.json","paper":"https://pith.science/paper/MUOTMUGG"},"agent_actions":{"view_html":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY","download_json":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY.json","view_paper":"https://pith.science/paper/MUOTMUGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18752&json=true","fetch_graph":"https://pith.science/api/pith-number/MUOTMUGGQ4HRRXMLTPR5AXJJJY/graph.json","fetch_events":"https://pith.science/api/pith-number/MUOTMUGGQ4HRRXMLTPR5AXJJJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY/action/storage_attestation","attest_author":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY/action/author_attestation","sign_citation":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY/action/citation_signature","submit_replication":"https://pith.science/pith/MUOTMUGGQ4HRRXMLTPR5AXJJJY/action/replication_record"}},"created_at":"2026-07-05T11:33:58.633673+00:00","updated_at":"2026-07-05T11:33:58.633673+00:00"}