{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WTEI5KEXH7CTJOFU3FAF45F6EJ","short_pith_number":"pith:WTEI5KEX","schema_version":"1.0","canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","source":{"kind":"arxiv","id":"1107.2994","version":2},"attestation_state":"computed","paper":{"title":"Budget Feasible Mechanism Design via Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Nick Gravin, Ning Chen, Pinyan Lu, Xiaohui Bei","submitted_at":"2011-07-15T06:16:48Z","abstract_excerpt":"Budget feasible mechanism considers algorithmic mechanism design questions where there is a budget constraint on the total payment of the mechanism. An important question in the field is that under which valuation domains there exist budget feasible mechanisms that admit `small' approximations (compared to a socially optimal solution). Singer \\cite{PS10} showed that additive and submodular functions admit a constant approximation mechanism. Recently, Dobzinski, Papadimitriou, and Singer \\cite{DPS11} gave an $O(\\log^2n)$ approximation mechanism for subadditive functions and remarked that: \"A fu"},"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":"1107.2994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-15T06:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"6062e7aee32a96979d6a2c7d3c829e5fec48b36ed08ff6d42fc9c9493b86a1ee","abstract_canon_sha256":"a542fd3093fea33ffb5ef159ced1dcdd0f3dfeeedae1705817124a5dac66b9a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:36.696627Z","signature_b64":"kvt4R2YsCrgCw70Jl+SyH3gd+66gReAmnnEKKxpzh0SdiCI6l/YmN1ru9/yfLONuuTniC5I2m6iGYbLvuWRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","last_reissued_at":"2026-05-18T03:59:36.695816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:36.695816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Budget Feasible Mechanism Design via Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Nick Gravin, Ning Chen, Pinyan Lu, Xiaohui Bei","submitted_at":"2011-07-15T06:16:48Z","abstract_excerpt":"Budget feasible mechanism considers algorithmic mechanism design questions where there is a budget constraint on the total payment of the mechanism. An important question in the field is that under which valuation domains there exist budget feasible mechanisms that admit `small' approximations (compared to a socially optimal solution). Singer \\cite{PS10} showed that additive and submodular functions admit a constant approximation mechanism. Recently, Dobzinski, Papadimitriou, and Singer \\cite{DPS11} gave an $O(\\log^2n)$ approximation mechanism for subadditive functions and remarked that: \"A fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2994","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":"1107.2994","created_at":"2026-05-18T03:59:36.695958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2994v2","created_at":"2026-05-18T03:59:36.695958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2994","created_at":"2026-05-18T03:59:36.695958+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTEI5KEXH7CT","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTEI5KEXH7CTJOFU","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTEI5KEX","created_at":"2026-05-18T12:26:44.992195+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/WTEI5KEXH7CTJOFU3FAF45F6EJ","json":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ.json","graph_json":"https://pith.science/api/pith-number/WTEI5KEXH7CTJOFU3FAF45F6EJ/graph.json","events_json":"https://pith.science/api/pith-number/WTEI5KEXH7CTJOFU3FAF45F6EJ/events.json","paper":"https://pith.science/paper/WTEI5KEX"},"agent_actions":{"view_html":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ","download_json":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ.json","view_paper":"https://pith.science/paper/WTEI5KEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2994&json=true","fetch_graph":"https://pith.science/api/pith-number/WTEI5KEXH7CTJOFU3FAF45F6EJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WTEI5KEXH7CTJOFU3FAF45F6EJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/action/storage_attestation","attest_author":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/action/author_attestation","sign_citation":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/action/citation_signature","submit_replication":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/action/replication_record"}},"created_at":"2026-05-18T03:59:36.695958+00:00","updated_at":"2026-05-18T03:59:36.695958+00:00"}