{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EZM4GMTBC666LPKBRZW2KNXHXF","short_pith_number":"pith:EZM4GMTB","schema_version":"1.0","canonical_sha256":"2659c3326117bde5bd418e6da536e7b97365ccff10f4ae14577e8342710dce6e","source":{"kind":"arxiv","id":"1410.1703","version":2},"attestation_state":"computed","paper":{"title":"A Truthful Mechanism for the Generalized Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Martin Bichler, Salman Fadaei","submitted_at":"2014-10-07T12:29:43Z","abstract_excerpt":"We propose a truthful-in-expectation, $(1-1/e)$-approximation mechanism for a strategic variant of the generalized assignment problem (GAP). In GAP, a set of items has to be optimally assigned to a set of bins without exceeding the capacity of any singular bin. In the strategic variant of the problem we study, values for assigning items to bins are the private information of bidders and the mechanism should provide bidders with incentives to truthfully report their values. The approximation ratio of the mechanism is a significant improvement over the approximation ratio of the existing truthfu"},"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":"1410.1703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-07T12:29:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac20b8be34b6bf513dc52c13044a65f7bf5409a09fcec3e3f980678e4aac0ce9","abstract_canon_sha256":"2bdcef653120acce454ada2ae79402d78eef28c4a74c18ead2ffaf9578d98b2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:45.329419Z","signature_b64":"+E2qbRw9YyoO2mroiT/WLcMCG09HZWqprgQQycnLiDL44Zv5mt3JmbTrtd+vArLZXDYsMVgbdiKVwpPb7ZrvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2659c3326117bde5bd418e6da536e7b97365ccff10f4ae14577e8342710dce6e","last_reissued_at":"2026-05-18T01:08:45.328889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:45.328889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Truthful Mechanism for the Generalized Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Martin Bichler, Salman Fadaei","submitted_at":"2014-10-07T12:29:43Z","abstract_excerpt":"We propose a truthful-in-expectation, $(1-1/e)$-approximation mechanism for a strategic variant of the generalized assignment problem (GAP). In GAP, a set of items has to be optimally assigned to a set of bins without exceeding the capacity of any singular bin. In the strategic variant of the problem we study, values for assigning items to bins are the private information of bidders and the mechanism should provide bidders with incentives to truthfully report their values. The approximation ratio of the mechanism is a significant improvement over the approximation ratio of the existing truthfu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1703","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":"1410.1703","created_at":"2026-05-18T01:08:45.328960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1703v2","created_at":"2026-05-18T01:08:45.328960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1703","created_at":"2026-05-18T01:08:45.328960+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZM4GMTBC666","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZM4GMTBC666LPKB","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZM4GMTB","created_at":"2026-05-18T12:28:28.263976+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/EZM4GMTBC666LPKBRZW2KNXHXF","json":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF.json","graph_json":"https://pith.science/api/pith-number/EZM4GMTBC666LPKBRZW2KNXHXF/graph.json","events_json":"https://pith.science/api/pith-number/EZM4GMTBC666LPKBRZW2KNXHXF/events.json","paper":"https://pith.science/paper/EZM4GMTB"},"agent_actions":{"view_html":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF","download_json":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF.json","view_paper":"https://pith.science/paper/EZM4GMTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1703&json=true","fetch_graph":"https://pith.science/api/pith-number/EZM4GMTBC666LPKBRZW2KNXHXF/graph.json","fetch_events":"https://pith.science/api/pith-number/EZM4GMTBC666LPKBRZW2KNXHXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF/action/storage_attestation","attest_author":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF/action/author_attestation","sign_citation":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF/action/citation_signature","submit_replication":"https://pith.science/pith/EZM4GMTBC666LPKBRZW2KNXHXF/action/replication_record"}},"created_at":"2026-05-18T01:08:45.328960+00:00","updated_at":"2026-05-18T01:08:45.328960+00:00"}