{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QF6T4JE4RJKRMDIC3MGELDB7JE","short_pith_number":"pith:QF6T4JE4","schema_version":"1.0","canonical_sha256":"817d3e249c8a55160d02db0c458c3f491ed21b9eaa5be1f02b6a85609cd1b7ef","source":{"kind":"arxiv","id":"1107.2869","version":1},"attestation_state":"computed","paper":{"title":"Optimization with Demand Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren","submitted_at":"2011-07-14T17:01:04Z","abstract_excerpt":"We study \\emph{combinatorial procurement auctions}, where a buyer with a valuation function $v$ and budget $B$ wishes to buy a set of items. Each item $i$ has a cost $c_i$ and the buyer is interested in a set $S$ that maximizes $v(S)$ subject to $\\Sigma_{i\\in S}c_i\\leq B$. Special cases of combinatorial procurement auctions are classical problems from submodular optimization. In particular, when the costs are all equal (\\emph{cardinality constraint}), a classic result by Nemhauser et al shows that the greedy algorithm provides an $\\frac e {e-1}$ approximation.\n  Motivated by many papers that u"},"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.2869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-14T17:01:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0c923d2faefea77d617601a418b89a28ebce18f8387ba94276e89bb8a2d00a92","abstract_canon_sha256":"3088a3e4cbf4894b2824b94802c09a5133d45c3bf179e0e1ea6bdd8f267903e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.868169Z","signature_b64":"mR/WRyfyq+9L3vZQI8pHsBB3AOITaewNrM5tIycQyejfD75zlAV1uQjuW5Z/h5Y8FPgTg50uhq1d51uX9dbVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817d3e249c8a55160d02db0c458c3f491ed21b9eaa5be1f02b6a85609cd1b7ef","last_reissued_at":"2026-05-18T02:21:42.867622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.867622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization with Demand Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren","submitted_at":"2011-07-14T17:01:04Z","abstract_excerpt":"We study \\emph{combinatorial procurement auctions}, where a buyer with a valuation function $v$ and budget $B$ wishes to buy a set of items. Each item $i$ has a cost $c_i$ and the buyer is interested in a set $S$ that maximizes $v(S)$ subject to $\\Sigma_{i\\in S}c_i\\leq B$. Special cases of combinatorial procurement auctions are classical problems from submodular optimization. In particular, when the costs are all equal (\\emph{cardinality constraint}), a classic result by Nemhauser et al shows that the greedy algorithm provides an $\\frac e {e-1}$ approximation.\n  Motivated by many papers that u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2869","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":"1107.2869","created_at":"2026-05-18T02:21:42.867706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2869v1","created_at":"2026-05-18T02:21:42.867706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2869","created_at":"2026-05-18T02:21:42.867706+00:00"},{"alias_kind":"pith_short_12","alias_value":"QF6T4JE4RJKR","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QF6T4JE4RJKRMDIC","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QF6T4JE4","created_at":"2026-05-18T12:26:39.201973+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/QF6T4JE4RJKRMDIC3MGELDB7JE","json":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE.json","graph_json":"https://pith.science/api/pith-number/QF6T4JE4RJKRMDIC3MGELDB7JE/graph.json","events_json":"https://pith.science/api/pith-number/QF6T4JE4RJKRMDIC3MGELDB7JE/events.json","paper":"https://pith.science/paper/QF6T4JE4"},"agent_actions":{"view_html":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE","download_json":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE.json","view_paper":"https://pith.science/paper/QF6T4JE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2869&json=true","fetch_graph":"https://pith.science/api/pith-number/QF6T4JE4RJKRMDIC3MGELDB7JE/graph.json","fetch_events":"https://pith.science/api/pith-number/QF6T4JE4RJKRMDIC3MGELDB7JE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/action/storage_attestation","attest_author":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/action/author_attestation","sign_citation":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/action/citation_signature","submit_replication":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/action/replication_record"}},"created_at":"2026-05-18T02:21:42.867706+00:00","updated_at":"2026-05-18T02:21:42.867706+00:00"}