{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GQIGMTRXFRMZWBQNAVTOMY3P5Q","short_pith_number":"pith:GQIGMTRX","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"},"canonical_sha256":"3410664e372c599b060d0566e6636fec2a5f9e256da7aadad48ff1106542226d","source":{"kind":"arxiv","id":"1506.00935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00935","created_at":"2026-05-18T01:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00935v1","created_at":"2026-05-18T01:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00935","created_at":"2026-05-18T01:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"GQIGMTRXFRMZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GQIGMTRXFRMZWBQN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GQIGMTRX","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GQIGMTRXFRMZWBQNAVTOMY3P5Q","target":"record","payload":{"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"},"canonical_sha256":"3410664e372c599b060d0566e6636fec2a5f9e256da7aadad48ff1106542226d","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"},"source_kind":"arxiv","source_id":"1506.00935","source_version":1,"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-18T01:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvLiDFrDNagLi84B+jk5Ylfg8QqjEkltHcIUjc/ZplOxvR7BpzaNVGuFiU80sn7jHGuW1pFzLnZ42LYa//TPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:44:31.231162Z"},"content_sha256":"cb522acb21fdb034e8de203478d97ee4f61368f164a165da2c50f933a2d8d909","schema_version":"1.0","event_id":"sha256:cb522acb21fdb034e8de203478d97ee4f61368f164a165da2c50f933a2d8d909"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GQIGMTRXFRMZWBQNAVTOMY3P5Q","target":"graph","payload":{"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"},"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-18T01:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4es8jz6twryLmzhZY5NTLQaOQe8uc8XkTR0A6t6lpx1HBW4jYJ743Vlpp0SF4uWEYNCWGOFhCW9x9jBqeORAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:44:31.231522Z"},"content_sha256":"4ee54f1872eebe954599228aa91c945597f1e930fe4b4a5a45705280b3dfcf09","schema_version":"1.0","event_id":"sha256:4ee54f1872eebe954599228aa91c945597f1e930fe4b4a5a45705280b3dfcf09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/bundle.json","state_url":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/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-03T12:44:31Z","links":{"resolver":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q","bundle":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/bundle.json","state":"https://pith.science/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GQIGMTRXFRMZWBQNAVTOMY3P5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GQIGMTRXFRMZWBQNAVTOMY3P5Q","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":"5d3ff19e27a7766720250bcff3afaa956516779242d3bf0b19e0acaf6cf119c9","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T16:01:46Z","title_canon_sha256":"73a016a627c05cd86bc1f2177430b9090247a8ceb9e419db3eae74d7fe2e1b85"},"schema_version":"1.0","source":{"id":"1506.00935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00935","created_at":"2026-05-18T01:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00935v1","created_at":"2026-05-18T01:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00935","created_at":"2026-05-18T01:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"GQIGMTRXFRMZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GQIGMTRXFRMZWBQN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GQIGMTRX","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:4ee54f1872eebe954599228aa91c945597f1e930fe4b4a5a45705280b3dfcf09","target":"graph","created_at":"2026-05-18T01:55:59Z","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":"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","authors_text":"Andreas Krause, Andreas Marfurt, Charles-Antoine Robelin, Donald Kossmann, Hastagiri P. Vanchinathan","cross_cats":["cs.AI","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T16:01:46Z","title":"Discovering Valuable Items from Massive Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00935","kind":"arxiv","version":1},"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:cb522acb21fdb034e8de203478d97ee4f61368f164a165da2c50f933a2d8d909","target":"record","created_at":"2026-05-18T01:55:59Z","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":"5d3ff19e27a7766720250bcff3afaa956516779242d3bf0b19e0acaf6cf119c9","cross_cats_sorted":["cs.AI","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-02T16:01:46Z","title_canon_sha256":"73a016a627c05cd86bc1f2177430b9090247a8ceb9e419db3eae74d7fe2e1b85"},"schema_version":"1.0","source":{"id":"1506.00935","kind":"arxiv","version":1}},"canonical_sha256":"3410664e372c599b060d0566e6636fec2a5f9e256da7aadad48ff1106542226d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3410664e372c599b060d0566e6636fec2a5f9e256da7aadad48ff1106542226d","first_computed_at":"2026-05-18T01:55:59.425715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:59.425715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"me6vksFHpUQZMgSL+foHFf7+g+u0Ptjp4US90S9fApM8QRAu1Zx6t76nBaLaCSuCt30QyfKbjFYZrnpofvNkCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:59.426188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb522acb21fdb034e8de203478d97ee4f61368f164a165da2c50f933a2d8d909","sha256:4ee54f1872eebe954599228aa91c945597f1e930fe4b4a5a45705280b3dfcf09"],"state_sha256":"282def1a931dcd65711eb4927d44c593dd6dd02f2e7bfe576bcc522293e9cc13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61qXgPrrmFaJWVJVF1a9OTSe8BOQw55RQpd/TF1xT/Pbn8SlhFbFNYJMlxKuAe3cgDujoxvWnTwJZotem97PDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:44:31.234103Z","bundle_sha256":"4fac6ded3ea34ccb653cb16ad32bde8cba82036ac865b2cfcc8d4735e71ebece"}}