{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QF6T4JE4RJKRMDIC3MGELDB7JE","short_pith_number":"pith:QF6T4JE4","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"},"canonical_sha256":"817d3e249c8a55160d02db0c458c3f491ed21b9eaa5be1f02b6a85609cd1b7ef","source":{"kind":"arxiv","id":"1107.2869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2869","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2869v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2869","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"QF6T4JE4RJKR","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QF6T4JE4RJKRMDIC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QF6T4JE4","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QF6T4JE4RJKRMDIC3MGELDB7JE","target":"record","payload":{"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"},"canonical_sha256":"817d3e249c8a55160d02db0c458c3f491ed21b9eaa5be1f02b6a85609cd1b7ef","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"},"source_kind":"arxiv","source_id":"1107.2869","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:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKDk2hdkgrh4h2rvwX2Po4Qpb0xALfretqSReufUpF0ZGf7BbPBhWZSECJxQkE4JdUlGVDch2hGI6z9zv7QYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:08:50.322887Z"},"content_sha256":"b1e8b7b3795453a338a69f3bf32dd5eff25a78a3e4c286e7510c3f7638ee83fb","schema_version":"1.0","event_id":"sha256:b1e8b7b3795453a338a69f3bf32dd5eff25a78a3e4c286e7510c3f7638ee83fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QF6T4JE4RJKRMDIC3MGELDB7JE","target":"graph","payload":{"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"},"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:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tucSNUkY3ZIrt/1r4HhsspxNSamPDmzZsaLhrNtkc7S8OTizKdexjbHzjWtaxhBZeCQGpisrtkF4JOVNeSmXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:08:50.323604Z"},"content_sha256":"97092a61b9e6bbc7b0d20e1d7317aaa5682d2703883e2eadbf5ff6fb941c9e1f","schema_version":"1.0","event_id":"sha256:97092a61b9e6bbc7b0d20e1d7317aaa5682d2703883e2eadbf5ff6fb941c9e1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/bundle.json","state_url":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/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-07T20:08:50Z","links":{"resolver":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE","bundle":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/bundle.json","state":"https://pith.science/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QF6T4JE4RJKRMDIC3MGELDB7JE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QF6T4JE4RJKRMDIC3MGELDB7JE","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":"3088a3e4cbf4894b2824b94802c09a5133d45c3bf179e0e1ea6bdd8f267903e9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-14T17:01:04Z","title_canon_sha256":"0c923d2faefea77d617601a418b89a28ebce18f8387ba94276e89bb8a2d00a92"},"schema_version":"1.0","source":{"id":"1107.2869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2869","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2869v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2869","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"QF6T4JE4RJKR","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QF6T4JE4RJKRMDIC","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QF6T4JE4","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:97092a61b9e6bbc7b0d20e1d7317aaa5682d2703883e2eadbf5ff6fb941c9e1f","target":"graph","created_at":"2026-05-18T02:21:42Z","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 \\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","authors_text":"Ashwinkumar Badanidiyuru, Shahar Dobzinski, Sigal Oren","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-14T17:01:04Z","title":"Optimization with Demand Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2869","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:b1e8b7b3795453a338a69f3bf32dd5eff25a78a3e4c286e7510c3f7638ee83fb","target":"record","created_at":"2026-05-18T02:21:42Z","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":"3088a3e4cbf4894b2824b94802c09a5133d45c3bf179e0e1ea6bdd8f267903e9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-07-14T17:01:04Z","title_canon_sha256":"0c923d2faefea77d617601a418b89a28ebce18f8387ba94276e89bb8a2d00a92"},"schema_version":"1.0","source":{"id":"1107.2869","kind":"arxiv","version":1}},"canonical_sha256":"817d3e249c8a55160d02db0c458c3f491ed21b9eaa5be1f02b6a85609cd1b7ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"817d3e249c8a55160d02db0c458c3f491ed21b9eaa5be1f02b6a85609cd1b7ef","first_computed_at":"2026-05-18T02:21:42.867622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.867622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mR/WRyfyq+9L3vZQI8pHsBB3AOITaewNrM5tIycQyejfD75zlAV1uQjuW5Z/h5Y8FPgTg50uhq1d51uX9dbVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.868169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1e8b7b3795453a338a69f3bf32dd5eff25a78a3e4c286e7510c3f7638ee83fb","sha256:97092a61b9e6bbc7b0d20e1d7317aaa5682d2703883e2eadbf5ff6fb941c9e1f"],"state_sha256":"372e0b832aeaad5711d4bba4c066cb5a564c6e384341416fa3997a18ee6e62de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omJuwWc/t2mWYAVrlnADtepQaran0l2+fk6omN4uUL8E0Xt/M/NaBckrMvUddnrnbbkVpWnsQBfZVoEebuv/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:08:50.327726Z","bundle_sha256":"7990c76d52e738ba343f66f9d513f0e9e5840e5e6b45a7b94744769c0d44d3d2"}}