{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QYN5SBXXOACRAATXI54Z5MIJ3B","short_pith_number":"pith:QYN5SBXX","schema_version":"1.0","canonical_sha256":"861bd906f7700510027747799eb109d86c815afeff1414a8c9c24a7199ef0949","source":{"kind":"arxiv","id":"0903.2429","version":2},"attestation_state":"computed","paper":{"title":"Statistical mechanics of budget-constrained auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"primary_cat":"cs.GT","authors_text":"A. Braunstein, F. Altarelli, J. Realpe-Gomez, R. Zecchina","submitted_at":"2009-03-13T16:53:52Z","abstract_excerpt":"Finding the optimal assignment in budget-constrained auctions is a combinatorial optimization problem with many important applications, a notable example being the sale of advertisement space by search engines (in this context the problem is often referred to as the off-line AdWords problem). Based on the cavity method of statistical mechanics, we introduce a message passing algorithm that is capable of solving efficiently random instances of the problem extracted from a natural distribution, and we derive from its properties the phase diagram of the problem. As the control parameter (average "},"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":"0903.2429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2009-03-13T16:53:52Z","cross_cats_sorted":["cond-mat.stat-mech","physics.soc-ph"],"title_canon_sha256":"6caa292d21fec4cd2d6d34635ebe75b5cd3ac8a65b50fe49a5f56c978f3c3a08","abstract_canon_sha256":"8acaaae23ff567e548d1c9838f57a5c4155b444dd3199d25b5aff4456553404f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:28.454067Z","signature_b64":"9zFR+s9fxt4PtE/wZwnsEyZ8Uc/I0CwiDtsNw2TAL/acK7dJUVpX04+t1Lw/kSRiqqR7DlxbYUAe0rFF7qo5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"861bd906f7700510027747799eb109d86c815afeff1414a8c9c24a7199ef0949","last_reissued_at":"2026-05-18T02:14:28.453539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:28.453539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical mechanics of budget-constrained auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","physics.soc-ph"],"primary_cat":"cs.GT","authors_text":"A. Braunstein, F. Altarelli, J. Realpe-Gomez, R. Zecchina","submitted_at":"2009-03-13T16:53:52Z","abstract_excerpt":"Finding the optimal assignment in budget-constrained auctions is a combinatorial optimization problem with many important applications, a notable example being the sale of advertisement space by search engines (in this context the problem is often referred to as the off-line AdWords problem). Based on the cavity method of statistical mechanics, we introduce a message passing algorithm that is capable of solving efficiently random instances of the problem extracted from a natural distribution, and we derive from its properties the phase diagram of the problem. As the control parameter (average "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2429","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0903.2429","created_at":"2026-05-18T02:14:28.453606+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.2429v2","created_at":"2026-05-18T02:14:28.453606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2429","created_at":"2026-05-18T02:14:28.453606+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYN5SBXXOACR","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYN5SBXXOACRAATX","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYN5SBXX","created_at":"2026-05-18T12:26:01.383474+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/QYN5SBXXOACRAATXI54Z5MIJ3B","json":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B.json","graph_json":"https://pith.science/api/pith-number/QYN5SBXXOACRAATXI54Z5MIJ3B/graph.json","events_json":"https://pith.science/api/pith-number/QYN5SBXXOACRAATXI54Z5MIJ3B/events.json","paper":"https://pith.science/paper/QYN5SBXX"},"agent_actions":{"view_html":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B","download_json":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B.json","view_paper":"https://pith.science/paper/QYN5SBXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.2429&json=true","fetch_graph":"https://pith.science/api/pith-number/QYN5SBXXOACRAATXI54Z5MIJ3B/graph.json","fetch_events":"https://pith.science/api/pith-number/QYN5SBXXOACRAATXI54Z5MIJ3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B/action/storage_attestation","attest_author":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B/action/author_attestation","sign_citation":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B/action/citation_signature","submit_replication":"https://pith.science/pith/QYN5SBXXOACRAATXI54Z5MIJ3B/action/replication_record"}},"created_at":"2026-05-18T02:14:28.453606+00:00","updated_at":"2026-05-18T02:14:28.453606+00:00"}