{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BHOML4FVAKMXWELLWDJQ6KWWT2","short_pith_number":"pith:BHOML4FV","schema_version":"1.0","canonical_sha256":"09dcc5f0b502997b116bb0d30f2ad69e91ce2109e4ce192b39b5657b5ccf4b9f","source":{"kind":"arxiv","id":"1511.07211","version":2},"attestation_state":"computed","paper":{"title":"Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Adish Singla, Andreas Krause, Sebastian Tschiatschek","submitted_at":"2015-11-23T13:19:05Z","abstract_excerpt":"We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ratings. For summarization tasks with the goal of maximizing coverage and diversity, submodular set functions are a natural choice. When the underlying submodular function is unknown, users' feedback can provide noisy evaluations of the function that we seek to maximize. We provide a generic algorithm -- \\submM{} -- for maximizing an unknown submo"},"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":"1511.07211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-23T13:19:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c2bd4b7c014264df6e9ebbfeee8e1a7229ee2c68ce462c010011690e2fb0a126","abstract_canon_sha256":"1771728060a45c9bdd278ef03073f1213d568d9429601cc785cf2bf9d2e59e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:33.224978Z","signature_b64":"uMNcijyLRuWKvAzgdbCvNfvkoWNo2t3WVwCTyBJJR/QJYEdN0Pz8cH5uE1pUy6AVQbC73Pl7tnRrp106Zc23CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09dcc5f0b502997b116bb0d30f2ad69e91ce2109e4ce192b39b5657b5ccf4b9f","last_reissued_at":"2026-05-18T01:25:33.224532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:33.224532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Adish Singla, Andreas Krause, Sebastian Tschiatschek","submitted_at":"2015-11-23T13:19:05Z","abstract_excerpt":"We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ratings. For summarization tasks with the goal of maximizing coverage and diversity, submodular set functions are a natural choice. When the underlying submodular function is unknown, users' feedback can provide noisy evaluations of the function that we seek to maximize. We provide a generic algorithm -- \\submM{} -- for maximizing an unknown submo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07211","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":"1511.07211","created_at":"2026-05-18T01:25:33.224599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07211v2","created_at":"2026-05-18T01:25:33.224599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07211","created_at":"2026-05-18T01:25:33.224599+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHOML4FVAKMX","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHOML4FVAKMXWELL","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHOML4FV","created_at":"2026-05-18T12:29:14.074870+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/BHOML4FVAKMXWELLWDJQ6KWWT2","json":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2.json","graph_json":"https://pith.science/api/pith-number/BHOML4FVAKMXWELLWDJQ6KWWT2/graph.json","events_json":"https://pith.science/api/pith-number/BHOML4FVAKMXWELLWDJQ6KWWT2/events.json","paper":"https://pith.science/paper/BHOML4FV"},"agent_actions":{"view_html":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2","download_json":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2.json","view_paper":"https://pith.science/paper/BHOML4FV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07211&json=true","fetch_graph":"https://pith.science/api/pith-number/BHOML4FVAKMXWELLWDJQ6KWWT2/graph.json","fetch_events":"https://pith.science/api/pith-number/BHOML4FVAKMXWELLWDJQ6KWWT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2/action/storage_attestation","attest_author":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2/action/author_attestation","sign_citation":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2/action/citation_signature","submit_replication":"https://pith.science/pith/BHOML4FVAKMXWELLWDJQ6KWWT2/action/replication_record"}},"created_at":"2026-05-18T01:25:33.224599+00:00","updated_at":"2026-05-18T01:25:33.224599+00:00"}