{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MXYRA4KHEPGK2APOEUTVM2NDFM","short_pith_number":"pith:MXYRA4KH","schema_version":"1.0","canonical_sha256":"65f110714723ccad01ee25275669a32b216e984d8eccde00b265410e9ed4b2a6","source":{"kind":"arxiv","id":"2311.03685","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Non-monotone Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Kiarash Banihashem, Leyla Biabani, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Peyman Jabbarzade, Samira Goudarzi","submitted_at":"2023-11-07T03:20:02Z","abstract_excerpt":"Maximizing submodular functions has been increasingly used in many applications of machine learning, such as data summarization, recommendation systems, and feature selection. Moreover, there has been a growing interest in both submodular maximization and dynamic algorithms. In 2020, Monemizadeh and Lattanzi, Mitrovic, Norouzi{-}Fard, Tarnawski, and Zadimoghaddam initiated developing dynamic algorithms for the monotone submodular maximization problem under the cardinality constraint $k$. Recently, there have been some improvements on the topic made by Banihashem, Biabani, Goudarzi, Hajiaghayi,"},"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":"2311.03685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-11-07T03:20:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8ad02f7c0fe5133263d17fd0f5c1ba3043b019ca791fccadc1922d8888fce944","abstract_canon_sha256":"c7844a13f07ad133a98981700e5f5b04b15382e8be2847c759debcba4ead2260"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:03.211101Z","signature_b64":"hw/grhwwEOUC9vXIKvZpx/yFdcJM0IzBFav4poa//ibAJOt96UZTJSvvlQ13XY6SQe5iSl4zdGls3HZ5N/o3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f110714723ccad01ee25275669a32b216e984d8eccde00b265410e9ed4b2a6","last_reissued_at":"2026-07-05T07:10:03.210576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:03.210576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Non-monotone Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Kiarash Banihashem, Leyla Biabani, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Peyman Jabbarzade, Samira Goudarzi","submitted_at":"2023-11-07T03:20:02Z","abstract_excerpt":"Maximizing submodular functions has been increasingly used in many applications of machine learning, such as data summarization, recommendation systems, and feature selection. Moreover, there has been a growing interest in both submodular maximization and dynamic algorithms. In 2020, Monemizadeh and Lattanzi, Mitrovic, Norouzi{-}Fard, Tarnawski, and Zadimoghaddam initiated developing dynamic algorithms for the monotone submodular maximization problem under the cardinality constraint $k$. Recently, there have been some improvements on the topic made by Banihashem, Biabani, Goudarzi, Hajiaghayi,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03685","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.03685/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":"2311.03685","created_at":"2026-07-05T07:10:03.210661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03685v1","created_at":"2026-07-05T07:10:03.210661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03685","created_at":"2026-07-05T07:10:03.210661+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXYRA4KHEPGK","created_at":"2026-07-05T07:10:03.210661+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXYRA4KHEPGK2APO","created_at":"2026-07-05T07:10:03.210661+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXYRA4KH","created_at":"2026-07-05T07:10:03.210661+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/MXYRA4KHEPGK2APOEUTVM2NDFM","json":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM.json","graph_json":"https://pith.science/api/pith-number/MXYRA4KHEPGK2APOEUTVM2NDFM/graph.json","events_json":"https://pith.science/api/pith-number/MXYRA4KHEPGK2APOEUTVM2NDFM/events.json","paper":"https://pith.science/paper/MXYRA4KH"},"agent_actions":{"view_html":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM","download_json":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM.json","view_paper":"https://pith.science/paper/MXYRA4KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03685&json=true","fetch_graph":"https://pith.science/api/pith-number/MXYRA4KHEPGK2APOEUTVM2NDFM/graph.json","fetch_events":"https://pith.science/api/pith-number/MXYRA4KHEPGK2APOEUTVM2NDFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM/action/storage_attestation","attest_author":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM/action/author_attestation","sign_citation":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM/action/citation_signature","submit_replication":"https://pith.science/pith/MXYRA4KHEPGK2APOEUTVM2NDFM/action/replication_record"}},"created_at":"2026-07-05T07:10:03.210661+00:00","updated_at":"2026-07-05T07:10:03.210661+00:00"}