{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L4NQSQ7G2WBASXTSTE57BYBBS7","short_pith_number":"pith:L4NQSQ7G","schema_version":"1.0","canonical_sha256":"5f1b0943e6d582095e72993bf0e02197e613b435ed267acc2ee509916797fd1d","source":{"kind":"arxiv","id":"2606.05108","version":1},"attestation_state":"computed","paper":{"title":"Gradient Dynamics in First-Price Auctions: Iterative Strategy Elimination via Cubic Potentials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Mete \\c{S}eref Ahunbay, Tao Lin, Weiqiang Zheng","submitted_at":"2026-06-03T17:10:33Z","abstract_excerpt":"We show that in discretised first-price auctions with complete information, if the buyers learn to bid with online gradient ascent, in time-average the outcome is (almost) the efficient outcome of the second-price auction. Our proof rests on two novel innovations in the analysis of online gradient ascent in normal-form games, which may be useful in a wider range of applications. First, we develop a potential-function-based argument for the analysis of gradient ascent in normal-form games, allowing us to deduce that certain strategies will not be played in time-average. We provide sufficient co"},"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.05108","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-03T17:10:33Z","cross_cats_sorted":[],"title_canon_sha256":"0b8767f613599dd7ff82df0b2793f727de07cfebde41eb1e9adf6aebe5319efd","abstract_canon_sha256":"26eb62782ab891d8929c11299b0682bb0de58442c4413af963b6823f7dd00621"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:10:06.633859Z","signature_b64":"9yyIOzASgwyvM8EITz2RraKAeeyWs/kmPcaGvfPnp5LIr1zAlFyaAjV35hBCCsnEAfFlFNtEBOfG3ycgCrsPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f1b0943e6d582095e72993bf0e02197e613b435ed267acc2ee509916797fd1d","last_reissued_at":"2026-06-04T01:10:06.633333Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:10:06.633333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Dynamics in First-Price Auctions: Iterative Strategy Elimination via Cubic Potentials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Mete \\c{S}eref Ahunbay, Tao Lin, Weiqiang Zheng","submitted_at":"2026-06-03T17:10:33Z","abstract_excerpt":"We show that in discretised first-price auctions with complete information, if the buyers learn to bid with online gradient ascent, in time-average the outcome is (almost) the efficient outcome of the second-price auction. Our proof rests on two novel innovations in the analysis of online gradient ascent in normal-form games, which may be useful in a wider range of applications. First, we develop a potential-function-based argument for the analysis of gradient ascent in normal-form games, allowing us to deduce that certain strategies will not be played in time-average. We provide sufficient co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05108","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.05108/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.05108","created_at":"2026-06-04T01:10:06.633407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05108v1","created_at":"2026-06-04T01:10:06.633407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05108","created_at":"2026-06-04T01:10:06.633407+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4NQSQ7G2WBA","created_at":"2026-06-04T01:10:06.633407+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4NQSQ7G2WBASXTS","created_at":"2026-06-04T01:10:06.633407+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4NQSQ7G","created_at":"2026-06-04T01:10:06.633407+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/L4NQSQ7G2WBASXTSTE57BYBBS7","json":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7.json","graph_json":"https://pith.science/api/pith-number/L4NQSQ7G2WBASXTSTE57BYBBS7/graph.json","events_json":"https://pith.science/api/pith-number/L4NQSQ7G2WBASXTSTE57BYBBS7/events.json","paper":"https://pith.science/paper/L4NQSQ7G"},"agent_actions":{"view_html":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7","download_json":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7.json","view_paper":"https://pith.science/paper/L4NQSQ7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05108&json=true","fetch_graph":"https://pith.science/api/pith-number/L4NQSQ7G2WBASXTSTE57BYBBS7/graph.json","fetch_events":"https://pith.science/api/pith-number/L4NQSQ7G2WBASXTSTE57BYBBS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7/action/storage_attestation","attest_author":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7/action/author_attestation","sign_citation":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7/action/citation_signature","submit_replication":"https://pith.science/pith/L4NQSQ7G2WBASXTSTE57BYBBS7/action/replication_record"}},"created_at":"2026-06-04T01:10:06.633407+00:00","updated_at":"2026-06-04T01:10:06.633407+00:00"}