{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RENW5LYVJN3N4RC4EAJK67FWA3","short_pith_number":"pith:RENW5LYV","schema_version":"1.0","canonical_sha256":"891b6eaf154b76de445c2012af7cb606f2a4a0da76c8f895b2056b2bf00407c5","source":{"kind":"arxiv","id":"1106.2378","version":1},"attestation_state":"computed","paper":{"title":"False-name-proof Mechanisms for Hiring a Team","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Atsushi Iwasaki, David Kempe, Mahyar Salek, Makoto Yokoo","submitted_at":"2011-06-13T03:14:54Z","abstract_excerpt":"We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purchase a feasible solution by conducting an auction. Our goal is to design auctions that are truthful and false-name-proof, meaning that it is in the agents' best interest to reveal ownership of all elements (which may not be known to the auctioneer a priori) as well as their true incurred costs.\n  We first propose and analyze a false-name-proof mechanism for the special case where each agent owns only one element in rea"},"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":"1106.2378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-06-13T03:14:54Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4c33b117d18b8c1e04beaf34b49cc87ecc2c4d777a0e995eb016a221af975ff4","abstract_canon_sha256":"c0735518a9e7bc87ab370824f7f3df54b01aac7e3110b632160acc782ccf19a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:05.881164Z","signature_b64":"l3ErL3PCjsDpH+ZcbU+yAbUz9xASaLUNPL/A2zJ9oUlJ8HVoG2dFKCzB1Iom+VyqRlRuhCNLWsMz5pQNxPWSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"891b6eaf154b76de445c2012af7cb606f2a4a0da76c8f895b2056b2bf00407c5","last_reissued_at":"2026-05-18T04:20:05.880766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:05.880766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"False-name-proof Mechanisms for Hiring a Team","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Atsushi Iwasaki, David Kempe, Mahyar Salek, Makoto Yokoo","submitted_at":"2011-06-13T03:14:54Z","abstract_excerpt":"We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purchase a feasible solution by conducting an auction. Our goal is to design auctions that are truthful and false-name-proof, meaning that it is in the agents' best interest to reveal ownership of all elements (which may not be known to the auctioneer a priori) as well as their true incurred costs.\n  We first propose and analyze a false-name-proof mechanism for the special case where each agent owns only one element in rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2378","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":"1106.2378","created_at":"2026-05-18T04:20:05.880820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2378v1","created_at":"2026-05-18T04:20:05.880820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2378","created_at":"2026-05-18T04:20:05.880820+00:00"},{"alias_kind":"pith_short_12","alias_value":"RENW5LYVJN3N","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RENW5LYVJN3N4RC4","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RENW5LYV","created_at":"2026-05-18T12:26:41.206345+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/RENW5LYVJN3N4RC4EAJK67FWA3","json":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3.json","graph_json":"https://pith.science/api/pith-number/RENW5LYVJN3N4RC4EAJK67FWA3/graph.json","events_json":"https://pith.science/api/pith-number/RENW5LYVJN3N4RC4EAJK67FWA3/events.json","paper":"https://pith.science/paper/RENW5LYV"},"agent_actions":{"view_html":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3","download_json":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3.json","view_paper":"https://pith.science/paper/RENW5LYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2378&json=true","fetch_graph":"https://pith.science/api/pith-number/RENW5LYVJN3N4RC4EAJK67FWA3/graph.json","fetch_events":"https://pith.science/api/pith-number/RENW5LYVJN3N4RC4EAJK67FWA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3/action/storage_attestation","attest_author":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3/action/author_attestation","sign_citation":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3/action/citation_signature","submit_replication":"https://pith.science/pith/RENW5LYVJN3N4RC4EAJK67FWA3/action/replication_record"}},"created_at":"2026-05-18T04:20:05.880820+00:00","updated_at":"2026-05-18T04:20:05.880820+00:00"}