{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M6NKCZO3HBWU4CS5SEFHS3QDIR","short_pith_number":"pith:M6NKCZO3","schema_version":"1.0","canonical_sha256":"679aa165db386d4e0a5d910a796e03446fdad3a0399a47319724089933cd2768","source":{"kind":"arxiv","id":"1807.05532","version":1},"attestation_state":"computed","paper":{"title":"Deterministic (1/2 + {\\epsilon})-Approximation for Submodular Maximization over a Matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohit Garg, Moran Feldman, Niv Buchbinder","submitted_at":"2018-07-15T11:57:00Z","abstract_excerpt":"We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + {\\epsilon})-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978."},"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":"1807.05532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T11:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"5ed379ce696d811abcdf75ea1f65df2d26876942a0a751f31cff7c30e8f61bbc","abstract_canon_sha256":"c4a456c0d076cc0c000eb52b63fcbb1d22bd6d5752eeb2bc1296068b49b55323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:43.291445Z","signature_b64":"R7oczrDglJ5IfU++xiBwlUazAg8Toyg6AjPo5Zg+aA8ZkQMPUsOj0gBL1oLyB/gi0Mzo1DjDUVlxUjUmX2ZZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"679aa165db386d4e0a5d910a796e03446fdad3a0399a47319724089933cd2768","last_reissued_at":"2026-05-18T00:10:43.290841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:43.290841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic (1/2 + {\\epsilon})-Approximation for Submodular Maximization over a Matroid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohit Garg, Moran Feldman, Niv Buchbinder","submitted_at":"2018-07-15T11:57:00Z","abstract_excerpt":"We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + {\\epsilon})-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05532","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":"1807.05532","created_at":"2026-05-18T00:10:43.290930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05532v1","created_at":"2026-05-18T00:10:43.290930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05532","created_at":"2026-05-18T00:10:43.290930+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6NKCZO3HBWU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6NKCZO3HBWU4CS5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6NKCZO3","created_at":"2026-05-18T12:32:37.024351+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/M6NKCZO3HBWU4CS5SEFHS3QDIR","json":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR.json","graph_json":"https://pith.science/api/pith-number/M6NKCZO3HBWU4CS5SEFHS3QDIR/graph.json","events_json":"https://pith.science/api/pith-number/M6NKCZO3HBWU4CS5SEFHS3QDIR/events.json","paper":"https://pith.science/paper/M6NKCZO3"},"agent_actions":{"view_html":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR","download_json":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR.json","view_paper":"https://pith.science/paper/M6NKCZO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05532&json=true","fetch_graph":"https://pith.science/api/pith-number/M6NKCZO3HBWU4CS5SEFHS3QDIR/graph.json","fetch_events":"https://pith.science/api/pith-number/M6NKCZO3HBWU4CS5SEFHS3QDIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR/action/storage_attestation","attest_author":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR/action/author_attestation","sign_citation":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR/action/citation_signature","submit_replication":"https://pith.science/pith/M6NKCZO3HBWU4CS5SEFHS3QDIR/action/replication_record"}},"created_at":"2026-05-18T00:10:43.290930+00:00","updated_at":"2026-05-18T00:10:43.290930+00:00"}