{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G72BSFGBV6VVIPFIJLCD4DHLUT","short_pith_number":"pith:G72BSFGB","schema_version":"1.0","canonical_sha256":"37f41914c1afab543ca84ac43e0ceba4e65dc2d3532d8c3fd2aded95bc0aa367","source":{"kind":"arxiv","id":"1509.08516","version":4},"attestation_state":"computed","paper":{"title":"Performance Bounds for the $k$-Batch Greedy Strategy in Optimization Problems with Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Yajing Liu, Zhenliang Zhang","submitted_at":"2015-09-28T21:31:30Z","abstract_excerpt":"The $k$-batch greedy strategy is an approximate algorithm to solve optimization problems where the optimal solution is hard to obtain. Starting with the empty set, the $k$-batch greedy strategy adds a batch of $k$ elements to the current solution set with the largest gain in the objective function while satisfying the constraints. In this paper, we bound the performance of the $k$-batch greedy strategy with respect to the optimal strategy by defining the total curvature $\\alpha_k$. We show that when the objective function is nondecreasing and submodular, the $k$-batch greedy strategy satisfies"},"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":"1509.08516","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-28T21:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"b95f03fa491bad9e3ad7647a431ff9cf9165730b4fdbd44ffa21a1ff1f89aae6","abstract_canon_sha256":"e3e8c2c9b982de9dfa13801043abedebea930c77e992ccaeef299837dcfb7f1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:42.817760Z","signature_b64":"nfK5lfadnblhYdVLnSkkPnLsZb9gSJQpdBdILKQNHGt1Qe1Pq21KYWmQUe3rwIyag1MfzNXlI5TQ7LnCjue1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f41914c1afab543ca84ac43e0ceba4e65dc2d3532d8c3fd2aded95bc0aa367","last_reissued_at":"2026-05-18T01:18:42.817269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:42.817269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Bounds for the $k$-Batch Greedy Strategy in Optimization Problems with Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Yajing Liu, Zhenliang Zhang","submitted_at":"2015-09-28T21:31:30Z","abstract_excerpt":"The $k$-batch greedy strategy is an approximate algorithm to solve optimization problems where the optimal solution is hard to obtain. Starting with the empty set, the $k$-batch greedy strategy adds a batch of $k$ elements to the current solution set with the largest gain in the objective function while satisfying the constraints. In this paper, we bound the performance of the $k$-batch greedy strategy with respect to the optimal strategy by defining the total curvature $\\alpha_k$. We show that when the objective function is nondecreasing and submodular, the $k$-batch greedy strategy satisfies"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08516","kind":"arxiv","version":4},"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":"1509.08516","created_at":"2026-05-18T01:18:42.817347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08516v4","created_at":"2026-05-18T01:18:42.817347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08516","created_at":"2026-05-18T01:18:42.817347+00:00"},{"alias_kind":"pith_short_12","alias_value":"G72BSFGBV6VV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G72BSFGBV6VVIPFI","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G72BSFGB","created_at":"2026-05-18T12:29:22.688609+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/G72BSFGBV6VVIPFIJLCD4DHLUT","json":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT.json","graph_json":"https://pith.science/api/pith-number/G72BSFGBV6VVIPFIJLCD4DHLUT/graph.json","events_json":"https://pith.science/api/pith-number/G72BSFGBV6VVIPFIJLCD4DHLUT/events.json","paper":"https://pith.science/paper/G72BSFGB"},"agent_actions":{"view_html":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT","download_json":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT.json","view_paper":"https://pith.science/paper/G72BSFGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08516&json=true","fetch_graph":"https://pith.science/api/pith-number/G72BSFGBV6VVIPFIJLCD4DHLUT/graph.json","fetch_events":"https://pith.science/api/pith-number/G72BSFGBV6VVIPFIJLCD4DHLUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/action/storage_attestation","attest_author":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/action/author_attestation","sign_citation":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/action/citation_signature","submit_replication":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/action/replication_record"}},"created_at":"2026-05-18T01:18:42.817347+00:00","updated_at":"2026-05-18T01:18:42.817347+00:00"}