{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HHYTHAHPVZC7FD6Q2L6D3ADDZ3","short_pith_number":"pith:HHYTHAHP","schema_version":"1.0","canonical_sha256":"39f13380efae45f28fd0d2fc3d8063cec82feec4b0d1b1b0dbc6e45d2cd97230","source":{"kind":"arxiv","id":"2002.04063","version":1},"attestation_state":"computed","paper":{"title":"On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alfredo Torrico, Mohit Singh, Sebastian Pokutta","submitted_at":"2020-02-10T19:54:40Z","abstract_excerpt":"Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy algorithm guarantees a worst-case approximation factor of 1-1/e when maximizing a monotone submodular function under a cardinality constraint. However, empirical studies show that its performance is substantially better in practice. This raises a natural question of explaining this improved performance of the greedy algorithm. In this work, we define sharpness for submodular functions as a candidate explanation for "},"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":"2002.04063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-10T19:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"e50ba6cbb5795c316dbb1fc214350472fa06cb0503afbd38d2261885e1987454","abstract_canon_sha256":"d392f8abfe61ee2533a2e860d621f596d6a34b3aa59ca5f0fa128a0ed9494969"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:41.824371Z","signature_b64":"0h5vGVhYlBR1XC52a5FxIqcqWhs236sMUWO8yarCLGMSYMG0gDuN0UBht/6B7BYBrh5WAqS+OV0Zj7fB6UP4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39f13380efae45f28fd0d2fc3d8063cec82feec4b0d1b1b0dbc6e45d2cd97230","last_reissued_at":"2026-07-05T00:39:41.823840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:41.823840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alfredo Torrico, Mohit Singh, Sebastian Pokutta","submitted_at":"2020-02-10T19:54:40Z","abstract_excerpt":"Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy algorithm guarantees a worst-case approximation factor of 1-1/e when maximizing a monotone submodular function under a cardinality constraint. However, empirical studies show that its performance is substantially better in practice. This raises a natural question of explaining this improved performance of the greedy algorithm. In this work, we define sharpness for submodular functions as a candidate explanation for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.04063","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/2002.04063/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":"2002.04063","created_at":"2026-07-05T00:39:41.823906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.04063v1","created_at":"2026-07-05T00:39:41.823906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.04063","created_at":"2026-07-05T00:39:41.823906+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHYTHAHPVZC7","created_at":"2026-07-05T00:39:41.823906+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHYTHAHPVZC7FD6Q","created_at":"2026-07-05T00:39:41.823906+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHYTHAHP","created_at":"2026-07-05T00:39:41.823906+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/HHYTHAHPVZC7FD6Q2L6D3ADDZ3","json":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3.json","graph_json":"https://pith.science/api/pith-number/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/graph.json","events_json":"https://pith.science/api/pith-number/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/events.json","paper":"https://pith.science/paper/HHYTHAHP"},"agent_actions":{"view_html":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3","download_json":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3.json","view_paper":"https://pith.science/paper/HHYTHAHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.04063&json=true","fetch_graph":"https://pith.science/api/pith-number/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/action/storage_attestation","attest_author":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/action/author_attestation","sign_citation":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/action/citation_signature","submit_replication":"https://pith.science/pith/HHYTHAHPVZC7FD6Q2L6D3ADDZ3/action/replication_record"}},"created_at":"2026-07-05T00:39:41.823906+00:00","updated_at":"2026-07-05T00:39:41.823906+00:00"}