{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RRPYRNRQ6ZWQPWOLVME4JAM36V","short_pith_number":"pith:RRPYRNRQ","canonical_record":{"source":{"id":"1811.07673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T13:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"c12a75707d82adb2a348872207ed1984cfab408c4eb00a4c97101a8a71cd2594","abstract_canon_sha256":"3db8344819898a0e2c0adf0fdf984ade1d10a61cffb110e844d368f63f638704"},"schema_version":"1.0"},"canonical_sha256":"8c5f88b630f66d07d9cbab09c4819bf545f33c11fee1b6525a3de49a25b769cd","source":{"kind":"arxiv","id":"1811.07673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07673","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07673v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07673","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"RRPYRNRQ6ZWQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRPYRNRQ6ZWQPWOL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRPYRNRQ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RRPYRNRQ6ZWQPWOLVME4JAM36V","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T13:32:37Z","cross_cats_sorted":[],"title_canon_sha256":"c12a75707d82adb2a348872207ed1984cfab408c4eb00a4c97101a8a71cd2594","abstract_canon_sha256":"3db8344819898a0e2c0adf0fdf984ade1d10a61cffb110e844d368f63f638704"},"schema_version":"1.0"},"canonical_sha256":"8c5f88b630f66d07d9cbab09c4819bf545f33c11fee1b6525a3de49a25b769cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:23.796276Z","signature_b64":"SmVGLqakBkiSVr13pZzke2SEimseCVFffDvdWg8yjr4G9XisZh2NF2j24UN4MVAOyw4CQDrJKdtHUBpFz4r/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c5f88b630f66d07d9cbab09c4819bf545f33c11fee1b6525a3de49a25b769cd","last_reissued_at":"2026-05-18T00:00:23.795580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:23.795580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07673","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:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOX1uegfEg5uzA3hRgH13BQQrkjxEiEBW3l350Z9AieU23tLlbotRTZRfw5u6lGMNzohMIC0oze/mug70S87DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:50:17.353308Z"},"content_sha256":"117d7cb53253808a20e3985e5d598b77f096cd838c40e5246a0a7c599dfa361b","schema_version":"1.0","event_id":"sha256:117d7cb53253808a20e3985e5d598b77f096cd838c40e5246a0a7c599dfa361b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RRPYRNRQ6ZWQPWOLVME4JAM36V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast submodular maximization subject to k-extendible system constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Tsourdos, Hyo-Sang Shin, Teng Li","submitted_at":"2018-11-19T13:32:37Z","abstract_excerpt":"As the scales of data sets expand rapidly in some application scenarios, increasing efforts have been made to develop fast submodular maximization algorithms. This paper presents a currently the most efficient algorithm for maximizing general non-negative submodular objective functions subject to $k$-extendible system constraints. Combining the sampling process and the decreasing threshold strategy, our algorithm Sample Decreasing Threshold Greedy Algorithm (SDTGA) obtains an expected approximation guarantee of ($p-\\epsilon$) for monotone submodular functions and of ($p(1-p)-\\epsilon$) for non"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07673","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:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnhIfQrHzhoGEWrj2bmW9x/GeVmI2fR7lg1RuAgoeJzAnn34urUMQQeLnjpO7l2A+dpN27ezVKxJ+rAkJfSsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:50:17.353709Z"},"content_sha256":"cb546cd95c9c99acbcb12f805d44b0ab44bfb4b7dcc514ed3d13802735769459","schema_version":"1.0","event_id":"sha256:cb546cd95c9c99acbcb12f805d44b0ab44bfb4b7dcc514ed3d13802735769459"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/bundle.json","state_url":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/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-03T02:50:17Z","links":{"resolver":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V","bundle":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/bundle.json","state":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RRPYRNRQ6ZWQPWOLVME4JAM36V","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":"3db8344819898a0e2c0adf0fdf984ade1d10a61cffb110e844d368f63f638704","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T13:32:37Z","title_canon_sha256":"c12a75707d82adb2a348872207ed1984cfab408c4eb00a4c97101a8a71cd2594"},"schema_version":"1.0","source":{"id":"1811.07673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07673","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07673v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07673","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"RRPYRNRQ6ZWQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRPYRNRQ6ZWQPWOL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRPYRNRQ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:cb546cd95c9c99acbcb12f805d44b0ab44bfb4b7dcc514ed3d13802735769459","target":"graph","created_at":"2026-05-18T00:00:23Z","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":"As the scales of data sets expand rapidly in some application scenarios, increasing efforts have been made to develop fast submodular maximization algorithms. This paper presents a currently the most efficient algorithm for maximizing general non-negative submodular objective functions subject to $k$-extendible system constraints. Combining the sampling process and the decreasing threshold strategy, our algorithm Sample Decreasing Threshold Greedy Algorithm (SDTGA) obtains an expected approximation guarantee of ($p-\\epsilon$) for monotone submodular functions and of ($p(1-p)-\\epsilon$) for non","authors_text":"Antonios Tsourdos, Hyo-Sang Shin, Teng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T13:32:37Z","title":"Fast submodular maximization subject to k-extendible system constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07673","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:117d7cb53253808a20e3985e5d598b77f096cd838c40e5246a0a7c599dfa361b","target":"record","created_at":"2026-05-18T00:00:23Z","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":"3db8344819898a0e2c0adf0fdf984ade1d10a61cffb110e844d368f63f638704","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T13:32:37Z","title_canon_sha256":"c12a75707d82adb2a348872207ed1984cfab408c4eb00a4c97101a8a71cd2594"},"schema_version":"1.0","source":{"id":"1811.07673","kind":"arxiv","version":1}},"canonical_sha256":"8c5f88b630f66d07d9cbab09c4819bf545f33c11fee1b6525a3de49a25b769cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c5f88b630f66d07d9cbab09c4819bf545f33c11fee1b6525a3de49a25b769cd","first_computed_at":"2026-05-18T00:00:23.795580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:23.795580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmVGLqakBkiSVr13pZzke2SEimseCVFffDvdWg8yjr4G9XisZh2NF2j24UN4MVAOyw4CQDrJKdtHUBpFz4r/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:23.796276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:117d7cb53253808a20e3985e5d598b77f096cd838c40e5246a0a7c599dfa361b","sha256:cb546cd95c9c99acbcb12f805d44b0ab44bfb4b7dcc514ed3d13802735769459"],"state_sha256":"40f48f7900ad76ec55f22b79fd1e381d42e47e51235921ed71b4c7f68bedc847"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BqTOUInravStS9NwGhPm2Cw2hufW0ojS9nMkbnahD8RJVkGgWLjNfhxmu0M3VYRQpJ/iT11QI7NpsQA4ctkaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:50:17.355685Z","bundle_sha256":"5d8fb45e68201b691bb18887b5e2280111787f2ba33ca2da564786b5fa939a29"}}