{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B6G5PTPLEPYEHZSJJEDVFSEWVF","short_pith_number":"pith:B6G5PTPL","schema_version":"1.0","canonical_sha256":"0f8dd7cdeb23f043e649490752c896a952dff32afb3326dda7ea2a2ee25d213c","source":{"kind":"arxiv","id":"1702.07002","version":2},"attestation_state":"computed","paper":{"title":"Deterministic & Adaptive Non-Submodular Maximization via the Primal Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"J. David Smith, My T. Thai","submitted_at":"2017-02-22T20:59:22Z","abstract_excerpt":"While greedy algorithms have long been observed to perform well on a wide variety of problems, up to now approximation ratios have only been known for their application to problems having submodular objective functions $f$. Since many practical problems have non-submodular $f$, there is a critical need to devise new techniques to bound the performance of greedy algorithms in the case of non-submodularity.\n  Our primary contribution is the introduction of a novel technique for estimating the approximation ratio of the greedy algorithm for maximization of monotone non-decreasing functions based "},"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":"1702.07002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T20:59:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bdaa212e5a352b03feec48fe45d25e4e54ef09e398923630911ceb69b0baeaa4","abstract_canon_sha256":"5f1c81c6a7b5330d8467c7a77e7fcd67c7abb338fc721fd1b4fd7e9a112dd96a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.311450Z","signature_b64":"4/mBGFIJ77SfeJCa1sGgYhep6pK8UbKEyBsXbz+LW9VIJyq4fiTHuCtwnpg5z1CzpSQTUgwmTJqiMmH+5nyOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f8dd7cdeb23f043e649490752c896a952dff32afb3326dda7ea2a2ee25d213c","last_reissued_at":"2026-05-18T00:26:08.310773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.310773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic & Adaptive Non-Submodular Maximization via the Primal Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"J. David Smith, My T. Thai","submitted_at":"2017-02-22T20:59:22Z","abstract_excerpt":"While greedy algorithms have long been observed to perform well on a wide variety of problems, up to now approximation ratios have only been known for their application to problems having submodular objective functions $f$. Since many practical problems have non-submodular $f$, there is a critical need to devise new techniques to bound the performance of greedy algorithms in the case of non-submodularity.\n  Our primary contribution is the introduction of a novel technique for estimating the approximation ratio of the greedy algorithm for maximization of monotone non-decreasing functions based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07002","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":""},"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":"1702.07002","created_at":"2026-05-18T00:26:08.310866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07002v2","created_at":"2026-05-18T00:26:08.310866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07002","created_at":"2026-05-18T00:26:08.310866+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6G5PTPLEPYE","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6G5PTPLEPYEHZSJ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6G5PTPL","created_at":"2026-05-18T12:31:08.081275+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/B6G5PTPLEPYEHZSJJEDVFSEWVF","json":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF.json","graph_json":"https://pith.science/api/pith-number/B6G5PTPLEPYEHZSJJEDVFSEWVF/graph.json","events_json":"https://pith.science/api/pith-number/B6G5PTPLEPYEHZSJJEDVFSEWVF/events.json","paper":"https://pith.science/paper/B6G5PTPL"},"agent_actions":{"view_html":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF","download_json":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF.json","view_paper":"https://pith.science/paper/B6G5PTPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07002&json=true","fetch_graph":"https://pith.science/api/pith-number/B6G5PTPLEPYEHZSJJEDVFSEWVF/graph.json","fetch_events":"https://pith.science/api/pith-number/B6G5PTPLEPYEHZSJJEDVFSEWVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/action/storage_attestation","attest_author":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/action/author_attestation","sign_citation":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/action/citation_signature","submit_replication":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/action/replication_record"}},"created_at":"2026-05-18T00:26:08.310866+00:00","updated_at":"2026-05-18T00:26:08.310866+00:00"}