{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RRPYRNRQ6ZWQPWOLVME4JAM36V","short_pith_number":"pith:RRPYRNRQ","schema_version":"1.0","canonical_sha256":"8c5f88b630f66d07d9cbab09c4819bf545f33c11fee1b6525a3de49a25b769cd","source":{"kind":"arxiv","id":"1811.07673","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.07673","created_at":"2026-05-18T00:00:23.795709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07673v1","created_at":"2026-05-18T00:00:23.795709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07673","created_at":"2026-05-18T00:00:23.795709+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRPYRNRQ6ZWQ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRPYRNRQ6ZWQPWOL","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRPYRNRQ","created_at":"2026-05-18T12:32:50.500415+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/RRPYRNRQ6ZWQPWOLVME4JAM36V","json":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V.json","graph_json":"https://pith.science/api/pith-number/RRPYRNRQ6ZWQPWOLVME4JAM36V/graph.json","events_json":"https://pith.science/api/pith-number/RRPYRNRQ6ZWQPWOLVME4JAM36V/events.json","paper":"https://pith.science/paper/RRPYRNRQ"},"agent_actions":{"view_html":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V","download_json":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V.json","view_paper":"https://pith.science/paper/RRPYRNRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07673&json=true","fetch_graph":"https://pith.science/api/pith-number/RRPYRNRQ6ZWQPWOLVME4JAM36V/graph.json","fetch_events":"https://pith.science/api/pith-number/RRPYRNRQ6ZWQPWOLVME4JAM36V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/action/storage_attestation","attest_author":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/action/author_attestation","sign_citation":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/action/citation_signature","submit_replication":"https://pith.science/pith/RRPYRNRQ6ZWQPWOLVME4JAM36V/action/replication_record"}},"created_at":"2026-05-18T00:00:23.795709+00:00","updated_at":"2026-05-18T00:00:23.795709+00:00"}