{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B6G5PTPLEPYEHZSJJEDVFSEWVF","short_pith_number":"pith:B6G5PTPL","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"},"canonical_sha256":"0f8dd7cdeb23f043e649490752c896a952dff32afb3326dda7ea2a2ee25d213c","source":{"kind":"arxiv","id":"1702.07002","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07002","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07002v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07002","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"B6G5PTPLEPYE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B6G5PTPLEPYEHZSJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B6G5PTPL","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B6G5PTPLEPYEHZSJJEDVFSEWVF","target":"record","payload":{"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"},"canonical_sha256":"0f8dd7cdeb23f043e649490752c896a952dff32afb3326dda7ea2a2ee25d213c","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"},"source_kind":"arxiv","source_id":"1702.07002","source_version":2,"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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mFNgEirj13txjBPAji6yBVFFIdVBEsNDZE4d41ZYkl0TDFqG13Ix2eE8fWjsb0aY6HtlSspGxByEjGOhue8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:48:37.508332Z"},"content_sha256":"921fac612e46e72f449fd740a282fbaaf38d913021e998e9136a9d7ded5c25c2","schema_version":"1.0","event_id":"sha256:921fac612e46e72f449fd740a282fbaaf38d913021e998e9136a9d7ded5c25c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B6G5PTPLEPYEHZSJJEDVFSEWVF","target":"graph","payload":{"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"},"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:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7szRPgXIy5W/UNcdx8yW/g53uCsaSRmOc7LaBCIXp9gJHE5NyGzNlEBNtwdO3SXeCBKhxO+jslRKcoc1F2KUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:48:37.508990Z"},"content_sha256":"f28b85e400986eee9e23cad80b735d8970731f62b48290c8cd3b074daee6a4c0","schema_version":"1.0","event_id":"sha256:f28b85e400986eee9e23cad80b735d8970731f62b48290c8cd3b074daee6a4c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/bundle.json","state_url":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/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-28T20:48:37Z","links":{"resolver":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF","bundle":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/bundle.json","state":"https://pith.science/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6G5PTPLEPYEHZSJJEDVFSEWVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B6G5PTPLEPYEHZSJJEDVFSEWVF","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":"5f1c81c6a7b5330d8467c7a77e7fcd67c7abb338fc721fd1b4fd7e9a112dd96a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T20:59:22Z","title_canon_sha256":"bdaa212e5a352b03feec48fe45d25e4e54ef09e398923630911ceb69b0baeaa4"},"schema_version":"1.0","source":{"id":"1702.07002","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07002","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07002v2","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07002","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"B6G5PTPLEPYE","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B6G5PTPLEPYEHZSJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B6G5PTPL","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:f28b85e400986eee9e23cad80b735d8970731f62b48290c8cd3b074daee6a4c0","target":"graph","created_at":"2026-05-18T00:26:08Z","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":"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 ","authors_text":"J. David Smith, My T. Thai","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T20:59:22Z","title":"Deterministic & Adaptive Non-Submodular Maximization via the Primal Curvature"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07002","kind":"arxiv","version":2},"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:921fac612e46e72f449fd740a282fbaaf38d913021e998e9136a9d7ded5c25c2","target":"record","created_at":"2026-05-18T00:26:08Z","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":"5f1c81c6a7b5330d8467c7a77e7fcd67c7abb338fc721fd1b4fd7e9a112dd96a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-22T20:59:22Z","title_canon_sha256":"bdaa212e5a352b03feec48fe45d25e4e54ef09e398923630911ceb69b0baeaa4"},"schema_version":"1.0","source":{"id":"1702.07002","kind":"arxiv","version":2}},"canonical_sha256":"0f8dd7cdeb23f043e649490752c896a952dff32afb3326dda7ea2a2ee25d213c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f8dd7cdeb23f043e649490752c896a952dff32afb3326dda7ea2a2ee25d213c","first_computed_at":"2026-05-18T00:26:08.310773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.310773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/mBGFIJ77SfeJCa1sGgYhep6pK8UbKEyBsXbz+LW9VIJyq4fiTHuCtwnpg5z1CzpSQTUgwmTJqiMmH+5nyOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.311450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07002","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:921fac612e46e72f449fd740a282fbaaf38d913021e998e9136a9d7ded5c25c2","sha256:f28b85e400986eee9e23cad80b735d8970731f62b48290c8cd3b074daee6a4c0"],"state_sha256":"2376b3d2d1baa18882719f9ca583c5e3892ee062ed6e4af3418e3d8fb2f8626b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dbwkyqv4QbHtx5UCy5nG1F+WhzkL2mlO6j/xu2KfxejdGkkz116A0k6oXHzqZ6jqXHUp0qvSDrObcTNXBav0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:48:37.512405Z","bundle_sha256":"11217e3836e2c821704b4344b31fba2ec9fed5a053d16fd0135cd9c65839ca80"}}