{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A7OFGACHXEYQRFAGJAZ4YLADFV","short_pith_number":"pith:A7OFGACH","schema_version":"1.0","canonical_sha256":"07dc530047b9310894064833cc2c032d489ed3dcd3dc7fd370c1d7358533920f","source":{"kind":"arxiv","id":"1605.03628","version":4},"attestation_state":"computed","paper":{"title":"Performance Bounds with Curvature for Batched Greedy Optimization","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":"2016-05-11T22:09:50Z","abstract_excerpt":"The batched greedy strategy is an approximation algorithm to maximize a set function subject to a matroid constraint. Starting with the empty set, the batched greedy strategy iteratively adds to the current solution set a batch of elements that results in the largest gain in the objective function while satisfying the matroid constraints. In this paper, we develop bounds on the performance of the batched greedy strategy relative to the optimal strategy in terms of a parameter called the total batched curvature. We show that when the objective function is a polymatroid set function, the batched"},"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":"1605.03628","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-11T22:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"60411619bac6202b3a2e166c819bf8d333cdf9aa71a5526e1e8bb1a1db187b8c","abstract_canon_sha256":"94646e18d99a950e56a4aa75b6e626bc227305256eaae33e3d9b48fdf42a6d66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:44.160365Z","signature_b64":"8YHgQKRK5QtvLsYoRrYg8lxVTrO9JlC5Iq/v1p+KDsaBAFrf08O1yZxlbBHMf3Dpevfr2YGnDR/mPUUn/5TKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07dc530047b9310894064833cc2c032d489ed3dcd3dc7fd370c1d7358533920f","last_reissued_at":"2026-05-18T00:33:44.159723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:44.159723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Bounds with Curvature for Batched Greedy Optimization","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":"2016-05-11T22:09:50Z","abstract_excerpt":"The batched greedy strategy is an approximation algorithm to maximize a set function subject to a matroid constraint. Starting with the empty set, the batched greedy strategy iteratively adds to the current solution set a batch of elements that results in the largest gain in the objective function while satisfying the matroid constraints. In this paper, we develop bounds on the performance of the batched greedy strategy relative to the optimal strategy in terms of a parameter called the total batched curvature. We show that when the objective function is a polymatroid set function, the batched"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03628","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":"1605.03628","created_at":"2026-05-18T00:33:44.159821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03628v4","created_at":"2026-05-18T00:33:44.159821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03628","created_at":"2026-05-18T00:33:44.159821+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7OFGACHXEYQ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7OFGACHXEYQRFAG","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7OFGACH","created_at":"2026-05-18T12:30:04.600751+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/A7OFGACHXEYQRFAGJAZ4YLADFV","json":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV.json","graph_json":"https://pith.science/api/pith-number/A7OFGACHXEYQRFAGJAZ4YLADFV/graph.json","events_json":"https://pith.science/api/pith-number/A7OFGACHXEYQRFAGJAZ4YLADFV/events.json","paper":"https://pith.science/paper/A7OFGACH"},"agent_actions":{"view_html":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV","download_json":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV.json","view_paper":"https://pith.science/paper/A7OFGACH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03628&json=true","fetch_graph":"https://pith.science/api/pith-number/A7OFGACHXEYQRFAGJAZ4YLADFV/graph.json","fetch_events":"https://pith.science/api/pith-number/A7OFGACHXEYQRFAGJAZ4YLADFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV/action/storage_attestation","attest_author":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV/action/author_attestation","sign_citation":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV/action/citation_signature","submit_replication":"https://pith.science/pith/A7OFGACHXEYQRFAGJAZ4YLADFV/action/replication_record"}},"created_at":"2026-05-18T00:33:44.159821+00:00","updated_at":"2026-05-18T00:33:44.159821+00:00"}