{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NJMGGFNKJJWIJWWCVUJLAIKJV6","short_pith_number":"pith:NJMGGFNK","canonical_record":{"source":{"id":"1809.05340","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-14T10:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"d4ee4760a68fbd5f8e579bfaccadbc42d792e2334bd2da28979e44623655e256","abstract_canon_sha256":"7b58ef8133ed75cd2878af56723e9e792986a3dc1a871cf66925686d5821e97c"},"schema_version":"1.0"},"canonical_sha256":"6a586315aa4a6c84dac2ad12b02149afa07263ac2611e24d99762e83d0bdcb36","source":{"kind":"arxiv","id":"1809.05340","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05340","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05340v6","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05340","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"NJMGGFNKJJWI","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJMGGFNKJJWIJWWC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJMGGFNK","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NJMGGFNKJJWIJWWCVUJLAIKJV6","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05340","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-14T10:20:12Z","cross_cats_sorted":[],"title_canon_sha256":"d4ee4760a68fbd5f8e579bfaccadbc42d792e2334bd2da28979e44623655e256","abstract_canon_sha256":"7b58ef8133ed75cd2878af56723e9e792986a3dc1a871cf66925686d5821e97c"},"schema_version":"1.0"},"canonical_sha256":"6a586315aa4a6c84dac2ad12b02149afa07263ac2611e24d99762e83d0bdcb36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:55.871849Z","signature_b64":"8j5iNzoBAoyITwgQL1BqAT2MVKvsQ9JYGxn5JC5Kz9ewQyxACiEMhmDvK4qa6GYYz7h2PKhLtf0TdEsHwsOYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a586315aa4a6c84dac2ad12b02149afa07263ac2611e24d99762e83d0bdcb36","last_reissued_at":"2026-05-17T23:40:55.871178Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:55.871178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05340","source_version":6,"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-17T23:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5hVoB7OEm6waYx99lvt6cdJpjYWzthLPr3RriCET2w609lPNSlJQEgcF7LWw5vV1lZCDvlcAMAmVIMCWjs9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:15:00.099569Z"},"content_sha256":"f4c0192fff11912bf8dec2ca0959ea810804a3a921dc9539796cdc15f88be1e3","schema_version":"1.0","event_id":"sha256:f4c0192fff11912bf8dec2ca0959ea810804a3a921dc9539796cdc15f88be1e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NJMGGFNKJJWIJWWCVUJLAIKJV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Iterative Combinatorial Auctions via Bayesian Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Gianluca Brero, S\\'ebastien Lahaie, Sven Seuken","submitted_at":"2018-09-14T10:20:12Z","abstract_excerpt":"Iterative combinatorial auctions (CAs) are often used in multi-billion dollar domains like spectrum auctions, and speed of convergence is one of the crucial factors behind the choice of a specific design for practical applications. To achieve fast convergence, current CAs require careful tuning of the price update rule to balance convergence speed and allocative efficiency. Brero and Lahaie (2018) recently introduced a Bayesian iterative auction design for settings with single-minded bidders. The Bayesian approach allowed them to incorporate prior knowledge into the price update algorithm, red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05340","kind":"arxiv","version":6},"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-17T23:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wHararbV09RxBbz60UoomKwbYkJykWewQERtA16dOuyIKhLMFEXQPJ1jm3KszoxyRO5TbULNlmhRz5Zo5cCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:15:00.100222Z"},"content_sha256":"84446e04767db64b8bcffff1da55455a0cad1c7ba27087dfb3ef0934cf21f7c9","schema_version":"1.0","event_id":"sha256:84446e04767db64b8bcffff1da55455a0cad1c7ba27087dfb3ef0934cf21f7c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6/bundle.json","state_url":"https://pith.science/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6/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-26T18:15:00Z","links":{"resolver":"https://pith.science/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6","bundle":"https://pith.science/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6/bundle.json","state":"https://pith.science/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJMGGFNKJJWIJWWCVUJLAIKJV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NJMGGFNKJJWIJWWCVUJLAIKJV6","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":"7b58ef8133ed75cd2878af56723e9e792986a3dc1a871cf66925686d5821e97c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-14T10:20:12Z","title_canon_sha256":"d4ee4760a68fbd5f8e579bfaccadbc42d792e2334bd2da28979e44623655e256"},"schema_version":"1.0","source":{"id":"1809.05340","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05340","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05340v6","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05340","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"NJMGGFNKJJWI","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJMGGFNKJJWIJWWC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJMGGFNK","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:84446e04767db64b8bcffff1da55455a0cad1c7ba27087dfb3ef0934cf21f7c9","target":"graph","created_at":"2026-05-17T23:40:55Z","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":"Iterative combinatorial auctions (CAs) are often used in multi-billion dollar domains like spectrum auctions, and speed of convergence is one of the crucial factors behind the choice of a specific design for practical applications. To achieve fast convergence, current CAs require careful tuning of the price update rule to balance convergence speed and allocative efficiency. Brero and Lahaie (2018) recently introduced a Bayesian iterative auction design for settings with single-minded bidders. The Bayesian approach allowed them to incorporate prior knowledge into the price update algorithm, red","authors_text":"Gianluca Brero, S\\'ebastien Lahaie, Sven Seuken","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-14T10:20:12Z","title":"Fast Iterative Combinatorial Auctions via Bayesian Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05340","kind":"arxiv","version":6},"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:f4c0192fff11912bf8dec2ca0959ea810804a3a921dc9539796cdc15f88be1e3","target":"record","created_at":"2026-05-17T23:40:55Z","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":"7b58ef8133ed75cd2878af56723e9e792986a3dc1a871cf66925686d5821e97c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-14T10:20:12Z","title_canon_sha256":"d4ee4760a68fbd5f8e579bfaccadbc42d792e2334bd2da28979e44623655e256"},"schema_version":"1.0","source":{"id":"1809.05340","kind":"arxiv","version":6}},"canonical_sha256":"6a586315aa4a6c84dac2ad12b02149afa07263ac2611e24d99762e83d0bdcb36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a586315aa4a6c84dac2ad12b02149afa07263ac2611e24d99762e83d0bdcb36","first_computed_at":"2026-05-17T23:40:55.871178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:55.871178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8j5iNzoBAoyITwgQL1BqAT2MVKvsQ9JYGxn5JC5Kz9ewQyxACiEMhmDvK4qa6GYYz7h2PKhLtf0TdEsHwsOYDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:55.871849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05340","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4c0192fff11912bf8dec2ca0959ea810804a3a921dc9539796cdc15f88be1e3","sha256:84446e04767db64b8bcffff1da55455a0cad1c7ba27087dfb3ef0934cf21f7c9"],"state_sha256":"6a02315c01f09b9b4aae6fc8ba1918943c1f33f33e47ba96e1ca61f7c8976d74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXPIVd8I6VbV1s2gXGnODXGgGDlgHl2+IHXDC/Th+6qfsyAO62SoM/uZWwt3XIXHoHgKHF4PVf4fAC68zwFgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:15:00.103667Z","bundle_sha256":"7fbe4e8675297a8a84c54fb967530b16078b378c7387a36bcf18d770621b1064"}}