{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:477MGDEJXHL4F3KGDJTPNUTSDM","short_pith_number":"pith:477MGDEJ","schema_version":"1.0","canonical_sha256":"e7fec30c89b9d7c2ed461a66f6d2721b01568109bb3ee406f83826df8f9e4b1b","source":{"kind":"arxiv","id":"2401.13384","version":1},"attestation_state":"computed","paper":{"title":"Randomized learning-augmented auctions with revenue guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Georgios Kalantzis, Ioannis Caragiannis","submitted_at":"2024-01-24T11:24:13Z","abstract_excerpt":"We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume that the agent valuations belong to a known interval, and a (possibly erroneous) prediction for the highest valuation is available. Then, auction design aims for high consistency and robustness, meaning that, for appropriate pairs of values $\\gamma$ and $\\rho$, the extracted revenue should be at least a $\\gamma$- or $\\rho$-fraction of the highest valuation "},"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":"2401.13384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-01-24T11:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"1f045f1cc30a6eb49511f29fe6cf37f5f6a130c45623b3b68c884f62dc3e62c9","abstract_canon_sha256":"8d1a7c7e2e68f5e79d49c8a56840ca0a4b3bb8b189fc67e7c8857773e4149c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:04.725421Z","signature_b64":"OZut4Q9yXSnwjN0s2AV4ZmZchvHvstT4g9wbB02YUPE3GhlxvlhA1j8LhBBUCJiDGZK6/ntgfV0mWvsuK1ydCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7fec30c89b9d7c2ed461a66f6d2721b01568109bb3ee406f83826df8f9e4b1b","last_reissued_at":"2026-07-05T07:37:04.724896Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:04.724896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized learning-augmented auctions with revenue guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Georgios Kalantzis, Ioannis Caragiannis","submitted_at":"2024-01-24T11:24:13Z","abstract_excerpt":"We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume that the agent valuations belong to a known interval, and a (possibly erroneous) prediction for the highest valuation is available. Then, auction design aims for high consistency and robustness, meaning that, for appropriate pairs of values $\\gamma$ and $\\rho$, the extracted revenue should be at least a $\\gamma$- or $\\rho$-fraction of the highest valuation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.13384","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/2401.13384/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":"2401.13384","created_at":"2026-07-05T07:37:04.724946+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.13384v1","created_at":"2026-07-05T07:37:04.724946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.13384","created_at":"2026-07-05T07:37:04.724946+00:00"},{"alias_kind":"pith_short_12","alias_value":"477MGDEJXHL4","created_at":"2026-07-05T07:37:04.724946+00:00"},{"alias_kind":"pith_short_16","alias_value":"477MGDEJXHL4F3KG","created_at":"2026-07-05T07:37:04.724946+00:00"},{"alias_kind":"pith_short_8","alias_value":"477MGDEJ","created_at":"2026-07-05T07:37:04.724946+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2302.14234","citing_title":"Bicriteria Multidimensional Mechanism Design with Side Information","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM","json":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM.json","graph_json":"https://pith.science/api/pith-number/477MGDEJXHL4F3KGDJTPNUTSDM/graph.json","events_json":"https://pith.science/api/pith-number/477MGDEJXHL4F3KGDJTPNUTSDM/events.json","paper":"https://pith.science/paper/477MGDEJ"},"agent_actions":{"view_html":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM","download_json":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM.json","view_paper":"https://pith.science/paper/477MGDEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.13384&json=true","fetch_graph":"https://pith.science/api/pith-number/477MGDEJXHL4F3KGDJTPNUTSDM/graph.json","fetch_events":"https://pith.science/api/pith-number/477MGDEJXHL4F3KGDJTPNUTSDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM/action/storage_attestation","attest_author":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM/action/author_attestation","sign_citation":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM/action/citation_signature","submit_replication":"https://pith.science/pith/477MGDEJXHL4F3KGDJTPNUTSDM/action/replication_record"}},"created_at":"2026-07-05T07:37:04.724946+00:00","updated_at":"2026-07-05T07:37:04.724946+00:00"}