{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GQIGMTRXFRMZWBQNAVTOMY3P5Q","short_pith_number":"pith:GQIGMTRX","schema_version":"1.0","canonical_sha256":"3410664e372c599b060d0566e6636fec2a5f9e256da7aadad48ff1106542226d","source":{"kind":"arxiv","id":"1506.00935","version":1},"attestation_state":"computed","paper":{"title":"Discovering Valuable Items from Massive Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Andreas Marfurt, Charles-Antoine Robelin, Donald Kossmann, Hastagiri P. Vanchinathan","submitted_at":"2015-06-02T16:01:46Z","abstract_excerpt":"Suppose there is a large collection of items, each with an associated cost and an inherent utility that is revealed only once we commit to selecting it. Given a budget on the cumulative cost of the selected items, how can we pick a subset of maximal value? This task generalizes several important problems such as multi-arm bandits, active search and the knapsack problem. We present an algorithm, GP-Select, which utilizes prior knowledge about similarity be- tween items, expressed as a kernel function. GP-Select uses Gaussian process prediction to balance exploration (estimating the unknown valu"},"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":"1506.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T16:01:46Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"title_canon_sha256":"73a016a627c05cd86bc1f2177430b9090247a8ceb9e419db3eae74d7fe2e1b85","abstract_canon_sha256":"5d3ff19e27a7766720250bcff3afaa956516779242d3bf0b19e0acaf6cf119c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:59.426188Z","signature_b64":"me6vksFHpUQZMgSL+foHFf7+g+u0Ptjp4US90S9fApM8QRAu1Zx6t76nBaLaCSuCt30QyfKbjFYZrnpofvNkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3410664e372c599b060d0566e6636fec2a5f9e256da7aadad48ff1106542226d","last_reissued_at":"2026-05-18T01:55:59.425715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:59.425715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Valuable Items from Massive Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Andreas Marfurt, Charles-Antoine Robelin, Donald Kossmann, Hastagiri P. Vanchinathan","submitted_at":"2015-06-02T16:01:46Z","abstract_excerpt":"Suppose there is a large collection of items, each with an associated cost and an inherent utility that is revealed only once we commit to selecting it. Given a budget on the cumulative cost of the selected items, how can we pick a subset of maximal value? This task generalizes several important problems such as multi-arm bandits, active search and the knapsack problem. We present an algorithm, GP-Select, which utilizes prior knowledge about similarity be- tween items, expressed as a kernel function. GP-Select uses Gaussian process prediction to balance exploration (estimating the unknown valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00935","kind":"arxiv","version":1},"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":"1506.00935","created_at":"2026-05-18T01:55:59.425787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00935v1","created_at":"2026-05-18T01:55:59.425787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00935","created_at":"2026-05-18T01:55:59.425787+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQIGMTRXFRMZ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQIGMTRXFRMZWBQN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQIGMTRX","created_at":"2026-05-18T12:29:22.688609+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/GQIGMTRXFRMZWBQNAVTOMY3P5Q","json":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q.json","graph_json":"https://pith.science/api/pith-number/GQIGMTRXFRMZWBQNAVTOMY3P5Q/graph.json","events_json":"https://pith.science/api/pith-number/GQIGMTRXFRMZWBQNAVTOMY3P5Q/events.json","paper":"https://pith.science/paper/GQIGMTRX"},"agent_actions":{"view_html":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q","download_json":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q.json","view_paper":"https://pith.science/paper/GQIGMTRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00935&json=true","fetch_graph":"https://pith.science/api/pith-number/GQIGMTRXFRMZWBQNAVTOMY3P5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/GQIGMTRXFRMZWBQNAVTOMY3P5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/action/storage_attestation","attest_author":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/action/author_attestation","sign_citation":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/action/citation_signature","submit_replication":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/action/replication_record"}},"created_at":"2026-05-18T01:55:59.425787+00:00","updated_at":"2026-05-18T01:55:59.425787+00:00"}