{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EZ5LOK33EMVQKT4LA5MSH6KZXN","short_pith_number":"pith:EZ5LOK33","schema_version":"1.0","canonical_sha256":"267ab72b7b232b054f8b075923f959bb7d4b189f43884ff14f3dcef8ac24a74e","source":{"kind":"arxiv","id":"1409.7595","version":1},"attestation_state":"computed","paper":{"title":"Truthful Multi-unit Procurements with Budgets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hau Chan, Jing Chen","submitted_at":"2014-09-26T14:58:42Z","abstract_excerpt":"We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a budget for his total payment.\n  For a special class of procurement games, the {\\em bounded knapsack} problem, we show that no universally truthful budget-feasible mechanism can approximate the optimal value of the buyer within $\\ln n$, where $n$ is the total number of units of all items available. We then construct a polynomial-time mechanism that g"},"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":"1409.7595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-26T14:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"db00c55f7d853bea33d78e0daeae48748f4265b5fb58a7637fb48b40ee12e3e8","abstract_canon_sha256":"82dd341a637edb29afadbd37b3a2c4f5ad98a6008292ff8e97f8ce32ba1de50b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.326608Z","signature_b64":"U4rg6EpkD2FzJr+fmt5pmHvTei4+eyibp43Ww3RNXfL1duj+qtrmRJsaOfOW5KjL8UH6wrhFKFSUMfEWAeq/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267ab72b7b232b054f8b075923f959bb7d4b189f43884ff14f3dcef8ac24a74e","last_reissued_at":"2026-05-18T02:41:52.326107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.326107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truthful Multi-unit Procurements with Budgets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hau Chan, Jing Chen","submitted_at":"2014-09-26T14:58:42Z","abstract_excerpt":"We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a budget for his total payment.\n  For a special class of procurement games, the {\\em bounded knapsack} problem, we show that no universally truthful budget-feasible mechanism can approximate the optimal value of the buyer within $\\ln n$, where $n$ is the total number of units of all items available. We then construct a polynomial-time mechanism that g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7595","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":"1409.7595","created_at":"2026-05-18T02:41:52.326181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7595v1","created_at":"2026-05-18T02:41:52.326181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7595","created_at":"2026-05-18T02:41:52.326181+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ5LOK33EMVQ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ5LOK33EMVQKT4L","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ5LOK33","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/EZ5LOK33EMVQKT4LA5MSH6KZXN","json":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN.json","graph_json":"https://pith.science/api/pith-number/EZ5LOK33EMVQKT4LA5MSH6KZXN/graph.json","events_json":"https://pith.science/api/pith-number/EZ5LOK33EMVQKT4LA5MSH6KZXN/events.json","paper":"https://pith.science/paper/EZ5LOK33"},"agent_actions":{"view_html":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN","download_json":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN.json","view_paper":"https://pith.science/paper/EZ5LOK33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7595&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ5LOK33EMVQKT4LA5MSH6KZXN/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ5LOK33EMVQKT4LA5MSH6KZXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/action/storage_attestation","attest_author":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/action/author_attestation","sign_citation":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/action/citation_signature","submit_replication":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/action/replication_record"}},"created_at":"2026-05-18T02:41:52.326181+00:00","updated_at":"2026-05-18T02:41:52.326181+00:00"}