{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WYLBUUGINPTDKYA45BFHEMHWWJ","short_pith_number":"pith:WYLBUUGI","schema_version":"1.0","canonical_sha256":"b6161a50c86be635601ce84a7230f6b26430255f6b0da1ab6b712fe4b1a0a685","source":{"kind":"arxiv","id":"2606.29252","version":1},"attestation_state":"computed","paper":{"title":"Learning to Bid in Discriminatory Auctions with Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Negin Golrezaei, Sourav Sahoo","submitted_at":"2026-06-28T07:49:34Z","abstract_excerpt":"We study repeated bidding in multi-unit discriminatory (pay-as-bid) auctions for a single bidder with per-round utility equal to value minus $\\alpha$ times payment, where $\\alpha\\in[0,1]$ is a cost-of-capital parameter. The bidder aims to maximize cumulative utility over $T$ rounds subject to a total budget $B$. The problem is challenging even without budgets: the action space is exponential in $M$, the maximum demand of the bidder and the valuation vector (context) varies over time. Exploiting a decomposition of utility across units, we develop polynomial-time learning algorithms based on sho"},"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":"2606.29252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-28T07:49:34Z","cross_cats_sorted":[],"title_canon_sha256":"7db226cf405a8755057c072f9a879ad06acd85e85e18ce94addfe80b453f446a","abstract_canon_sha256":"626d7a680d7dd5a8adcab4e9a3fddeea5fbb93f233416fd5cd712ddacd21f019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:59.126183Z","signature_b64":"vlaGpLqqPA56ke+Khxk91wtT3kd7VrSbKi99KZMkoVN6hscV9MbADyAvH9O25yrnVcVs2R1nQgrl3kvLuTrACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6161a50c86be635601ce84a7230f6b26430255f6b0da1ab6b712fe4b1a0a685","last_reissued_at":"2026-06-30T01:17:59.123268Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:59.123268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Bid in Discriminatory Auctions with Budget Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Negin Golrezaei, Sourav Sahoo","submitted_at":"2026-06-28T07:49:34Z","abstract_excerpt":"We study repeated bidding in multi-unit discriminatory (pay-as-bid) auctions for a single bidder with per-round utility equal to value minus $\\alpha$ times payment, where $\\alpha\\in[0,1]$ is a cost-of-capital parameter. The bidder aims to maximize cumulative utility over $T$ rounds subject to a total budget $B$. The problem is challenging even without budgets: the action space is exponential in $M$, the maximum demand of the bidder and the valuation vector (context) varies over time. Exploiting a decomposition of utility across units, we develop polynomial-time learning algorithms based on sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29252","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/2606.29252/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":"2606.29252","created_at":"2026-06-30T01:17:59.125321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29252v1","created_at":"2026-06-30T01:17:59.125321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29252","created_at":"2026-06-30T01:17:59.125321+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYLBUUGINPTD","created_at":"2026-06-30T01:17:59.125321+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYLBUUGINPTDKYA4","created_at":"2026-06-30T01:17:59.125321+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYLBUUGI","created_at":"2026-06-30T01:17:59.125321+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/WYLBUUGINPTDKYA45BFHEMHWWJ","json":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ.json","graph_json":"https://pith.science/api/pith-number/WYLBUUGINPTDKYA45BFHEMHWWJ/graph.json","events_json":"https://pith.science/api/pith-number/WYLBUUGINPTDKYA45BFHEMHWWJ/events.json","paper":"https://pith.science/paper/WYLBUUGI"},"agent_actions":{"view_html":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ","download_json":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ.json","view_paper":"https://pith.science/paper/WYLBUUGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29252&json=true","fetch_graph":"https://pith.science/api/pith-number/WYLBUUGINPTDKYA45BFHEMHWWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WYLBUUGINPTDKYA45BFHEMHWWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ/action/storage_attestation","attest_author":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ/action/author_attestation","sign_citation":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ/action/citation_signature","submit_replication":"https://pith.science/pith/WYLBUUGINPTDKYA45BFHEMHWWJ/action/replication_record"}},"created_at":"2026-06-30T01:17:59.125321+00:00","updated_at":"2026-06-30T01:17:59.125321+00:00"}