{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4UTDBGH5LGJTCNXBQTUST7CBUS","short_pith_number":"pith:4UTDBGH5","canonical_record":{"source":{"id":"1511.06017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T22:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"db7c36be91985a00dd4884acf332b48946b9020044bd83c5721a93bdee28e09c","abstract_canon_sha256":"06b8a6f723c310b6d99daa191008ca80250af318c8ebc3fe7b10b1e8edf2c3ce"},"schema_version":"1.0"},"canonical_sha256":"e5263098fd59933136e184e929fc41a4bf1b3012bb513bf40a27d4ef79c8f6bb","source":{"kind":"arxiv","id":"1511.06017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06017","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06017v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06017","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"4UTDBGH5LGJT","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UTDBGH5LGJTCNXB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UTDBGH5","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4UTDBGH5LGJTCNXBQTUST7CBUS","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T22:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"db7c36be91985a00dd4884acf332b48946b9020044bd83c5721a93bdee28e09c","abstract_canon_sha256":"06b8a6f723c310b6d99daa191008ca80250af318c8ebc3fe7b10b1e8edf2c3ce"},"schema_version":"1.0"},"canonical_sha256":"e5263098fd59933136e184e929fc41a4bf1b3012bb513bf40a27d4ef79c8f6bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:16.246964Z","signature_b64":"GZUm280Awnzvc5XK8cO//VR5ZODhUMsnHoEszU7Yq5duFr6m2Sb3urJUqvEw+DtIIUxBOctlal/ShdtsukdXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5263098fd59933136e184e929fc41a4bf1b3012bb513bf40a27d4ef79c8f6bb","last_reissued_at":"2026-05-18T01:13:16.246529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:16.246529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06017","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYvBY5VKxYPm3PkgbwwqYzU/jhtlA1HxD4rD/H2dc1kK8oo0/udYucjEZ/N5IsS8DR4KceYBEru49zLvl1NJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:40:41.879531Z"},"content_sha256":"59e27a60b8bab890866389ac644327a09559afe0f8204256e1d8293a727265d6","schema_version":"1.0","event_id":"sha256:59e27a60b8bab890866389ac644327a09559afe0f8204256e1d8293a727265d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4UTDBGH5LGJTCNXBQTUST7CBUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate of Price Discovery in Iterative Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jacob Abernethy, Matus Telgarsky, S\\'ebastien Lahaie","submitted_at":"2015-11-18T22:59:54Z","abstract_excerpt":"We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class, bounding the number of auction rounds needed to reach clearing prices. Our analysis allows for a variety of pricing schemes, including item, bundle, and polynomial pricing, and the respective convergence rates confirm that more expressive pricing schemes come at the cost of slower convergence. We consider two models of bidder behavior. In the first model, bidders"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06017","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsMTYutja21r5IjySXl729xeIRwW2ILwxTVTgW7gxmOMetqMIO8b4mDeTOr/c1bsq5y9QvWcdsfvUOi8lwc3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:40:41.880141Z"},"content_sha256":"eecd0a865e754d9a620730ab6388f31d6472b75e619e1c44e62c798dbc4bf65c","schema_version":"1.0","event_id":"sha256:eecd0a865e754d9a620730ab6388f31d6472b75e619e1c44e62c798dbc4bf65c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UTDBGH5LGJTCNXBQTUST7CBUS/bundle.json","state_url":"https://pith.science/pith/4UTDBGH5LGJTCNXBQTUST7CBUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UTDBGH5LGJTCNXBQTUST7CBUS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T11:40:41Z","links":{"resolver":"https://pith.science/pith/4UTDBGH5LGJTCNXBQTUST7CBUS","bundle":"https://pith.science/pith/4UTDBGH5LGJTCNXBQTUST7CBUS/bundle.json","state":"https://pith.science/pith/4UTDBGH5LGJTCNXBQTUST7CBUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UTDBGH5LGJTCNXBQTUST7CBUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4UTDBGH5LGJTCNXBQTUST7CBUS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"06b8a6f723c310b6d99daa191008ca80250af318c8ebc3fe7b10b1e8edf2c3ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T22:59:54Z","title_canon_sha256":"db7c36be91985a00dd4884acf332b48946b9020044bd83c5721a93bdee28e09c"},"schema_version":"1.0","source":{"id":"1511.06017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06017","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06017v2","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06017","created_at":"2026-05-18T01:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"4UTDBGH5LGJT","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UTDBGH5LGJTCNXB","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UTDBGH5","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:eecd0a865e754d9a620730ab6388f31d6472b75e619e1c44e62c798dbc4bf65c","target":"graph","created_at":"2026-05-18T01:13:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class, bounding the number of auction rounds needed to reach clearing prices. Our analysis allows for a variety of pricing schemes, including item, bundle, and polynomial pricing, and the respective convergence rates confirm that more expressive pricing schemes come at the cost of slower convergence. We consider two models of bidder behavior. In the first model, bidders","authors_text":"Jacob Abernethy, Matus Telgarsky, S\\'ebastien Lahaie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T22:59:54Z","title":"Rate of Price Discovery in Iterative Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06017","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59e27a60b8bab890866389ac644327a09559afe0f8204256e1d8293a727265d6","target":"record","created_at":"2026-05-18T01:13:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"06b8a6f723c310b6d99daa191008ca80250af318c8ebc3fe7b10b1e8edf2c3ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-18T22:59:54Z","title_canon_sha256":"db7c36be91985a00dd4884acf332b48946b9020044bd83c5721a93bdee28e09c"},"schema_version":"1.0","source":{"id":"1511.06017","kind":"arxiv","version":2}},"canonical_sha256":"e5263098fd59933136e184e929fc41a4bf1b3012bb513bf40a27d4ef79c8f6bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5263098fd59933136e184e929fc41a4bf1b3012bb513bf40a27d4ef79c8f6bb","first_computed_at":"2026-05-18T01:13:16.246529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:16.246529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GZUm280Awnzvc5XK8cO//VR5ZODhUMsnHoEszU7Yq5duFr6m2Sb3urJUqvEw+DtIIUxBOctlal/ShdtsukdXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:16.246964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59e27a60b8bab890866389ac644327a09559afe0f8204256e1d8293a727265d6","sha256:eecd0a865e754d9a620730ab6388f31d6472b75e619e1c44e62c798dbc4bf65c"],"state_sha256":"641f815227b23c042b35830cc3ed076f210a9bbc35a4a2e315d7f30926b572c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVYzlSzGWaItqx1xOHO5+ygwEq04bKOt9vQ92IVU2340qNCJi/oQKmJSW8Za830VFdk5E7BuNaQ+H+88ACs1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:40:41.883598Z","bundle_sha256":"e22d0da4de0ce7244ae812943739168ef178a162d5c443e364469190df72dea9"}}