{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G72BSFGBV6VVIPFIJLCD4DHLUT","short_pith_number":"pith:G72BSFGB","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"},"canonical_sha256":"37f41914c1afab543ca84ac43e0ceba4e65dc2d3532d8c3fd2aded95bc0aa367","source":{"kind":"arxiv","id":"1509.08516","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08516","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08516v4","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08516","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"G72BSFGBV6VV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G72BSFGBV6VVIPFI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G72BSFGB","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G72BSFGBV6VVIPFIJLCD4DHLUT","target":"record","payload":{"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"},"canonical_sha256":"37f41914c1afab543ca84ac43e0ceba4e65dc2d3532d8c3fd2aded95bc0aa367","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"},"source_kind":"arxiv","source_id":"1509.08516","source_version":4,"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-18T01:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naepGnoj83LTZhP+yO+/J62q3xgZcjBEfler1q7VaKD6wXbuDbOvqXqZLgm3vb3ZZJaWkMvwH9PL7DBReX3uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:56:40.952070Z"},"content_sha256":"21e653d19d19fa8a074f5b771c639b9e1bbbfb79f2f9eda49b21fddbac6c7826","schema_version":"1.0","event_id":"sha256:21e653d19d19fa8a074f5b771c639b9e1bbbfb79f2f9eda49b21fddbac6c7826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G72BSFGBV6VVIPFIJLCD4DHLUT","target":"graph","payload":{"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"},"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-18T01:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CcAmC5Aue2Wr9m2Ddk2Vdok8serEX4Xi6qeWQGM5Bv3WpgjDbBdZuwOV8vDyTwzUxvKPt77u1DLzKKLXUCBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:56:40.952713Z"},"content_sha256":"b82ce3ccf7353eb24421e5f58f5db35cbb114cc0bfaeec4ced6506722fd1bdfa","schema_version":"1.0","event_id":"sha256:b82ce3ccf7353eb24421e5f58f5db35cbb114cc0bfaeec4ced6506722fd1bdfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/bundle.json","state_url":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/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-26T05:56:40Z","links":{"resolver":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT","bundle":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/bundle.json","state":"https://pith.science/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G72BSFGBV6VVIPFIJLCD4DHLUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G72BSFGBV6VVIPFIJLCD4DHLUT","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":"e3e8c2c9b982de9dfa13801043abedebea930c77e992ccaeef299837dcfb7f1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-28T21:31:30Z","title_canon_sha256":"b95f03fa491bad9e3ad7647a431ff9cf9165730b4fdbd44ffa21a1ff1f89aae6"},"schema_version":"1.0","source":{"id":"1509.08516","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08516","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08516v4","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08516","created_at":"2026-05-18T01:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"G72BSFGBV6VV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G72BSFGBV6VVIPFI","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G72BSFGB","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:b82ce3ccf7353eb24421e5f58f5db35cbb114cc0bfaeec4ced6506722fd1bdfa","target":"graph","created_at":"2026-05-18T01:18: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":"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","authors_text":"Ali Pezeshki, Edwin K. P. Chong, Yajing Liu, Zhenliang Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-28T21:31:30Z","title":"Performance Bounds for the $k$-Batch Greedy Strategy in Optimization Problems with Curvature"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08516","kind":"arxiv","version":4},"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:21e653d19d19fa8a074f5b771c639b9e1bbbfb79f2f9eda49b21fddbac6c7826","target":"record","created_at":"2026-05-18T01:18: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":"e3e8c2c9b982de9dfa13801043abedebea930c77e992ccaeef299837dcfb7f1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-28T21:31:30Z","title_canon_sha256":"b95f03fa491bad9e3ad7647a431ff9cf9165730b4fdbd44ffa21a1ff1f89aae6"},"schema_version":"1.0","source":{"id":"1509.08516","kind":"arxiv","version":4}},"canonical_sha256":"37f41914c1afab543ca84ac43e0ceba4e65dc2d3532d8c3fd2aded95bc0aa367","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37f41914c1afab543ca84ac43e0ceba4e65dc2d3532d8c3fd2aded95bc0aa367","first_computed_at":"2026-05-18T01:18:42.817269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:42.817269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nfK5lfadnblhYdVLnSkkPnLsZb9gSJQpdBdILKQNHGt1Qe1Pq21KYWmQUe3rwIyag1MfzNXlI5TQ7LnCjue1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:42.817760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08516","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21e653d19d19fa8a074f5b771c639b9e1bbbfb79f2f9eda49b21fddbac6c7826","sha256:b82ce3ccf7353eb24421e5f58f5db35cbb114cc0bfaeec4ced6506722fd1bdfa"],"state_sha256":"8da3bf585b26509253d8b2b3c88411047001e0f5169595098ded033a84e8afe7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOaduQQBr+Ay0V1O9wohQVwwEuHWLcC6n547PWMNjzmIi8eDdJ5I/xxJYSBoQzmBs5ogH3O1gUXUWnfdWmSvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:56:40.955562Z","bundle_sha256":"5e62e06272179c0826906fcf13d5ab7b482198feb03ab00241df0d589bb8cd4c"}}