{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NJD47GODWHBX7RUZ6GC5EOUD4N","short_pith_number":"pith:NJD47GOD","schema_version":"1.0","canonical_sha256":"6a47cf99c3b1c37fc699f185d23a83e37d6ea2183de63e530402f54b76030791","source":{"kind":"arxiv","id":"2604.03419","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"ATCG matches full continuous greedy objective values while bounding communication via adaptive active-set gating.","cross_cats":["math.CO"],"primary_cat":"cs.LG","authors_text":"Mohammadreza Rostami, Solmaz S. Kia","submitted_at":"2026-04-03T19:32:39Z","abstract_excerpt":"Submodular maximization under matroid constraints is a fundamental problem in combinatorial optimization with applications in sensing, data summarization, active learning, and resource allocation. While the Sequential Greedy (SG) algorithm achieves only a $\\frac{1}{2}$-approximation due to irrevocable selections, Continuous Greedy (CG) attains the optimal $\\bigl(1-\\frac{1}{e}\\bigr)$-approximation via the multilinear relaxation, at the cost of a progressively dense decision vector that forces agents to exchange feature embeddings for nearly every ground-set element. We propose \\textit{ATCG} (\\u"},"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":true},"canonical_record":{"source":{"id":"2604.03419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-03T19:32:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1c93551d266895525d9383f41d116482c4e24898bc61c9bbdd6973c67be7ca19","abstract_canon_sha256":"194f8dd957841a1ecae53c9559a8b3cb19882f428a5a36d9522ff25c6079f8bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:12.490299Z","signature_b64":"sq/04DnYuhzloKRkOsBIHgyrCodB3RwuJeRdMnmDkYvuDng/OcKxc87yoT/NrX8Zyut7z8VNDX43xh/qCoojAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a47cf99c3b1c37fc699f185d23a83e37d6ea2183de63e530402f54b76030791","last_reissued_at":"2026-05-20T01:05:12.489409Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:12.489409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"ATCG matches full continuous greedy objective values while bounding communication via adaptive active-set gating.","cross_cats":["math.CO"],"primary_cat":"cs.LG","authors_text":"Mohammadreza Rostami, Solmaz S. Kia","submitted_at":"2026-04-03T19:32:39Z","abstract_excerpt":"Submodular maximization under matroid constraints is a fundamental problem in combinatorial optimization with applications in sensing, data summarization, active learning, and resource allocation. While the Sequential Greedy (SG) algorithm achieves only a $\\frac{1}{2}$-approximation due to irrevocable selections, Continuous Greedy (CG) attains the optimal $\\bigl(1-\\frac{1}{e}\\bigr)$-approximation via the multilinear relaxation, at the cost of a progressively dense decision vector that forces agents to exchange feature embeddings for nearly every ground-set element. We propose \\textit{ATCG} (\\u"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"ATCG achieves objective values comparable to those of the full CG method while substantially reducing communication overhead through adaptive active-set expansion, with a curvature-aware approximation guarantee τ_eff = max{τ, 1-c}.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the per-partition progress ratio η_i can be chosen so that gating gradient evaluations does not cause the captured marginal gains to fall below the level needed for the stated approximation factor to hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ATCG adaptively thresholds continuous greedy updates to limit communication in distributed submodular maximization under matroid constraints while retaining a curvature-aware approximation guarantee.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"ATCG matches full continuous greedy objective values while bounding communication via adaptive active-set gating.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"612f9f2feaaf1b2262cd5673094f745f1ce9970462c257feda722d5878c4a50b"},"source":{"id":"2604.03419","kind":"arxiv","version":2},"verdict":{"id":"1e64d2c9-a598-4ba1-a4e0-5515fda3d156","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T19:48:07.962229Z","strongest_claim":"ATCG achieves objective values comparable to those of the full CG method while substantially reducing communication overhead through adaptive active-set expansion, with a curvature-aware approximation guarantee τ_eff = max{τ, 1-c}.","one_line_summary":"ATCG adaptively thresholds continuous greedy updates to limit communication in distributed submodular maximization under matroid constraints while retaining a curvature-aware approximation guarantee.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the per-partition progress ratio η_i can be chosen so that gating gradient evaluations does not cause the captured marginal gains to fall below the level needed for the stated approximation factor to hold.","pith_extraction_headline":"ATCG matches full continuous greedy objective values while bounding communication via adaptive active-set gating."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.03419/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0d91355411ef257f93d90a3b60357118fc0be759a971b832a57a0590c8571f19"},"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":"2604.03419","created_at":"2026-05-20T01:05:12.489518+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.03419v2","created_at":"2026-05-20T01:05:12.489518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.03419","created_at":"2026-05-20T01:05:12.489518+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJD47GODWHBX","created_at":"2026-05-20T01:05:12.489518+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJD47GODWHBX7RUZ","created_at":"2026-05-20T01:05:12.489518+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJD47GOD","created_at":"2026-05-20T01:05:12.489518+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N","json":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N.json","graph_json":"https://pith.science/api/pith-number/NJD47GODWHBX7RUZ6GC5EOUD4N/graph.json","events_json":"https://pith.science/api/pith-number/NJD47GODWHBX7RUZ6GC5EOUD4N/events.json","paper":"https://pith.science/paper/NJD47GOD"},"agent_actions":{"view_html":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N","download_json":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N.json","view_paper":"https://pith.science/paper/NJD47GOD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.03419&json=true","fetch_graph":"https://pith.science/api/pith-number/NJD47GODWHBX7RUZ6GC5EOUD4N/graph.json","fetch_events":"https://pith.science/api/pith-number/NJD47GODWHBX7RUZ6GC5EOUD4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N/action/storage_attestation","attest_author":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N/action/author_attestation","sign_citation":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N/action/citation_signature","submit_replication":"https://pith.science/pith/NJD47GODWHBX7RUZ6GC5EOUD4N/action/replication_record"}},"created_at":"2026-05-20T01:05:12.489518+00:00","updated_at":"2026-05-20T01:05:12.489518+00:00"}