{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EZ5LOK33EMVQKT4LA5MSH6KZXN","short_pith_number":"pith:EZ5LOK33","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"},"canonical_sha256":"267ab72b7b232b054f8b075923f959bb7d4b189f43884ff14f3dcef8ac24a74e","source":{"kind":"arxiv","id":"1409.7595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7595","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7595v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7595","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"EZ5LOK33EMVQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EZ5LOK33EMVQKT4L","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EZ5LOK33","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EZ5LOK33EMVQKT4LA5MSH6KZXN","target":"record","payload":{"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"},"canonical_sha256":"267ab72b7b232b054f8b075923f959bb7d4b189f43884ff14f3dcef8ac24a74e","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"},"source_kind":"arxiv","source_id":"1409.7595","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2WpsLXp1XAH2LQTExxsOJyUEgekrEN82lsaEvOfq8tMXvkGfwNdivwhAIGIMcHQX+tboS11JkZDWO/1rLIeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:23.240786Z"},"content_sha256":"f6522accc95d9b599e120e64dc7301135f410f7a9d7086c521e0415fae1533ba","schema_version":"1.0","event_id":"sha256:f6522accc95d9b599e120e64dc7301135f410f7a9d7086c521e0415fae1533ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EZ5LOK33EMVQKT4LA5MSH6KZXN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfnMZYlT2KMpDzBy7O4rQJQamkWrdo547EhfeoiCc5beEvijgbq99/+t3/qBnhBr5WG/Nd3osw6iB/CYCJg9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:23.241124Z"},"content_sha256":"88b5a1c9d40c932386b0530dea115ee1098b9da10184b8af0327eec3178bc218","schema_version":"1.0","event_id":"sha256:88b5a1c9d40c932386b0530dea115ee1098b9da10184b8af0327eec3178bc218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/bundle.json","state_url":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:34:23Z","links":{"resolver":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN","bundle":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/bundle.json","state":"https://pith.science/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ5LOK33EMVQKT4LA5MSH6KZXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EZ5LOK33EMVQKT4LA5MSH6KZXN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"82dd341a637edb29afadbd37b3a2c4f5ad98a6008292ff8e97f8ce32ba1de50b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-26T14:58:42Z","title_canon_sha256":"db00c55f7d853bea33d78e0daeae48748f4265b5fb58a7637fb48b40ee12e3e8"},"schema_version":"1.0","source":{"id":"1409.7595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7595","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7595v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7595","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"EZ5LOK33EMVQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EZ5LOK33EMVQKT4L","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EZ5LOK33","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:88b5a1c9d40c932386b0530dea115ee1098b9da10184b8af0327eec3178bc218","target":"graph","created_at":"2026-05-18T02:41:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hau Chan, Jing Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-26T14:58:42Z","title":"Truthful Multi-unit Procurements with Budgets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7595","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6522accc95d9b599e120e64dc7301135f410f7a9d7086c521e0415fae1533ba","target":"record","created_at":"2026-05-18T02:41:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"82dd341a637edb29afadbd37b3a2c4f5ad98a6008292ff8e97f8ce32ba1de50b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-26T14:58:42Z","title_canon_sha256":"db00c55f7d853bea33d78e0daeae48748f4265b5fb58a7637fb48b40ee12e3e8"},"schema_version":"1.0","source":{"id":"1409.7595","kind":"arxiv","version":1}},"canonical_sha256":"267ab72b7b232b054f8b075923f959bb7d4b189f43884ff14f3dcef8ac24a74e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"267ab72b7b232b054f8b075923f959bb7d4b189f43884ff14f3dcef8ac24a74e","first_computed_at":"2026-05-18T02:41:52.326107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:52.326107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U4rg6EpkD2FzJr+fmt5pmHvTei4+eyibp43Ww3RNXfL1duj+qtrmRJsaOfOW5KjL8UH6wrhFKFSUMfEWAeq/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:52.326608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6522accc95d9b599e120e64dc7301135f410f7a9d7086c521e0415fae1533ba","sha256:88b5a1c9d40c932386b0530dea115ee1098b9da10184b8af0327eec3178bc218"],"state_sha256":"a0d8a0715c19250c381fb552199489fd2719b6b3a59a25e03e6b1cb9db67c39c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LK0+DCCKQJ7KrydKr209Dre30z+5QXWq2eTdrX9Hio3cQ7YSiDiSIFSRhN/CESqdyeA1GSJ8gO+h4mPQBKqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:34:23.242972Z","bundle_sha256":"39dfdf5eb63a321aa181cdb41525caa59aa7ebdfcaaf2eff4293059bd61fe5f3"}}