{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:W5NUXEWHMJTZNQ374PJ66HMTFF","short_pith_number":"pith:W5NUXEWH","schema_version":"1.0","canonical_sha256":"b75b4b92c7626796c37fe3d3ef1d9329710d9034d1868b7b8e1ed86a9b31618f","source":{"kind":"arxiv","id":"0912.3310","version":2},"attestation_state":"computed","paper":{"title":"Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, David Kempe, Mahyar Salek","submitted_at":"2009-12-17T02:40:36Z","abstract_excerpt":"We study truthful mechanisms for hiring a team of agents in three classes of set systems: Vertex Cover auctions, k-flow auctions, and cut auctions. For Vertex Cover auctions, the vertices are owned by selfish and rational agents, and the auctioneer wants to purchase a vertex cover from them. For k-flow auctions, the edges are owned by the agents, and the auctioneer wants to purchase k edge-disjoint s-t paths, for given s and t. In the same setting, for cut auctions, the auctioneer wants to purchase an s-t cut. Only the agents know their costs, and the auctioneer needs to select a feasible set "},"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":"0912.3310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-12-17T02:40:36Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"02c45a50758a462b2c687bdc4b948d64a748081da6623549594cc610560f24eb","abstract_canon_sha256":"0c71afebd4062ffe32fc3b5d258c9757aff76f5a7533cecc2744aa29574c6bd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:13.274257Z","signature_b64":"swY0BsOEq77dqdGngkD7+sO6gyLiF52a8CBMOiEJHj2i0wUQmtgPgE8VU9PsZttNWxSaXdOSKvKSxrm87HduBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b75b4b92c7626796c37fe3d3ef1d9329710d9034d1868b7b8e1ed86a9b31618f","last_reissued_at":"2026-05-18T04:20:13.273734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:13.273734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frugal and Truthful Auctions for Vertex Covers, Flows, and Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Cristopher Moore, David Kempe, Mahyar Salek","submitted_at":"2009-12-17T02:40:36Z","abstract_excerpt":"We study truthful mechanisms for hiring a team of agents in three classes of set systems: Vertex Cover auctions, k-flow auctions, and cut auctions. For Vertex Cover auctions, the vertices are owned by selfish and rational agents, and the auctioneer wants to purchase a vertex cover from them. For k-flow auctions, the edges are owned by the agents, and the auctioneer wants to purchase k edge-disjoint s-t paths, for given s and t. In the same setting, for cut auctions, the auctioneer wants to purchase an s-t cut. Only the agents know their costs, and the auctioneer needs to select a feasible set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.3310","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":"0912.3310","created_at":"2026-05-18T04:20:13.273821+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.3310v2","created_at":"2026-05-18T04:20:13.273821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.3310","created_at":"2026-05-18T04:20:13.273821+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5NUXEWHMJTZ","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5NUXEWHMJTZNQ37","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5NUXEWH","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/W5NUXEWHMJTZNQ374PJ66HMTFF","json":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF.json","graph_json":"https://pith.science/api/pith-number/W5NUXEWHMJTZNQ374PJ66HMTFF/graph.json","events_json":"https://pith.science/api/pith-number/W5NUXEWHMJTZNQ374PJ66HMTFF/events.json","paper":"https://pith.science/paper/W5NUXEWH"},"agent_actions":{"view_html":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF","download_json":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF.json","view_paper":"https://pith.science/paper/W5NUXEWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.3310&json=true","fetch_graph":"https://pith.science/api/pith-number/W5NUXEWHMJTZNQ374PJ66HMTFF/graph.json","fetch_events":"https://pith.science/api/pith-number/W5NUXEWHMJTZNQ374PJ66HMTFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF/action/storage_attestation","attest_author":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF/action/author_attestation","sign_citation":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF/action/citation_signature","submit_replication":"https://pith.science/pith/W5NUXEWHMJTZNQ374PJ66HMTFF/action/replication_record"}},"created_at":"2026-05-18T04:20:13.273821+00:00","updated_at":"2026-05-18T04:20:13.273821+00:00"}