{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NLSA2KUXUVP6XLG7EMJMUICT6J","short_pith_number":"pith:NLSA2KUX","schema_version":"1.0","canonical_sha256":"6ae40d2a97a55febacdf2312ca2053f24d6abf3915bb35db4bc4eaeb329db720","source":{"kind":"arxiv","id":"1705.10253","version":3},"attestation_state":"computed","paper":{"title":"General Bounds for Incremental Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Aaron Bernstein, Martin Gro{\\ss}, Yann Disser","submitted_at":"2017-05-29T15:25:30Z","abstract_excerpt":"We propose a theoretical framework to capture incremental solutions to cardinality constrained maximization problems. The defining characteristic of our framework is that the cardinality/support of the solution is bounded by a value $k\\in\\mathbb{N}$ that grows over time, and we allow the solution to be extended one element at a time. We investigate the best-possible competitive ratio of such an incremental solution, i.e., the worst ratio over all $k$ between the incremental solution after $k$ steps and an optimum solution of cardinality $k$. We define a large class of problems that contains ma"},"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":"1705.10253","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-29T15:25:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b4cb38d6e2d482fa634e608929299bd0dccff69b4a8f50b482121d50cea1627b","abstract_canon_sha256":"acbaa8b1f0f277c78e8f159cad304cd0db712cca1c3c30f3f4bafb49ce0aae1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:25.803874Z","signature_b64":"jqmeILJqcFKUvuuMnxYbrUQ2dgrtwz/zVKUc4zrBw/qv0XPjG400jYYLVrkRLCa0dxn7xhk9Bu1jybUHj+hsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ae40d2a97a55febacdf2312ca2053f24d6abf3915bb35db4bc4eaeb329db720","last_reissued_at":"2026-05-18T00:18:25.803476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:25.803476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Bounds for Incremental Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Aaron Bernstein, Martin Gro{\\ss}, Yann Disser","submitted_at":"2017-05-29T15:25:30Z","abstract_excerpt":"We propose a theoretical framework to capture incremental solutions to cardinality constrained maximization problems. The defining characteristic of our framework is that the cardinality/support of the solution is bounded by a value $k\\in\\mathbb{N}$ that grows over time, and we allow the solution to be extended one element at a time. We investigate the best-possible competitive ratio of such an incremental solution, i.e., the worst ratio over all $k$ between the incremental solution after $k$ steps and an optimum solution of cardinality $k$. We define a large class of problems that contains ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10253","kind":"arxiv","version":3},"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":"1705.10253","created_at":"2026-05-18T00:18:25.803535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10253v3","created_at":"2026-05-18T00:18:25.803535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10253","created_at":"2026-05-18T00:18:25.803535+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLSA2KUXUVP6","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLSA2KUXUVP6XLG7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLSA2KUX","created_at":"2026-05-18T12:31:31.346846+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/NLSA2KUXUVP6XLG7EMJMUICT6J","json":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J.json","graph_json":"https://pith.science/api/pith-number/NLSA2KUXUVP6XLG7EMJMUICT6J/graph.json","events_json":"https://pith.science/api/pith-number/NLSA2KUXUVP6XLG7EMJMUICT6J/events.json","paper":"https://pith.science/paper/NLSA2KUX"},"agent_actions":{"view_html":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J","download_json":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J.json","view_paper":"https://pith.science/paper/NLSA2KUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10253&json=true","fetch_graph":"https://pith.science/api/pith-number/NLSA2KUXUVP6XLG7EMJMUICT6J/graph.json","fetch_events":"https://pith.science/api/pith-number/NLSA2KUXUVP6XLG7EMJMUICT6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/action/storage_attestation","attest_author":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/action/author_attestation","sign_citation":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/action/citation_signature","submit_replication":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/action/replication_record"}},"created_at":"2026-05-18T00:18:25.803535+00:00","updated_at":"2026-05-18T00:18:25.803535+00:00"}