{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WTEI5KEXH7CTJOFU3FAF45F6EJ","short_pith_number":"pith:WTEI5KEX","canonical_record":{"source":{"id":"1107.2994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-15T06:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"6062e7aee32a96979d6a2c7d3c829e5fec48b36ed08ff6d42fc9c9493b86a1ee","abstract_canon_sha256":"a542fd3093fea33ffb5ef159ced1dcdd0f3dfeeedae1705817124a5dac66b9a6"},"schema_version":"1.0"},"canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","source":{"kind":"arxiv","id":"1107.2994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2994","created_at":"2026-05-18T03:59:36Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2994v2","created_at":"2026-05-18T03:59:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2994","created_at":"2026-05-18T03:59:36Z"},{"alias_kind":"pith_short_12","alias_value":"WTEI5KEXH7CT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WTEI5KEXH7CTJOFU","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WTEI5KEX","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WTEI5KEXH7CTJOFU3FAF45F6EJ","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-15T06:16:48Z","cross_cats_sorted":[],"title_canon_sha256":"6062e7aee32a96979d6a2c7d3c829e5fec48b36ed08ff6d42fc9c9493b86a1ee","abstract_canon_sha256":"a542fd3093fea33ffb5ef159ced1dcdd0f3dfeeedae1705817124a5dac66b9a6"},"schema_version":"1.0"},"canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:36.696627Z","signature_b64":"kvt4R2YsCrgCw70Jl+SyH3gd+66gReAmnnEKKxpzh0SdiCI6l/YmN1ru9/yfLONuuTniC5I2m6iGYbLvuWRmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","last_reissued_at":"2026-05-18T03:59:36.695816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:36.695816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2994","source_version":2,"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-18T03:59:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i3FTO+HLsfIkGgUCB+fKT0ouxJO7XSJB+avkKFxF0vpJwhneiWHCMqvqbLuxgq4KYW+som4HPqUVyXteHKbOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:31:29.529535Z"},"content_sha256":"46a4c71270d314dfe5a816e91b58040cf522201248c36a12dac3025380cb6720","schema_version":"1.0","event_id":"sha256:46a4c71270d314dfe5a816e91b58040cf522201248c36a12dac3025380cb6720"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WTEI5KEXH7CTJOFU3FAF45F6EJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budget Feasible Mechanism Design via Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Nick Gravin, Ning Chen, Pinyan Lu, Xiaohui Bei","submitted_at":"2011-07-15T06:16:48Z","abstract_excerpt":"Budget feasible mechanism considers algorithmic mechanism design questions where there is a budget constraint on the total payment of the mechanism. An important question in the field is that under which valuation domains there exist budget feasible mechanisms that admit `small' approximations (compared to a socially optimal solution). Singer \\cite{PS10} showed that additive and submodular functions admit a constant approximation mechanism. Recently, Dobzinski, Papadimitriou, and Singer \\cite{DPS11} gave an $O(\\log^2n)$ approximation mechanism for subadditive functions and remarked that: \"A fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2994","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"},"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-18T03:59:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8t6+nnsBJRIx1X/65R+JhmZC5/rnvBYnmh3Uz2K/YkpmjjcgcEB1VbjqahlU11Bt6ec1szL4DFAwGYC8caqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:31:29.530253Z"},"content_sha256":"8fe71bc16e9e972bfab2ca5962d208273e39d68bb25c48e7a86399a7bed16340","schema_version":"1.0","event_id":"sha256:8fe71bc16e9e972bfab2ca5962d208273e39d68bb25c48e7a86399a7bed16340"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/bundle.json","state_url":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/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-05-25T23:31:29Z","links":{"resolver":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ","bundle":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/bundle.json","state":"https://pith.science/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WTEI5KEXH7CTJOFU3FAF45F6EJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WTEI5KEXH7CTJOFU3FAF45F6EJ","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":"a542fd3093fea33ffb5ef159ced1dcdd0f3dfeeedae1705817124a5dac66b9a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-15T06:16:48Z","title_canon_sha256":"6062e7aee32a96979d6a2c7d3c829e5fec48b36ed08ff6d42fc9c9493b86a1ee"},"schema_version":"1.0","source":{"id":"1107.2994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2994","created_at":"2026-05-18T03:59:36Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2994v2","created_at":"2026-05-18T03:59:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2994","created_at":"2026-05-18T03:59:36Z"},{"alias_kind":"pith_short_12","alias_value":"WTEI5KEXH7CT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WTEI5KEXH7CTJOFU","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WTEI5KEX","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:8fe71bc16e9e972bfab2ca5962d208273e39d68bb25c48e7a86399a7bed16340","target":"graph","created_at":"2026-05-18T03:59:36Z","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":"Budget feasible mechanism considers algorithmic mechanism design questions where there is a budget constraint on the total payment of the mechanism. An important question in the field is that under which valuation domains there exist budget feasible mechanisms that admit `small' approximations (compared to a socially optimal solution). Singer \\cite{PS10} showed that additive and submodular functions admit a constant approximation mechanism. Recently, Dobzinski, Papadimitriou, and Singer \\cite{DPS11} gave an $O(\\log^2n)$ approximation mechanism for subadditive functions and remarked that: \"A fu","authors_text":"Nick Gravin, Ning Chen, Pinyan Lu, Xiaohui Bei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-15T06:16:48Z","title":"Budget Feasible Mechanism Design via Random Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2994","kind":"arxiv","version":2},"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:46a4c71270d314dfe5a816e91b58040cf522201248c36a12dac3025380cb6720","target":"record","created_at":"2026-05-18T03:59:36Z","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":"a542fd3093fea33ffb5ef159ced1dcdd0f3dfeeedae1705817124a5dac66b9a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-15T06:16:48Z","title_canon_sha256":"6062e7aee32a96979d6a2c7d3c829e5fec48b36ed08ff6d42fc9c9493b86a1ee"},"schema_version":"1.0","source":{"id":"1107.2994","kind":"arxiv","version":2}},"canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4c88ea8973fc534b8b4d9405e74be2268cec28b7c173041cf6a9254b873be6c","first_computed_at":"2026-05-18T03:59:36.695816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:36.695816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kvt4R2YsCrgCw70Jl+SyH3gd+66gReAmnnEKKxpzh0SdiCI6l/YmN1ru9/yfLONuuTniC5I2m6iGYbLvuWRmBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:36.696627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46a4c71270d314dfe5a816e91b58040cf522201248c36a12dac3025380cb6720","sha256:8fe71bc16e9e972bfab2ca5962d208273e39d68bb25c48e7a86399a7bed16340"],"state_sha256":"aa3bdc2646b5fbcfca79283e2b99162a810ad94a77a63ceefe47a16e95331c9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwiM8GxTU4fBExtTVEr8b7Onm6ah5c1vm+JwoquVIgvvi+BpVfedikPGwJaj6l2iujEQXxQYtXLWODEhHQ7YDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:31:29.533939Z","bundle_sha256":"871ab4762d90d488884b0f3296616eb6da29c42199518a4ace1c33a5ae4e8a19"}}