{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UDHBKBXVX6NG5AYGXP2WIXTZCV","short_pith_number":"pith:UDHBKBXV","schema_version":"1.0","canonical_sha256":"a0ce1506f5bf9a6e8306bbf5645e79157666fe40eec56197d75f351b864b0057","source":{"kind":"arxiv","id":"1608.04273","version":3},"attestation_state":"computed","paper":{"title":"Generalized Assignment Problem: Truthful Mechanism Design without Money","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Bichler, Salman Fadaei","submitted_at":"2016-08-15T14:11:02Z","abstract_excerpt":"In this paper, we study a problem of truthful mechanism design for a strategic variant of the generalized assignment problem (GAP) in a both payment-free and prior-free environment. 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, bins are held by strategic agents, and each agent may hide its compatibility with some items in order to obtain items of higher values. The compatibility between an agent and an item encodes the willingness of the agent to receive the item. Our go"},"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":"1608.04273","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-15T14:11:02Z","cross_cats_sorted":[],"title_canon_sha256":"2559335925613920fda2bfc6e7581d1146817d2b2c3df33ca9a96e6527f1dcdb","abstract_canon_sha256":"d74871566116e513265c46f61d9732b818d4314f896c6d070203b1f4369dbe69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:49.809298Z","signature_b64":"WkHs08sIYN5yp28fxPY/52FOG9lZZp4lnGM1dXxBsxqWOFzgGc8mEpoe5ViOrLB0Pf+abOJ9861DefeX28CZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0ce1506f5bf9a6e8306bbf5645e79157666fe40eec56197d75f351b864b0057","last_reissued_at":"2026-05-18T00:52:49.808594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:49.808594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Assignment Problem: Truthful Mechanism Design without Money","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Bichler, Salman Fadaei","submitted_at":"2016-08-15T14:11:02Z","abstract_excerpt":"In this paper, we study a problem of truthful mechanism design for a strategic variant of the generalized assignment problem (GAP) in a both payment-free and prior-free environment. 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, bins are held by strategic agents, and each agent may hide its compatibility with some items in order to obtain items of higher values. The compatibility between an agent and an item encodes the willingness of the agent to receive the item. Our go"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04273","kind":"arxiv","version":3},"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":"1608.04273","created_at":"2026-05-18T00:52:49.808701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04273v3","created_at":"2026-05-18T00:52:49.808701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04273","created_at":"2026-05-18T00:52:49.808701+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDHBKBXVX6NG","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDHBKBXVX6NG5AYG","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDHBKBXV","created_at":"2026-05-18T12:30:46.583412+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/UDHBKBXVX6NG5AYGXP2WIXTZCV","json":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV.json","graph_json":"https://pith.science/api/pith-number/UDHBKBXVX6NG5AYGXP2WIXTZCV/graph.json","events_json":"https://pith.science/api/pith-number/UDHBKBXVX6NG5AYGXP2WIXTZCV/events.json","paper":"https://pith.science/paper/UDHBKBXV"},"agent_actions":{"view_html":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV","download_json":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV.json","view_paper":"https://pith.science/paper/UDHBKBXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04273&json=true","fetch_graph":"https://pith.science/api/pith-number/UDHBKBXVX6NG5AYGXP2WIXTZCV/graph.json","fetch_events":"https://pith.science/api/pith-number/UDHBKBXVX6NG5AYGXP2WIXTZCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV/action/storage_attestation","attest_author":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV/action/author_attestation","sign_citation":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV/action/citation_signature","submit_replication":"https://pith.science/pith/UDHBKBXVX6NG5AYGXP2WIXTZCV/action/replication_record"}},"created_at":"2026-05-18T00:52:49.808701+00:00","updated_at":"2026-05-18T00:52:49.808701+00:00"}