{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6HQFZFXCDLUZHS4VB3KSZ4WMQG","short_pith_number":"pith:6HQFZFXC","canonical_record":{"source":{"id":"1603.09029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-30T03:27:41Z","cross_cats_sorted":["cs.DM","math.OC","stat.ML"],"title_canon_sha256":"ff7274d852c419222ed353f485b800ffa2ee6bf40da6df2c69d08d23e7bb9ce6","abstract_canon_sha256":"3834bb6a20e5c8a61b06eff32516bb60282c717075fe3cf9a368634f6e8dbd22"},"schema_version":"1.0"},"canonical_sha256":"f1e05c96e21ae993cb950ed52cf2cc818ac9040bca9395f12635434d1f1e2391","source":{"kind":"arxiv","id":"1603.09029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09029","created_at":"2026-05-18T00:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09029v2","created_at":"2026-05-18T00:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09029","created_at":"2026-05-18T00:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"6HQFZFXCDLUZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6HQFZFXCDLUZHS4V","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6HQFZFXC","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6HQFZFXCDLUZHS4VB3KSZ4WMQG","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-30T03:27:41Z","cross_cats_sorted":["cs.DM","math.OC","stat.ML"],"title_canon_sha256":"ff7274d852c419222ed353f485b800ffa2ee6bf40da6df2c69d08d23e7bb9ce6","abstract_canon_sha256":"3834bb6a20e5c8a61b06eff32516bb60282c717075fe3cf9a368634f6e8dbd22"},"schema_version":"1.0"},"canonical_sha256":"f1e05c96e21ae993cb950ed52cf2cc818ac9040bca9395f12635434d1f1e2391","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:01.319505Z","signature_b64":"Ksp9qsmBreYNKWEHnZNUfA2FURdKNWSf2IqztRgDOuPwMFpKo2TxkKMtFRv3DgmJRMyslo5LXLrzff+pA5npDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1e05c96e21ae993cb950ed52cf2cc818ac9040bca9395f12635434d1f1e2391","last_reissued_at":"2026-05-18T00:44:01.318937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:01.318937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09029","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:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6GzZXw8iGVhHiohbH8lf/AXO0ZGePq5ah/3BpyD6vzKXAARrnqRhYH0FXz8FNCtwrwBBECu7lKWrWKn7YhHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:05:46.727411Z"},"content_sha256":"012deabd4228fa1aeaaeb48ab0e200557c559b77f658cbe80878b739a0c42e5e","schema_version":"1.0","event_id":"sha256:012deabd4228fa1aeaaeb48ab0e200557c559b77f658cbe80878b739a0c42e5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6HQFZFXCDLUZHS4VB3KSZ4WMQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC","stat.ML"],"primary_cat":"cs.AI","authors_text":"Huan Xu, Nguyen Viet Cuong","submitted_at":"2016-03-30T03:27:41Z","abstract_excerpt":"We study the worst-case adaptive optimization problem with budget constraint that is useful for modeling various practical applications in artificial intelligence and machine learning. We investigate the near-optimality of greedy algorithms for this problem with both modular and non-modular cost functions. In both cases, we prove that two simple greedy algorithms are not near-optimal but the best between them is near-optimal if the utility function satisfies pointwise submodularity and pointwise cost-sensitive submodularity respectively. This implies a combined algorithm that is near-optimal w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09029","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:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EljpEH8O6f4zgKo0DR5t9/t14xikmhcP+mXx9j9Z/iFGvpk8soCMCGyf6uBrAn6VfZDl1CLLIFytN+nYAi0dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:05:46.728115Z"},"content_sha256":"0f93f5defd50a2de498438dc4d9a648858b0b674be39a830c0b907c8fbd40e6a","schema_version":"1.0","event_id":"sha256:0f93f5defd50a2de498438dc4d9a648858b0b674be39a830c0b907c8fbd40e6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/bundle.json","state_url":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/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-06-06T15:05:46Z","links":{"resolver":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG","bundle":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/bundle.json","state":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6HQFZFXCDLUZHS4VB3KSZ4WMQG","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":"3834bb6a20e5c8a61b06eff32516bb60282c717075fe3cf9a368634f6e8dbd22","cross_cats_sorted":["cs.DM","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-30T03:27:41Z","title_canon_sha256":"ff7274d852c419222ed353f485b800ffa2ee6bf40da6df2c69d08d23e7bb9ce6"},"schema_version":"1.0","source":{"id":"1603.09029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09029","created_at":"2026-05-18T00:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09029v2","created_at":"2026-05-18T00:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09029","created_at":"2026-05-18T00:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"6HQFZFXCDLUZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6HQFZFXCDLUZHS4V","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6HQFZFXC","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:0f93f5defd50a2de498438dc4d9a648858b0b674be39a830c0b907c8fbd40e6a","target":"graph","created_at":"2026-05-18T00:44:01Z","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 study the worst-case adaptive optimization problem with budget constraint that is useful for modeling various practical applications in artificial intelligence and machine learning. We investigate the near-optimality of greedy algorithms for this problem with both modular and non-modular cost functions. In both cases, we prove that two simple greedy algorithms are not near-optimal but the best between them is near-optimal if the utility function satisfies pointwise submodularity and pointwise cost-sensitive submodularity respectively. This implies a combined algorithm that is near-optimal w","authors_text":"Huan Xu, Nguyen Viet Cuong","cross_cats":["cs.DM","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-30T03:27:41Z","title":"Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09029","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:012deabd4228fa1aeaaeb48ab0e200557c559b77f658cbe80878b739a0c42e5e","target":"record","created_at":"2026-05-18T00:44:01Z","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":"3834bb6a20e5c8a61b06eff32516bb60282c717075fe3cf9a368634f6e8dbd22","cross_cats_sorted":["cs.DM","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-30T03:27:41Z","title_canon_sha256":"ff7274d852c419222ed353f485b800ffa2ee6bf40da6df2c69d08d23e7bb9ce6"},"schema_version":"1.0","source":{"id":"1603.09029","kind":"arxiv","version":2}},"canonical_sha256":"f1e05c96e21ae993cb950ed52cf2cc818ac9040bca9395f12635434d1f1e2391","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1e05c96e21ae993cb950ed52cf2cc818ac9040bca9395f12635434d1f1e2391","first_computed_at":"2026-05-18T00:44:01.318937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:01.318937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ksp9qsmBreYNKWEHnZNUfA2FURdKNWSf2IqztRgDOuPwMFpKo2TxkKMtFRv3DgmJRMyslo5LXLrzff+pA5npDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:01.319505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:012deabd4228fa1aeaaeb48ab0e200557c559b77f658cbe80878b739a0c42e5e","sha256:0f93f5defd50a2de498438dc4d9a648858b0b674be39a830c0b907c8fbd40e6a"],"state_sha256":"da6fe8ac817982b18fe83ce88b102ef1726ca90f693eb6b520d917323fec3fd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2ejKeX4cyB/tGgtXuzYcDRuG1t3zzgFARY9B/h7c1EnHQJwSKcqmUks+ALVufofDo9aObNy2ZsfcArhJxDJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:05:46.731665Z","bundle_sha256":"a7bc8a40775b8feee8e791b084665127b24abf804340630d4f0ffbcc668e266b"}}