{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:V2MAX5N3RIUHWYYVY3FBG4Z34Z","short_pith_number":"pith:V2MAX5N3","schema_version":"1.0","canonical_sha256":"ae980bf5bb8a287b6315c6ca13733be673d1183c34dfbfb221507cd0b118d457","source":{"kind":"arxiv","id":"0909.4756","version":2},"attestation_state":"computed","paper":{"title":"Bayesian Algorithmic Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brendan Lucier, Jason D. Hartline","submitted_at":"2009-09-25T18:00:59Z","abstract_excerpt":"The principal problem in algorithmic mechanism design is in merging the incentive constraints imposed by selfish behavior with the algorithmic constraints imposed by computational intractability. This field is motivated by the observation that the preeminent approach for designing incentive compatible mechanisms, namely that of Vickrey, Clarke, and Groves; and the central approach for circumventing computational obstacles, that of approximation algorithms, are fundamentally incompatible: natural applications of the VCG approach to an approximation algorithm fails to yield an incentive compatib"},"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":"0909.4756","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2009-09-25T18:00:59Z","cross_cats_sorted":[],"title_canon_sha256":"b2e5782d0b8001c84a1fdaf3d00f35a856daf9d7fbaa6efa5c580101ab3b6919","abstract_canon_sha256":"4805b5c195cb3e975d8cacc5f33ade6f908d74bb9834ef4511b876df2ba098c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:53.084455Z","signature_b64":"J3rs0MTC+mY05yocOqLWuLZZ2BjASpkcjS3PMqTvJXnXKwgWdl1beJHG1qYEo/CmS1XI4LOG6VKaRjjv/myHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae980bf5bb8a287b6315c6ca13733be673d1183c34dfbfb221507cd0b118d457","last_reissued_at":"2026-05-18T00:37:53.083976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:53.083976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Algorithmic Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brendan Lucier, Jason D. Hartline","submitted_at":"2009-09-25T18:00:59Z","abstract_excerpt":"The principal problem in algorithmic mechanism design is in merging the incentive constraints imposed by selfish behavior with the algorithmic constraints imposed by computational intractability. This field is motivated by the observation that the preeminent approach for designing incentive compatible mechanisms, namely that of Vickrey, Clarke, and Groves; and the central approach for circumventing computational obstacles, that of approximation algorithms, are fundamentally incompatible: natural applications of the VCG approach to an approximation algorithm fails to yield an incentive compatib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4756","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":"0909.4756","created_at":"2026-05-18T00:37:53.084052+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4756v2","created_at":"2026-05-18T00:37:53.084052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4756","created_at":"2026-05-18T00:37:53.084052+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2MAX5N3RIUH","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2MAX5N3RIUHWYYV","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2MAX5N3","created_at":"2026-05-18T12:26:02.257875+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/V2MAX5N3RIUHWYYVY3FBG4Z34Z","json":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z.json","graph_json":"https://pith.science/api/pith-number/V2MAX5N3RIUHWYYVY3FBG4Z34Z/graph.json","events_json":"https://pith.science/api/pith-number/V2MAX5N3RIUHWYYVY3FBG4Z34Z/events.json","paper":"https://pith.science/paper/V2MAX5N3"},"agent_actions":{"view_html":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z","download_json":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z.json","view_paper":"https://pith.science/paper/V2MAX5N3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4756&json=true","fetch_graph":"https://pith.science/api/pith-number/V2MAX5N3RIUHWYYVY3FBG4Z34Z/graph.json","fetch_events":"https://pith.science/api/pith-number/V2MAX5N3RIUHWYYVY3FBG4Z34Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z/action/storage_attestation","attest_author":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z/action/author_attestation","sign_citation":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z/action/citation_signature","submit_replication":"https://pith.science/pith/V2MAX5N3RIUHWYYVY3FBG4Z34Z/action/replication_record"}},"created_at":"2026-05-18T00:37:53.084052+00:00","updated_at":"2026-05-18T00:37:53.084052+00:00"}