{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HUSSD5AQA3NTV42O6EPIDVQXZN","short_pith_number":"pith:HUSSD5AQ","schema_version":"1.0","canonical_sha256":"3d2521f41006db3af34ef11e81d617cb7afb4a0ab7b400d24590dff687a5df5a","source":{"kind":"arxiv","id":"1703.10681","version":1},"attestation_state":"computed","paper":{"title":"Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eva Tardos, Pooya Jalaly","submitted_at":"2017-03-30T21:07:53Z","abstract_excerpt":"We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to truthfully report their cost, and maximizes the buyer's value while guaranteeing that the total payment does not exceed her budget. Such budget feasible mechanisms can model a buyer in a crowdsourcing market interested in recruiting a set of workers (sellers) to accomplish a task for her.\n  This budget feasible mechanism design problem was introduced by Singe"},"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":"1703.10681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-30T21:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"992ee018a96c81b16d34a28c65e92e7e478dcdafb0e219c826f8d9894c32f25b","abstract_canon_sha256":"700ede5c4949b18a4bbd88fdf85b4d3ca851502f81b878a622dba1d02f2186fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:32.963756Z","signature_b64":"mqoVhe0DSQ4RsY2qUeAPdd7CoPdx6DCp7IR/XCYD/9Z62xGDnmtJ2S2sYjuhDT97TgG6le+NcpHkYAyDIiqcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d2521f41006db3af34ef11e81d617cb7afb4a0ab7b400d24590dff687a5df5a","last_reissued_at":"2026-05-18T00:47:32.963258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:32.963258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eva Tardos, Pooya Jalaly","submitted_at":"2017-03-30T21:07:53Z","abstract_excerpt":"We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to truthfully report their cost, and maximizes the buyer's value while guaranteeing that the total payment does not exceed her budget. Such budget feasible mechanisms can model a buyer in a crowdsourcing market interested in recruiting a set of workers (sellers) to accomplish a task for her.\n  This budget feasible mechanism design problem was introduced by Singe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10681","kind":"arxiv","version":1},"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":"1703.10681","created_at":"2026-05-18T00:47:32.963334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10681v1","created_at":"2026-05-18T00:47:32.963334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10681","created_at":"2026-05-18T00:47:32.963334+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUSSD5AQA3NT","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUSSD5AQA3NTV42O","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUSSD5AQ","created_at":"2026-05-18T12:31:18.294218+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/HUSSD5AQA3NTV42O6EPIDVQXZN","json":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN.json","graph_json":"https://pith.science/api/pith-number/HUSSD5AQA3NTV42O6EPIDVQXZN/graph.json","events_json":"https://pith.science/api/pith-number/HUSSD5AQA3NTV42O6EPIDVQXZN/events.json","paper":"https://pith.science/paper/HUSSD5AQ"},"agent_actions":{"view_html":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN","download_json":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN.json","view_paper":"https://pith.science/paper/HUSSD5AQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10681&json=true","fetch_graph":"https://pith.science/api/pith-number/HUSSD5AQA3NTV42O6EPIDVQXZN/graph.json","fetch_events":"https://pith.science/api/pith-number/HUSSD5AQA3NTV42O6EPIDVQXZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN/action/storage_attestation","attest_author":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN/action/author_attestation","sign_citation":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN/action/citation_signature","submit_replication":"https://pith.science/pith/HUSSD5AQA3NTV42O6EPIDVQXZN/action/replication_record"}},"created_at":"2026-05-18T00:47:32.963334+00:00","updated_at":"2026-05-18T00:47:32.963334+00:00"}