{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SR6R5NXQHHCEVOYQZJIUNGN3VU","short_pith_number":"pith:SR6R5NXQ","schema_version":"1.0","canonical_sha256":"947d1eb6f039c44abb10ca514699bbad0216f77589feb0e8a5a93b6289715268","source":{"kind":"arxiv","id":"1212.2825","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Multi-Unit Auctions with Ordered Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden","submitted_at":"2012-12-12T14:14:40Z","abstract_excerpt":"We construct prior-free auctions with constant-factor approximation guarantees with ordered bidders, in both unlimited and limited supply settings. We compare the expected revenue of our auctions on a bid vector to the monotone price benchmark, the maximum revenue that can be obtained from a bid vector using supply-respecting prices that are nonincreasing in the bidder ordering and bounded above by the second-highest bid. As a consequence, our auctions are simultaneously near-optimal in a wide range of Bayesian multi-unit environments."},"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":"1212.2825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-12-12T14:14:40Z","cross_cats_sorted":[],"title_canon_sha256":"da3792e2fc8b88a4ad62add167c6bff5aa6aea462df05847b43d613a50393252","abstract_canon_sha256":"21f1e2ca3d353585df9bbdb92196f94dd1b990d9ae8c27f69b60ffb7036ee962"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:35.245001Z","signature_b64":"1fcNjRG3I4RcgFiDcK+6+TyEzEMfQPxXfdo/DIiwYI7B9dGzmOVATJ+IaBmqOeD/+Ecz1K/Pc7l4dScdytU8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"947d1eb6f039c44abb10ca514699bbad0216f77589feb0e8a5a93b6289715268","last_reissued_at":"2026-05-18T03:38:35.244308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:35.244308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Multi-Unit Auctions with Ordered Bidders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden","submitted_at":"2012-12-12T14:14:40Z","abstract_excerpt":"We construct prior-free auctions with constant-factor approximation guarantees with ordered bidders, in both unlimited and limited supply settings. We compare the expected revenue of our auctions on a bid vector to the monotone price benchmark, the maximum revenue that can be obtained from a bid vector using supply-respecting prices that are nonincreasing in the bidder ordering and bounded above by the second-highest bid. As a consequence, our auctions are simultaneously near-optimal in a wide range of Bayesian multi-unit environments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2825","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":""},"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":"1212.2825","created_at":"2026-05-18T03:38:35.244414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2825v1","created_at":"2026-05-18T03:38:35.244414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2825","created_at":"2026-05-18T03:38:35.244414+00:00"},{"alias_kind":"pith_short_12","alias_value":"SR6R5NXQHHCE","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SR6R5NXQHHCEVOYQ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SR6R5NXQ","created_at":"2026-05-18T12:27:20.899486+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/SR6R5NXQHHCEVOYQZJIUNGN3VU","json":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU.json","graph_json":"https://pith.science/api/pith-number/SR6R5NXQHHCEVOYQZJIUNGN3VU/graph.json","events_json":"https://pith.science/api/pith-number/SR6R5NXQHHCEVOYQZJIUNGN3VU/events.json","paper":"https://pith.science/paper/SR6R5NXQ"},"agent_actions":{"view_html":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU","download_json":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU.json","view_paper":"https://pith.science/paper/SR6R5NXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2825&json=true","fetch_graph":"https://pith.science/api/pith-number/SR6R5NXQHHCEVOYQZJIUNGN3VU/graph.json","fetch_events":"https://pith.science/api/pith-number/SR6R5NXQHHCEVOYQZJIUNGN3VU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU/action/storage_attestation","attest_author":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU/action/author_attestation","sign_citation":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU/action/citation_signature","submit_replication":"https://pith.science/pith/SR6R5NXQHHCEVOYQZJIUNGN3VU/action/replication_record"}},"created_at":"2026-05-18T03:38:35.244414+00:00","updated_at":"2026-05-18T03:38:35.244414+00:00"}