{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VF5I3X2TCH5A6R5ALKNEIK6OMA","short_pith_number":"pith:VF5I3X2T","canonical_record":{"source":{"id":"1905.00848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-02T16:51:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0079bbca4f64f2de4773f00aae6667d933f3e1c4f1ebdb4e05726be1ce919eb6","abstract_canon_sha256":"2aa38a14a29e7958621b8acffc6f8b643df00d3828ebd9b74bc3d6786356b061"},"schema_version":"1.0"},"canonical_sha256":"a97a8ddf5311fa0f47a05a9a442bce601550786e787daaa0df5503ff555ea682","source":{"kind":"arxiv","id":"1905.00848","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00848","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00848v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00848","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"VF5I3X2TCH5A","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VF5I3X2TCH5A6R5A","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VF5I3X2T","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VF5I3X2TCH5A6R5ALKNEIK6OMA","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-02T16:51:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0079bbca4f64f2de4773f00aae6667d933f3e1c4f1ebdb4e05726be1ce919eb6","abstract_canon_sha256":"2aa38a14a29e7958621b8acffc6f8b643df00d3828ebd9b74bc3d6786356b061"},"schema_version":"1.0"},"canonical_sha256":"a97a8ddf5311fa0f47a05a9a442bce601550786e787daaa0df5503ff555ea682","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:01.135579Z","signature_b64":"xFwBW3X8640t3rSmaqW2sd6Kcp/nPLgu/VNL5MF5Gor8YnzzhWBwQCTjyd7A3/NQdeLmmIDin0VuId+RbMUfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a97a8ddf5311fa0f47a05a9a442bce601550786e787daaa0df5503ff555ea682","last_reissued_at":"2026-05-17T23:47:01.135006Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:01.135006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00848","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-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydWx8hEf0CDeuN+7RUF+O30eNrbGWM/TKTH/cRpTEzuigsUelzxjfncHMyoB+Xs1p/LL5I5GdKVfiF00qGwYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:03:41.152681Z"},"content_sha256":"fb4830e12bf74328099d3848407a45b00c09c3a30861fead4c2da24aa5b0bffc","schema_version":"1.0","event_id":"sha256:fb4830e12bf74328099d3848407a45b00c09c3a30861fead4c2da24aa5b0bffc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VF5I3X2TCH5A6R5ALKNEIK6OMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Georgios Amanatidis, Guido Sch\\\"afer, Pieter Kleer","submitted_at":"2019-05-02T16:51:24Z","abstract_excerpt":"The framework of budget-feasible mechanism design studies procurement auctions where the auctioneer (buyer) aims to maximize his valuation function subject to a hard budget constraint. We study the problem of designing truthful mechanisms that have good approximation guarantees and never pay the participating agents (sellers) more than the budget. We focus on the case of general (non-monotone) submodular valuation functions and derive the first truthful, budget-feasible and $O(1)$-approximate mechanisms that run in polynomial time in the value query model, for both offline and online auctions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00848","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-17T23:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYjqIA7Feu0hIhZclAjVcljTvuo189gQJJJb06gvMqDUG5w02hWIgOy2iMvnzgJsmEXEh6HxA1/HX92M+a6mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:03:41.153358Z"},"content_sha256":"2844894215a9b985b96e6b7a465156bfd8d0168247b887e287a56201e107edae","schema_version":"1.0","event_id":"sha256:2844894215a9b985b96e6b7a465156bfd8d0168247b887e287a56201e107edae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA/bundle.json","state_url":"https://pith.science/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA/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-25T05:03:41Z","links":{"resolver":"https://pith.science/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA","bundle":"https://pith.science/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA/bundle.json","state":"https://pith.science/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VF5I3X2TCH5A6R5ALKNEIK6OMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VF5I3X2TCH5A6R5ALKNEIK6OMA","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":"2aa38a14a29e7958621b8acffc6f8b643df00d3828ebd9b74bc3d6786356b061","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-02T16:51:24Z","title_canon_sha256":"0079bbca4f64f2de4773f00aae6667d933f3e1c4f1ebdb4e05726be1ce919eb6"},"schema_version":"1.0","source":{"id":"1905.00848","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00848","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00848v2","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00848","created_at":"2026-05-17T23:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"VF5I3X2TCH5A","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VF5I3X2TCH5A6R5A","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VF5I3X2T","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:2844894215a9b985b96e6b7a465156bfd8d0168247b887e287a56201e107edae","target":"graph","created_at":"2026-05-17T23:47:01Z","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":"The framework of budget-feasible mechanism design studies procurement auctions where the auctioneer (buyer) aims to maximize his valuation function subject to a hard budget constraint. We study the problem of designing truthful mechanisms that have good approximation guarantees and never pay the participating agents (sellers) more than the budget. We focus on the case of general (non-monotone) submodular valuation functions and derive the first truthful, budget-feasible and $O(1)$-approximate mechanisms that run in polynomial time in the value query model, for both offline and online auctions.","authors_text":"Georgios Amanatidis, Guido Sch\\\"afer, Pieter Kleer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-02T16:51:24Z","title":"Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00848","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:fb4830e12bf74328099d3848407a45b00c09c3a30861fead4c2da24aa5b0bffc","target":"record","created_at":"2026-05-17T23:47:01Z","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":"2aa38a14a29e7958621b8acffc6f8b643df00d3828ebd9b74bc3d6786356b061","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-05-02T16:51:24Z","title_canon_sha256":"0079bbca4f64f2de4773f00aae6667d933f3e1c4f1ebdb4e05726be1ce919eb6"},"schema_version":"1.0","source":{"id":"1905.00848","kind":"arxiv","version":2}},"canonical_sha256":"a97a8ddf5311fa0f47a05a9a442bce601550786e787daaa0df5503ff555ea682","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a97a8ddf5311fa0f47a05a9a442bce601550786e787daaa0df5503ff555ea682","first_computed_at":"2026-05-17T23:47:01.135006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:01.135006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xFwBW3X8640t3rSmaqW2sd6Kcp/nPLgu/VNL5MF5Gor8YnzzhWBwQCTjyd7A3/NQdeLmmIDin0VuId+RbMUfCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:01.135579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00848","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb4830e12bf74328099d3848407a45b00c09c3a30861fead4c2da24aa5b0bffc","sha256:2844894215a9b985b96e6b7a465156bfd8d0168247b887e287a56201e107edae"],"state_sha256":"08b645b3546492b9740eb4139c97c011352f7733b00c6d2d33fa594a2ed53b62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hs9ZYx6dLZjsUUFqVEaD4uVoXd8fjMjRfhTXnn/BSxEKmeWSSObA5+8nZBAi9n7KvhXcVUSU/sshur2bdvX2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:03:41.157595Z","bundle_sha256":"e45c4a72eb3f7cd3fcaa56846c257fd1ab9bfc5b432072ece57df0ee37e05611"}}