{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:75Y45T6BKGOST6DCM453C5TI6Y","short_pith_number":"pith:75Y45T6B","canonical_record":{"source":{"id":"1712.05291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-14T15:34:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4a38814028ba8e9259a7a634b27e85dfbb8f06c3c90f816de90643701652bd93","abstract_canon_sha256":"c8cd04ad6292a136593fd9f85490d768f5c5051fa67a7ae55761135812e2f0ec"},"schema_version":"1.0"},"canonical_sha256":"ff71cecfc1519d29f862673bb17668f60805c1e27fc0e67e2dfc161d59dc0d14","source":{"kind":"arxiv","id":"1712.05291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05291","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05291v2","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05291","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"75Y45T6BKGOS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"75Y45T6BKGOST6DC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"75Y45T6B","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:75Y45T6BKGOST6DCM453C5TI6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-14T15:34:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4a38814028ba8e9259a7a634b27e85dfbb8f06c3c90f816de90643701652bd93","abstract_canon_sha256":"c8cd04ad6292a136593fd9f85490d768f5c5051fa67a7ae55761135812e2f0ec"},"schema_version":"1.0"},"canonical_sha256":"ff71cecfc1519d29f862673bb17668f60805c1e27fc0e67e2dfc161d59dc0d14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:35.359398Z","signature_b64":"Rg7kIs/Tpc2eiT5nHjhXiyOydUKXSe68vCKDci/ATB594Vz7l52G2JIQJgPOe4/o+5hfd7lRK1dK9rl59TfZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff71cecfc1519d29f862673bb17668f60805c1e27fc0e67e2dfc161d59dc0d14","last_reissued_at":"2026-05-18T00:00:35.358952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:35.358952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05291","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-18T00:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMg8hc/b1NHmBV75LYf/jrPxj9q1KBnhUZcmhADT3LapYA1msIrHZHUT7IwURQj1zDRhBmMoE7fbUumWLkvqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:11:40.639039Z"},"content_sha256":"74042955f01cab12ac18e03d971b4a483cb894c5620fd62c48d70c16c93542fa","schema_version":"1.0","event_id":"sha256:74042955f01cab12ac18e03d971b4a483cb894c5620fd62c48d70c16c93542fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:75Y45T6BKGOST6DCM453C5TI6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian Clearing Mechanism for Combinatorial Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Gianluca Brero, S\\'ebastien Lahaie","submitted_at":"2017-12-14T15:34:42Z","abstract_excerpt":"We cast the problem of combinatorial auction design in a Bayesian framework in order to incorporate prior information into the auction process and minimize the number of rounds to convergence. We first develop a generative model of agent valuations and market prices such that clearing prices become maximum a posteriori estimates given observed agent valuations. This generative model then forms the basis of an auction process which alternates between refining estimates of agent valuations and computing candidate clearing prices. We provide an implementation of the auction using assumed density "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05291","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-18T00:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CaE7IBPtnSgtCa+ig/MX6XRoRv4VfC/xbyr1RzfaFo6CI3KuEE/049Y5y9wUOXeUGjhE+7I769HRrRWARwBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:11:40.639747Z"},"content_sha256":"cebb5a3bdc4d1f0ef91738dc7a0a83b274923eaa8c578769bfd2e88f5d7e553e","schema_version":"1.0","event_id":"sha256:cebb5a3bdc4d1f0ef91738dc7a0a83b274923eaa8c578769bfd2e88f5d7e553e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75Y45T6BKGOST6DCM453C5TI6Y/bundle.json","state_url":"https://pith.science/pith/75Y45T6BKGOST6DCM453C5TI6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75Y45T6BKGOST6DCM453C5TI6Y/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-26T19:11:40Z","links":{"resolver":"https://pith.science/pith/75Y45T6BKGOST6DCM453C5TI6Y","bundle":"https://pith.science/pith/75Y45T6BKGOST6DCM453C5TI6Y/bundle.json","state":"https://pith.science/pith/75Y45T6BKGOST6DCM453C5TI6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75Y45T6BKGOST6DCM453C5TI6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:75Y45T6BKGOST6DCM453C5TI6Y","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":"c8cd04ad6292a136593fd9f85490d768f5c5051fa67a7ae55761135812e2f0ec","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-14T15:34:42Z","title_canon_sha256":"4a38814028ba8e9259a7a634b27e85dfbb8f06c3c90f816de90643701652bd93"},"schema_version":"1.0","source":{"id":"1712.05291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05291","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05291v2","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05291","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"75Y45T6BKGOS","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"75Y45T6BKGOST6DC","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"75Y45T6B","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:cebb5a3bdc4d1f0ef91738dc7a0a83b274923eaa8c578769bfd2e88f5d7e553e","target":"graph","created_at":"2026-05-18T00:00:35Z","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 cast the problem of combinatorial auction design in a Bayesian framework in order to incorporate prior information into the auction process and minimize the number of rounds to convergence. We first develop a generative model of agent valuations and market prices such that clearing prices become maximum a posteriori estimates given observed agent valuations. This generative model then forms the basis of an auction process which alternates between refining estimates of agent valuations and computing candidate clearing prices. We provide an implementation of the auction using assumed density ","authors_text":"Gianluca Brero, S\\'ebastien Lahaie","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-14T15:34:42Z","title":"A Bayesian Clearing Mechanism for Combinatorial Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05291","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:74042955f01cab12ac18e03d971b4a483cb894c5620fd62c48d70c16c93542fa","target":"record","created_at":"2026-05-18T00:00:35Z","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":"c8cd04ad6292a136593fd9f85490d768f5c5051fa67a7ae55761135812e2f0ec","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-14T15:34:42Z","title_canon_sha256":"4a38814028ba8e9259a7a634b27e85dfbb8f06c3c90f816de90643701652bd93"},"schema_version":"1.0","source":{"id":"1712.05291","kind":"arxiv","version":2}},"canonical_sha256":"ff71cecfc1519d29f862673bb17668f60805c1e27fc0e67e2dfc161d59dc0d14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff71cecfc1519d29f862673bb17668f60805c1e27fc0e67e2dfc161d59dc0d14","first_computed_at":"2026-05-18T00:00:35.358952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:35.358952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rg7kIs/Tpc2eiT5nHjhXiyOydUKXSe68vCKDci/ATB594Vz7l52G2JIQJgPOe4/o+5hfd7lRK1dK9rl59TfZCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:35.359398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74042955f01cab12ac18e03d971b4a483cb894c5620fd62c48d70c16c93542fa","sha256:cebb5a3bdc4d1f0ef91738dc7a0a83b274923eaa8c578769bfd2e88f5d7e553e"],"state_sha256":"5f239a97752c111e8b7b6b078e185437d5922cc9c5f88ec71ad6d13a4c3fb49c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxqwAFj8dIf6nPVuoIA5WC1m9FFFZeEYS9FqbZtxoxPBfmU5OzXpZuFwxumamYycealJjeR90RfyiMtNcpmCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:11:40.643529Z","bundle_sha256":"32378342974990377b684a1713876f9158aa5c91b065d935fa2b779abe495a94"}}