{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TQWBJFKB6PDMSZXDK6NBSTHGZ4","short_pith_number":"pith:TQWBJFKB","schema_version":"1.0","canonical_sha256":"9c2c149541f3c6c966e3579a194ce6cf0503bb5adda576689113960ed7897980","source":{"kind":"arxiv","id":"1704.06901","version":2},"attestation_state":"computed","paper":{"title":"On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Evangelos Markakis, Georgios Amanatidis, Georgios Birmpas","submitted_at":"2017-04-23T09:07:22Z","abstract_excerpt":"We study a class of procurement auctions with a budget constraint, where an auctioneer is interested in buying resources or services from a set of agents. Ideally, the auctioneer would like to select a subset of the resources so as to maximize his valuation function, without exceeding a given budget. As the resources are owned by strategic agents however, our overall goal is to design mechanisms that are truthful, budget-feasible, and obtain a good approximation to the optimal value. Budget-feasibility creates additional challenges, making several approaches inapplicable in this setting. Previ"},"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":"1704.06901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-04-23T09:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"730bb84e582ddafc29d9a1a43bd277b8f8cd7a0cbe2b201e9fff7bd620261c7b","abstract_canon_sha256":"9aa31210d3051fba612c5eb24047b7cd0ce8309f9f2851970ab38fb75f87f5d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:27.621256Z","signature_b64":"PJhOv/8ChBvSaslnbY7Klzwi3CD0ardRmFsAw8dNwAnimKjGILdBfNlPwxVgcDnBpdA6R31rEDErUCe/ievDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c2c149541f3c6c966e3579a194ce6cf0503bb5adda576689113960ed7897980","last_reissued_at":"2026-05-18T00:33:27.620704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:27.620704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Evangelos Markakis, Georgios Amanatidis, Georgios Birmpas","submitted_at":"2017-04-23T09:07:22Z","abstract_excerpt":"We study a class of procurement auctions with a budget constraint, where an auctioneer is interested in buying resources or services from a set of agents. Ideally, the auctioneer would like to select a subset of the resources so as to maximize his valuation function, without exceeding a given budget. As the resources are owned by strategic agents however, our overall goal is to design mechanisms that are truthful, budget-feasible, and obtain a good approximation to the optimal value. Budget-feasibility creates additional challenges, making several approaches inapplicable in this setting. Previ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06901","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":"1704.06901","created_at":"2026-05-18T00:33:27.620786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06901v2","created_at":"2026-05-18T00:33:27.620786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06901","created_at":"2026-05-18T00:33:27.620786+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQWBJFKB6PDM","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQWBJFKB6PDMSZXD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQWBJFKB","created_at":"2026-05-18T12:31:46.661854+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/TQWBJFKB6PDMSZXDK6NBSTHGZ4","json":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4.json","graph_json":"https://pith.science/api/pith-number/TQWBJFKB6PDMSZXDK6NBSTHGZ4/graph.json","events_json":"https://pith.science/api/pith-number/TQWBJFKB6PDMSZXDK6NBSTHGZ4/events.json","paper":"https://pith.science/paper/TQWBJFKB"},"agent_actions":{"view_html":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4","download_json":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4.json","view_paper":"https://pith.science/paper/TQWBJFKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06901&json=true","fetch_graph":"https://pith.science/api/pith-number/TQWBJFKB6PDMSZXDK6NBSTHGZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/TQWBJFKB6PDMSZXDK6NBSTHGZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4/action/storage_attestation","attest_author":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4/action/author_attestation","sign_citation":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4/action/citation_signature","submit_replication":"https://pith.science/pith/TQWBJFKB6PDMSZXDK6NBSTHGZ4/action/replication_record"}},"created_at":"2026-05-18T00:33:27.620786+00:00","updated_at":"2026-05-18T00:33:27.620786+00:00"}