{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E66GUT2WGO4MPBB7PHG735UW2S","short_pith_number":"pith:E66GUT2W","schema_version":"1.0","canonical_sha256":"27bc6a4f5633b8c7843f79cdfdf696d4966a03a0cb4c648db502dd5280581eb3","source":{"kind":"arxiv","id":"1507.07237","version":1},"attestation_state":"computed","paper":{"title":"A Deterministic Algorithm for Maximizing Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ami Mor, Shahar Dobzinski","submitted_at":"2015-07-26T19:40:24Z","abstract_excerpt":"The problem of maximizing a non-negative submodular function was introduced by Feige, Mirrokni, and Vondrak [FOCS'07] who provided a deterministic local-search based algorithm that guarantees an approximation ratio of $\\frac 1 3$, as well as a randomized $\\frac 2 5$-approximation algorithm. An extensive line of research followed and various algorithms with improving approximation ratios were developed, all of them are randomized. Finally, Buchbinder et al. [FOCS'12] presented a randomized $\\frac 1 2$-approximation algorithm, which is the best possible.\n  This paper gives the first deterministi"},"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":"1507.07237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-26T19:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"d80ef3c7e67e55cb9984d840a5194d14d6eb7ad27b19c1ed0405322f1d6338fe","abstract_canon_sha256":"3cc10a8cd5764ac4854a04596a71720f4d1210c922a63bf763d8095bcc1fa35f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:16.848588Z","signature_b64":"roK9osI3AjchxEF5+YTeqDC7E/C8jPiyaERXp41R/Abe3apQvWyEAe8i15QVWx7eV1tEfXDIorHNA2d64DmzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27bc6a4f5633b8c7843f79cdfdf696d4966a03a0cb4c648db502dd5280581eb3","last_reissued_at":"2026-05-18T01:36:16.848117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:16.848117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Algorithm for Maximizing Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ami Mor, Shahar Dobzinski","submitted_at":"2015-07-26T19:40:24Z","abstract_excerpt":"The problem of maximizing a non-negative submodular function was introduced by Feige, Mirrokni, and Vondrak [FOCS'07] who provided a deterministic local-search based algorithm that guarantees an approximation ratio of $\\frac 1 3$, as well as a randomized $\\frac 2 5$-approximation algorithm. An extensive line of research followed and various algorithms with improving approximation ratios were developed, all of them are randomized. Finally, Buchbinder et al. [FOCS'12] presented a randomized $\\frac 1 2$-approximation algorithm, which is the best possible.\n  This paper gives the first deterministi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07237","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":"1507.07237","created_at":"2026-05-18T01:36:16.848197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07237v1","created_at":"2026-05-18T01:36:16.848197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07237","created_at":"2026-05-18T01:36:16.848197+00:00"},{"alias_kind":"pith_short_12","alias_value":"E66GUT2WGO4M","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"E66GUT2WGO4MPBB7","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"E66GUT2W","created_at":"2026-05-18T12:29:19.899920+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/E66GUT2WGO4MPBB7PHG735UW2S","json":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S.json","graph_json":"https://pith.science/api/pith-number/E66GUT2WGO4MPBB7PHG735UW2S/graph.json","events_json":"https://pith.science/api/pith-number/E66GUT2WGO4MPBB7PHG735UW2S/events.json","paper":"https://pith.science/paper/E66GUT2W"},"agent_actions":{"view_html":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S","download_json":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S.json","view_paper":"https://pith.science/paper/E66GUT2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07237&json=true","fetch_graph":"https://pith.science/api/pith-number/E66GUT2WGO4MPBB7PHG735UW2S/graph.json","fetch_events":"https://pith.science/api/pith-number/E66GUT2WGO4MPBB7PHG735UW2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S/action/storage_attestation","attest_author":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S/action/author_attestation","sign_citation":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S/action/citation_signature","submit_replication":"https://pith.science/pith/E66GUT2WGO4MPBB7PHG735UW2S/action/replication_record"}},"created_at":"2026-05-18T01:36:16.848197+00:00","updated_at":"2026-05-18T01:36:16.848197+00:00"}