{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XYJCD2R7H442VQLMKFVPDNY76W","short_pith_number":"pith:XYJCD2R7","schema_version":"1.0","canonical_sha256":"be1221ea3f3f39aac16c516af1b71ff5a11a38c692a2fa82d10887f8b9d1200a","source":{"kind":"arxiv","id":"2310.02879","version":2},"attestation_state":"computed","paper":{"title":"Online Mechanism Design with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Cherlin Zhu, Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan","submitted_at":"2023-10-04T15:17:28Z","abstract_excerpt":"Aiming to overcome some of the limitations of worst-case analysis, the recently proposed framework of \"algorithms with predictions\" allows algorithms to be augmented with a (possibly erroneous) machine-learned prediction that they can use as a guide. In this framework, the goal is to obtain improved guarantees when the prediction is correct, which is called \\emph{consistency}, while simultaneously guaranteeing some worst-case bounds even when the prediction is arbitrarily wrong, which is called \\emph{robustness}. The vast majority of the work on this framework has focused on a refined analysis"},"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":"2310.02879","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-10-04T15:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"fe51ab77130493df5919aff4ccc974bcb2ab209e0f61fd7959d1790f03a033f1","abstract_canon_sha256":"c1be9684b513459e57090f5a0846f6cc639dd780fbc4b6bf449c47d11b71df92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:00.262027Z","signature_b64":"oit3sz0bCL1MyIUIAlKhHLmBR9RZMHm7NzcByWsvps4TH2J69+m43INMXgwslfKVqG28fVOQGY8EKRgU8wvjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be1221ea3f3f39aac16c516af1b71ff5a11a38c692a2fa82d10887f8b9d1200a","last_reissued_at":"2026-07-05T08:01:00.261614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:00.261614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Mechanism Design with Predictions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Cherlin Zhu, Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan","submitted_at":"2023-10-04T15:17:28Z","abstract_excerpt":"Aiming to overcome some of the limitations of worst-case analysis, the recently proposed framework of \"algorithms with predictions\" allows algorithms to be augmented with a (possibly erroneous) machine-learned prediction that they can use as a guide. In this framework, the goal is to obtain improved guarantees when the prediction is correct, which is called \\emph{consistency}, while simultaneously guaranteeing some worst-case bounds even when the prediction is arbitrarily wrong, which is called \\emph{robustness}. The vast majority of the work on this framework has focused on a refined analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.02879","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/2310.02879/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":"2310.02879","created_at":"2026-07-05T08:01:00.261668+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.02879v2","created_at":"2026-07-05T08:01:00.261668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.02879","created_at":"2026-07-05T08:01:00.261668+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYJCD2R7H442","created_at":"2026-07-05T08:01:00.261668+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYJCD2R7H442VQLM","created_at":"2026-07-05T08:01:00.261668+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYJCD2R7","created_at":"2026-07-05T08:01:00.261668+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00101","citing_title":"From Welfare to Utility: Generalized Objectives in Budget-Feasible Procurement","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2302.14234","citing_title":"Bicriteria Multidimensional Mechanism Design with Side Information","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W","json":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W.json","graph_json":"https://pith.science/api/pith-number/XYJCD2R7H442VQLMKFVPDNY76W/graph.json","events_json":"https://pith.science/api/pith-number/XYJCD2R7H442VQLMKFVPDNY76W/events.json","paper":"https://pith.science/paper/XYJCD2R7"},"agent_actions":{"view_html":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W","download_json":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W.json","view_paper":"https://pith.science/paper/XYJCD2R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.02879&json=true","fetch_graph":"https://pith.science/api/pith-number/XYJCD2R7H442VQLMKFVPDNY76W/graph.json","fetch_events":"https://pith.science/api/pith-number/XYJCD2R7H442VQLMKFVPDNY76W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W/action/storage_attestation","attest_author":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W/action/author_attestation","sign_citation":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W/action/citation_signature","submit_replication":"https://pith.science/pith/XYJCD2R7H442VQLMKFVPDNY76W/action/replication_record"}},"created_at":"2026-07-05T08:01:00.261668+00:00","updated_at":"2026-07-05T08:01:00.261668+00:00"}