{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GZUWLNVWY5DXWRXGZOYUANTZZT","short_pith_number":"pith:GZUWLNVW","canonical_record":{"source":{"id":"1810.12861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-30T17:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"1f2f25ce310012587b2db30dbe927f797254236ff8b83ce173262101852f6fce","abstract_canon_sha256":"0bb42fd30533a2d9e88adc52b2400f22c1081c1005f170fdfff56e4916147829"},"schema_version":"1.0"},"canonical_sha256":"366965b6b6c7477b46e6cbb1403679cceabb6b57a971828d61653e49e1af6ae8","source":{"kind":"arxiv","id":"1810.12861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12861","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12861v1","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12861","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"GZUWLNVWY5DX","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZUWLNVWY5DXWRXG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZUWLNVW","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GZUWLNVWY5DXWRXGZOYUANTZZT","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-30T17:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"1f2f25ce310012587b2db30dbe927f797254236ff8b83ce173262101852f6fce","abstract_canon_sha256":"0bb42fd30533a2d9e88adc52b2400f22c1081c1005f170fdfff56e4916147829"},"schema_version":"1.0"},"canonical_sha256":"366965b6b6c7477b46e6cbb1403679cceabb6b57a971828d61653e49e1af6ae8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.960886Z","signature_b64":"xda4qJ2YHg9BqpP6GwJ3yZI3uyRE3V35SeS4fQYaq0kVBgt8LUr4K5bXdvW+rVgHKfy367y55tc+3+sHsIEzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"366965b6b6c7477b46e6cbb1403679cceabb6b57a971828d61653e49e1af6ae8","last_reissued_at":"2026-05-18T00:01:53.960379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.960379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12861","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwDIZX20rd10a53RHJYCNLDXVN2abp44O2x+KMhql5HpNlQ8GOAoqrYe+iYkbkdl2OzM1ArW2/P+bbS44HDJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:58:05.581766Z"},"content_sha256":"c7ecda557fb47ebda412b2413bb817844d226bfba640cf3d1d0637a1f50a17b7","schema_version":"1.0","event_id":"sha256:c7ecda557fb47ebda412b2413bb817844d226bfba640cf3d1d0637a1f50a17b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GZUWLNVWY5DXWRXGZOYUANTZZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nived Rajaraman, Rahul Vaze","submitted_at":"2018-10-30T17:02:12Z","abstract_excerpt":"The classical problem of maximizing a submodular function under a matroid constraint is considered. Defining a new measure for the increments made by the greedy algorithm at each step, called the discriminant, improved approximation ratio guarantees are derived for the greedy algorithm. At each step, discriminant measures the multiplicative gap in the incremental valuation between the item chosen by the greedy algorithm and the largest potential incremental valuation for eligible items not selected by it. The new guarantee subsumes all the previous known results for the greedy algorithm, inclu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12861","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-18T00:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kn6Vn2eZ83dvZGf+JVEgER2ea0LJyTSMS7UudlkBBx+Lnz6j3qWW5GDeWOUpqalYoYisAaUBoX3KcWYXMK4kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:58:05.582113Z"},"content_sha256":"d89ae6ef9d32ade63108a3ba8d4ba75a17f49d928bf31c6ad9235dfc72acb7af","schema_version":"1.0","event_id":"sha256:d89ae6ef9d32ade63108a3ba8d4ba75a17f49d928bf31c6ad9235dfc72acb7af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZUWLNVWY5DXWRXGZOYUANTZZT/bundle.json","state_url":"https://pith.science/pith/GZUWLNVWY5DXWRXGZOYUANTZZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZUWLNVWY5DXWRXGZOYUANTZZT/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-25T22:58:05Z","links":{"resolver":"https://pith.science/pith/GZUWLNVWY5DXWRXGZOYUANTZZT","bundle":"https://pith.science/pith/GZUWLNVWY5DXWRXGZOYUANTZZT/bundle.json","state":"https://pith.science/pith/GZUWLNVWY5DXWRXGZOYUANTZZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZUWLNVWY5DXWRXGZOYUANTZZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GZUWLNVWY5DXWRXGZOYUANTZZT","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":"0bb42fd30533a2d9e88adc52b2400f22c1081c1005f170fdfff56e4916147829","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-30T17:02:12Z","title_canon_sha256":"1f2f25ce310012587b2db30dbe927f797254236ff8b83ce173262101852f6fce"},"schema_version":"1.0","source":{"id":"1810.12861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12861","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12861v1","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12861","created_at":"2026-05-18T00:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"GZUWLNVWY5DX","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GZUWLNVWY5DXWRXG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GZUWLNVW","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:d89ae6ef9d32ade63108a3ba8d4ba75a17f49d928bf31c6ad9235dfc72acb7af","target":"graph","created_at":"2026-05-18T00:01:53Z","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 classical problem of maximizing a submodular function under a matroid constraint is considered. Defining a new measure for the increments made by the greedy algorithm at each step, called the discriminant, improved approximation ratio guarantees are derived for the greedy algorithm. At each step, discriminant measures the multiplicative gap in the incremental valuation between the item chosen by the greedy algorithm and the largest potential incremental valuation for eligible items not selected by it. The new guarantee subsumes all the previous known results for the greedy algorithm, inclu","authors_text":"Nived Rajaraman, Rahul Vaze","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-30T17:02:12Z","title":"Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12861","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:c7ecda557fb47ebda412b2413bb817844d226bfba640cf3d1d0637a1f50a17b7","target":"record","created_at":"2026-05-18T00:01:53Z","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":"0bb42fd30533a2d9e88adc52b2400f22c1081c1005f170fdfff56e4916147829","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-30T17:02:12Z","title_canon_sha256":"1f2f25ce310012587b2db30dbe927f797254236ff8b83ce173262101852f6fce"},"schema_version":"1.0","source":{"id":"1810.12861","kind":"arxiv","version":1}},"canonical_sha256":"366965b6b6c7477b46e6cbb1403679cceabb6b57a971828d61653e49e1af6ae8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"366965b6b6c7477b46e6cbb1403679cceabb6b57a971828d61653e49e1af6ae8","first_computed_at":"2026-05-18T00:01:53.960379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:53.960379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xda4qJ2YHg9BqpP6GwJ3yZI3uyRE3V35SeS4fQYaq0kVBgt8LUr4K5bXdvW+rVgHKfy367y55tc+3+sHsIEzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:53.960886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7ecda557fb47ebda412b2413bb817844d226bfba640cf3d1d0637a1f50a17b7","sha256:d89ae6ef9d32ade63108a3ba8d4ba75a17f49d928bf31c6ad9235dfc72acb7af"],"state_sha256":"7f088176a5e018d1ff50cbfdf1e99a3649e54ab80c936441eecf1cb4581b07b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcpA12NrHYh1zARyYQTiA0ravSc6dR8G0doMfi9Oi6IfRUhRRPP1xSmDHoDyt8dbWAXb6FsaMODInctUXfwCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:58:05.584059Z","bundle_sha256":"1293bc36c2ad4e0a72f8864a38aa17f71c6ae5e005e7c7eef13b5c57efd7b399"}}