{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JIX74A2YPYVZRUI6XLVUY27TN2","short_pith_number":"pith:JIX74A2Y","schema_version":"1.0","canonical_sha256":"4a2ffe03587e2b98d11ebaeb4c6bf36ebc13358f37bf1ee17a241f7dafa4f6f1","source":{"kind":"arxiv","id":"2202.00132","version":2},"attestation_state":"computed","paper":{"title":"Submodularity In Machine Learning and Artificial Intelligence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jeff Bilmes","submitted_at":"2022-01-31T22:41:35Z","abstract_excerpt":"In this manuscript, we offer a gentle review of submodularity and supermodularity and their properties. We offer a plethora of submodular definitions; a full description of a number of example submodular functions and their generalizations; example discrete constraints; a discussion of basic algorithms for maximization, minimization, and other operations; a brief overview of continuous submodular extensions; and some historical applications. We then turn to how submodularity is useful in machine learning and artificial intelligence. This includes summarization, and we offer a complete account "},"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":"2202.00132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-31T22:41:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ab1b83300857fe008ddf8c72754eb9a4bf8ab5cdf8029a6409486a586907f560","abstract_canon_sha256":"3f0defa0ecdb4b50da0c88154e1827b85d9ebdde9124417992b43f2b4cbfae54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:57.685645Z","signature_b64":"ToKB9dwBky4NrfIPo4mSbZIHRjuNKqgNVuEwRKtForOklmSPrXg7z0P3u2UjHcW+szUinfA2+dunXFFhZEg3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a2ffe03587e2b98d11ebaeb4c6bf36ebc13358f37bf1ee17a241f7dafa4f6f1","last_reissued_at":"2026-07-05T05:02:57.685120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:57.685120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodularity In Machine Learning and Artificial Intelligence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jeff Bilmes","submitted_at":"2022-01-31T22:41:35Z","abstract_excerpt":"In this manuscript, we offer a gentle review of submodularity and supermodularity and their properties. We offer a plethora of submodular definitions; a full description of a number of example submodular functions and their generalizations; example discrete constraints; a discussion of basic algorithms for maximization, minimization, and other operations; a brief overview of continuous submodular extensions; and some historical applications. We then turn to how submodularity is useful in machine learning and artificial intelligence. This includes summarization, and we offer a complete account "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00132","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.00132/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":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":"2202.00132","created_at":"2026-07-05T05:02:57.685182+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00132v2","created_at":"2026-07-05T05:02:57.685182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00132","created_at":"2026-07-05T05:02:57.685182+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIX74A2YPYVZ","created_at":"2026-07-05T05:02:57.685182+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIX74A2YPYVZRUI6","created_at":"2026-07-05T05:02:57.685182+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIX74A2Y","created_at":"2026-07-05T05:02:57.685182+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10192","citing_title":"Submodular Optimization with Applications to Decision and Control","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00725","citing_title":"Recall Is Not Enough: A Reader-Context Diagnostic for Budget-Constrained Retrieval-Augmented Generation","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00843","citing_title":"Submodular Maximization over Many Matroids via Ordered Local Search","ref_index":167,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24779","citing_title":"Complement Submodular Information Measures for Balanced and Robust Data Selection","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29448","citing_title":"How Much Is a Dataset Worth? Scaling Laws, the Vendi Score, and Matrix Spectral Functions","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12872","citing_title":"SMA: Submodular Modality Aligner For Data Efficient Multimodal Learning","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2309.12284","citing_title":"MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06900","citing_title":"Accelerated Relax-and-Round for Concave Coverage Problems","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2","json":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2.json","graph_json":"https://pith.science/api/pith-number/JIX74A2YPYVZRUI6XLVUY27TN2/graph.json","events_json":"https://pith.science/api/pith-number/JIX74A2YPYVZRUI6XLVUY27TN2/events.json","paper":"https://pith.science/paper/JIX74A2Y"},"agent_actions":{"view_html":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2","download_json":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2.json","view_paper":"https://pith.science/paper/JIX74A2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00132&json=true","fetch_graph":"https://pith.science/api/pith-number/JIX74A2YPYVZRUI6XLVUY27TN2/graph.json","fetch_events":"https://pith.science/api/pith-number/JIX74A2YPYVZRUI6XLVUY27TN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2/action/storage_attestation","attest_author":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2/action/author_attestation","sign_citation":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2/action/citation_signature","submit_replication":"https://pith.science/pith/JIX74A2YPYVZRUI6XLVUY27TN2/action/replication_record"}},"created_at":"2026-07-05T05:02:57.685182+00:00","updated_at":"2026-07-05T05:02:57.685182+00:00"}