{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6HQFZFXCDLUZHS4VB3KSZ4WMQG","short_pith_number":"pith:6HQFZFXC","schema_version":"1.0","canonical_sha256":"f1e05c96e21ae993cb950ed52cf2cc818ac9040bca9395f12635434d1f1e2391","source":{"kind":"arxiv","id":"1603.09029","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.09029","created_at":"2026-05-18T00:44:01.319027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09029v2","created_at":"2026-05-18T00:44:01.319027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09029","created_at":"2026-05-18T00:44:01.319027+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HQFZFXCDLUZ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HQFZFXCDLUZHS4V","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HQFZFXC","created_at":"2026-05-18T12:30:01.593930+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/6HQFZFXCDLUZHS4VB3KSZ4WMQG","json":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG.json","graph_json":"https://pith.science/api/pith-number/6HQFZFXCDLUZHS4VB3KSZ4WMQG/graph.json","events_json":"https://pith.science/api/pith-number/6HQFZFXCDLUZHS4VB3KSZ4WMQG/events.json","paper":"https://pith.science/paper/6HQFZFXC"},"agent_actions":{"view_html":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG","download_json":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG.json","view_paper":"https://pith.science/paper/6HQFZFXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09029&json=true","fetch_graph":"https://pith.science/api/pith-number/6HQFZFXCDLUZHS4VB3KSZ4WMQG/graph.json","fetch_events":"https://pith.science/api/pith-number/6HQFZFXCDLUZHS4VB3KSZ4WMQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/action/storage_attestation","attest_author":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/action/author_attestation","sign_citation":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/action/citation_signature","submit_replication":"https://pith.science/pith/6HQFZFXCDLUZHS4VB3KSZ4WMQG/action/replication_record"}},"created_at":"2026-05-18T00:44:01.319027+00:00","updated_at":"2026-05-18T00:44:01.319027+00:00"}