{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NLSA2KUXUVP6XLG7EMJMUICT6J","short_pith_number":"pith:NLSA2KUX","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"},"canonical_sha256":"6ae40d2a97a55febacdf2312ca2053f24d6abf3915bb35db4bc4eaeb329db720","source":{"kind":"arxiv","id":"1705.10253","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10253","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10253v3","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10253","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"NLSA2KUXUVP6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLSA2KUXUVP6XLG7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLSA2KUX","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NLSA2KUXUVP6XLG7EMJMUICT6J","target":"record","payload":{"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"},"canonical_sha256":"6ae40d2a97a55febacdf2312ca2053f24d6abf3915bb35db4bc4eaeb329db720","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"},"source_kind":"arxiv","source_id":"1705.10253","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFOgeSZcm+5GtfK22rKyrNdlz/zQP8JCAJ2QFb3+W7gxEyE3DyCFf7jMyv9dxIILAmkpTYBkap+OlymH6FegCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:35:48.955932Z"},"content_sha256":"73c0035180e49141e6fcc9b03f500bba21288098d447d9d3abf17144dab44cc9","schema_version":"1.0","event_id":"sha256:73c0035180e49141e6fcc9b03f500bba21288098d447d9d3abf17144dab44cc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NLSA2KUXUVP6XLG7EMJMUICT6J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80vBhJd6SWPOJqvDQgLWMqiIkmNjcUivh1okDazffMLpLuI2ZDwvGsLZArhXFCGDHrIiH5Tx5KvQAHGpZrGYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:35:48.956698Z"},"content_sha256":"7c1150a904747603a6436add441d2eb3b14cd05dee3628c93200f7012ee001a5","schema_version":"1.0","event_id":"sha256:7c1150a904747603a6436add441d2eb3b14cd05dee3628c93200f7012ee001a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/bundle.json","state_url":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T07:35:48Z","links":{"resolver":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J","bundle":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/bundle.json","state":"https://pith.science/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLSA2KUXUVP6XLG7EMJMUICT6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NLSA2KUXUVP6XLG7EMJMUICT6J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"acbaa8b1f0f277c78e8f159cad304cd0db712cca1c3c30f3f4bafb49ce0aae1f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-29T15:25:30Z","title_canon_sha256":"b4cb38d6e2d482fa634e608929299bd0dccff69b4a8f50b482121d50cea1627b"},"schema_version":"1.0","source":{"id":"1705.10253","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10253","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10253v3","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10253","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"NLSA2KUXUVP6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLSA2KUXUVP6XLG7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLSA2KUX","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:7c1150a904747603a6436add441d2eb3b14cd05dee3628c93200f7012ee001a5","target":"graph","created_at":"2026-05-18T00:18:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aaron Bernstein, Martin Gro{\\ss}, Yann Disser","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-29T15:25:30Z","title":"General Bounds for Incremental Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10253","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73c0035180e49141e6fcc9b03f500bba21288098d447d9d3abf17144dab44cc9","target":"record","created_at":"2026-05-18T00:18:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"acbaa8b1f0f277c78e8f159cad304cd0db712cca1c3c30f3f4bafb49ce0aae1f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-29T15:25:30Z","title_canon_sha256":"b4cb38d6e2d482fa634e608929299bd0dccff69b4a8f50b482121d50cea1627b"},"schema_version":"1.0","source":{"id":"1705.10253","kind":"arxiv","version":3}},"canonical_sha256":"6ae40d2a97a55febacdf2312ca2053f24d6abf3915bb35db4bc4eaeb329db720","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ae40d2a97a55febacdf2312ca2053f24d6abf3915bb35db4bc4eaeb329db720","first_computed_at":"2026-05-18T00:18:25.803476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:25.803476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jqmeILJqcFKUvuuMnxYbrUQ2dgrtwz/zVKUc4zrBw/qv0XPjG400jYYLVrkRLCa0dxn7xhk9Bu1jybUHj+hsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:25.803874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10253","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73c0035180e49141e6fcc9b03f500bba21288098d447d9d3abf17144dab44cc9","sha256:7c1150a904747603a6436add441d2eb3b14cd05dee3628c93200f7012ee001a5"],"state_sha256":"4f638fcf8c253c3052177fa457e172eb5cc97f02e67e2307236a64fa3ba603dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJ00NDej06qcQnR9tNgVn4hqBGULMhWo6GOlXbxI38yDK51RCXcE/QstNBTvhUhYdweTUGFrfHDCAZeu9SVFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:35:48.960412Z","bundle_sha256":"5dad077b9a69aa4ce14a02b2584f2312236abfbdb8dc9db51f8b2fe7298d5bc9"}}