{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IRMJ3FJEAUBPVLJ4DQ76XF3KE4","short_pith_number":"pith:IRMJ3FJE","schema_version":"1.0","canonical_sha256":"44589d95240502faad3c1c3feb976a270b6338221832a9d878770b6c226a7456","source":{"kind":"arxiv","id":"1107.2432","version":2},"attestation_state":"computed","paper":{"title":"Funding Games: the Truth but not the Whole Truth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Amotz Bar-Noy, Bhaskar Krishnamachari, George Rabanca, Matthew P. Johnson, Yi Gai","submitted_at":"2011-07-12T22:59:02Z","abstract_excerpt":"We introduce the Funding Game, in which $m$ identical resources are to be allocated among $n$ selfish agents. Each agent requests a number of resources $x_i$ and reports a valuation $\\tilde{v}_i(x_i)$, which verifiably {\\em lower}-bounds $i$'s true value for receiving $x_i$ items. The pairs $(x_i, \\tilde{v}_i(x_i))$ can be thought of as size-value pairs defining a knapsack problem with capacity $m$. A publicly-known algorithm is used to solve this knapsack problem, deciding which requests to satisfy in order to maximize the social welfare.\n  We show that a simple mechanism based on the knapsac"},"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":"1107.2432","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-12T22:59:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8e10477b6b4b9b797f537322a3f4d16cebdbf937610898e1154c56eb6a6534ec","abstract_canon_sha256":"020087230d662f2a08fec179883022a49967af9a4233b9bd5a8456e667b050dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:49.637273Z","signature_b64":"OVAs5H1XOjy78zQjclWrG7OKS6RU3jCV6tsNxkYobN83qw+tdlXcyqHG8hrDR9OSpr5uxDCQVOkzNzSBN7u/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44589d95240502faad3c1c3feb976a270b6338221832a9d878770b6c226a7456","last_reissued_at":"2026-05-18T03:40:49.636599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:49.636599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Funding Games: the Truth but not the Whole Truth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.GT","authors_text":"Amotz Bar-Noy, Bhaskar Krishnamachari, George Rabanca, Matthew P. Johnson, Yi Gai","submitted_at":"2011-07-12T22:59:02Z","abstract_excerpt":"We introduce the Funding Game, in which $m$ identical resources are to be allocated among $n$ selfish agents. Each agent requests a number of resources $x_i$ and reports a valuation $\\tilde{v}_i(x_i)$, which verifiably {\\em lower}-bounds $i$'s true value for receiving $x_i$ items. The pairs $(x_i, \\tilde{v}_i(x_i))$ can be thought of as size-value pairs defining a knapsack problem with capacity $m$. A publicly-known algorithm is used to solve this knapsack problem, deciding which requests to satisfy in order to maximize the social welfare.\n  We show that a simple mechanism based on the knapsac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2432","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":"1107.2432","created_at":"2026-05-18T03:40:49.636702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2432v2","created_at":"2026-05-18T03:40:49.636702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2432","created_at":"2026-05-18T03:40:49.636702+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRMJ3FJEAUBP","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRMJ3FJEAUBPVLJ4","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRMJ3FJE","created_at":"2026-05-18T12:26:32.869790+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/IRMJ3FJEAUBPVLJ4DQ76XF3KE4","json":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4.json","graph_json":"https://pith.science/api/pith-number/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/graph.json","events_json":"https://pith.science/api/pith-number/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/events.json","paper":"https://pith.science/paper/IRMJ3FJE"},"agent_actions":{"view_html":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4","download_json":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4.json","view_paper":"https://pith.science/paper/IRMJ3FJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2432&json=true","fetch_graph":"https://pith.science/api/pith-number/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/graph.json","fetch_events":"https://pith.science/api/pith-number/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/action/storage_attestation","attest_author":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/action/author_attestation","sign_citation":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/action/citation_signature","submit_replication":"https://pith.science/pith/IRMJ3FJEAUBPVLJ4DQ76XF3KE4/action/replication_record"}},"created_at":"2026-05-18T03:40:49.636702+00:00","updated_at":"2026-05-18T03:40:49.636702+00:00"}