{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OONMLMFLTXYZ7A3R5HZL2D3IJA","short_pith_number":"pith:OONMLMFL","canonical_record":{"source":{"id":"1808.04523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T05:01:55Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7cf962de197a8e2004b2ee7230181258cc4e3a5ecfc43c70c0e2f6409ffe3525","abstract_canon_sha256":"3d3c99b992211a995f067a3e27b7237e0cb279d110dbb2807ff809680a02fc46"},"schema_version":"1.0"},"canonical_sha256":"739ac5b0ab9df19f8371e9f2bd0f68480969489e402f06ae3669336d0bfb27a9","source":{"kind":"arxiv","id":"1808.04523","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04523","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04523v3","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04523","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"OONMLMFLTXYZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OONMLMFLTXYZ7A3R","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OONMLMFL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OONMLMFLTXYZ7A3R5HZL2D3IJA","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T05:01:55Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7cf962de197a8e2004b2ee7230181258cc4e3a5ecfc43c70c0e2f6409ffe3525","abstract_canon_sha256":"3d3c99b992211a995f067a3e27b7237e0cb279d110dbb2807ff809680a02fc46"},"schema_version":"1.0"},"canonical_sha256":"739ac5b0ab9df19f8371e9f2bd0f68480969489e402f06ae3669336d0bfb27a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.019533Z","signature_b64":"tY88hSaQBsrWeYlqZOcp/9rbyXEEr157THnQPrM4ASdykDCVf0aFTedpCiIMV6JSUQYw6jTAJLdbGrqlufrrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739ac5b0ab9df19f8371e9f2bd0f68480969489e402f06ae3669336d0bfb27a9","last_reissued_at":"2026-05-18T00:07:17.018974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.018974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04523","source_version":3,"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:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GjMFCl94LuZL/4I67qYMf8a+CMg2e0hZwAWCtv9wdb7sHRNbTmFbnUtiAAWTwTTHrM5Jk+Z9SqgCG4tBuabZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:38:53.612029Z"},"content_sha256":"e55a5899d8bda0dbc9f013b0d38a57df2bccc44b87268d817ad1ff244ed0ad36","schema_version":"1.0","event_id":"sha256:e55a5899d8bda0dbc9f013b0d38a57df2bccc44b87268d817ad1ff244ed0ad36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OONMLMFLTXYZ7A3R5HZL2D3IJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Sampling for Convex Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Jordan W. Suchow, Kevin Jamieson, Max Simchowitz, Thomas L. Griffiths","submitted_at":"2018-08-14T05:01:55Z","abstract_excerpt":"In this paper, we introduce the first principled adaptive-sampling procedure for learning a convex function in the $L_\\infty$ norm, a problem that arises often in the behavioral and social sciences. We present a function-specific measure of complexity and use it to prove that, for each convex function $f_{\\star}$, our algorithm nearly attains the information-theoretically optimal, function-specific error rate. We also corroborate our theoretical contributions with numerical experiments, finding that our method substantially outperforms passive, uniform sampling for favorable synthetic and data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04523","kind":"arxiv","version":3},"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:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcsY+lm0KqaSV2bnO268Ym47GST2sizyaBJgIcz25V6ANDhuufH2irdSaSlhx3MXfHizPiMoAJvpaxUkfezrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:38:53.612400Z"},"content_sha256":"49e0e219919d2aed28767cbc979ed66f1e34c40d74e6f69fc43a49cd779a008e","schema_version":"1.0","event_id":"sha256:49e0e219919d2aed28767cbc979ed66f1e34c40d74e6f69fc43a49cd779a008e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA/bundle.json","state_url":"https://pith.science/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA/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-01T11:38:53Z","links":{"resolver":"https://pith.science/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA","bundle":"https://pith.science/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA/bundle.json","state":"https://pith.science/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OONMLMFLTXYZ7A3R5HZL2D3IJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OONMLMFLTXYZ7A3R5HZL2D3IJA","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":"3d3c99b992211a995f067a3e27b7237e0cb279d110dbb2807ff809680a02fc46","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T05:01:55Z","title_canon_sha256":"7cf962de197a8e2004b2ee7230181258cc4e3a5ecfc43c70c0e2f6409ffe3525"},"schema_version":"1.0","source":{"id":"1808.04523","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04523","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04523v3","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04523","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"OONMLMFLTXYZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OONMLMFLTXYZ7A3R","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OONMLMFL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:49e0e219919d2aed28767cbc979ed66f1e34c40d74e6f69fc43a49cd779a008e","target":"graph","created_at":"2026-05-18T00:07:17Z","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":"In this paper, we introduce the first principled adaptive-sampling procedure for learning a convex function in the $L_\\infty$ norm, a problem that arises often in the behavioral and social sciences. We present a function-specific measure of complexity and use it to prove that, for each convex function $f_{\\star}$, our algorithm nearly attains the information-theoretically optimal, function-specific error rate. We also corroborate our theoretical contributions with numerical experiments, finding that our method substantially outperforms passive, uniform sampling for favorable synthetic and data","authors_text":"Jordan W. Suchow, Kevin Jamieson, Max Simchowitz, Thomas L. Griffiths","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T05:01:55Z","title":"Adaptive Sampling for Convex Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04523","kind":"arxiv","version":3},"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:e55a5899d8bda0dbc9f013b0d38a57df2bccc44b87268d817ad1ff244ed0ad36","target":"record","created_at":"2026-05-18T00:07:17Z","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":"3d3c99b992211a995f067a3e27b7237e0cb279d110dbb2807ff809680a02fc46","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T05:01:55Z","title_canon_sha256":"7cf962de197a8e2004b2ee7230181258cc4e3a5ecfc43c70c0e2f6409ffe3525"},"schema_version":"1.0","source":{"id":"1808.04523","kind":"arxiv","version":3}},"canonical_sha256":"739ac5b0ab9df19f8371e9f2bd0f68480969489e402f06ae3669336d0bfb27a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"739ac5b0ab9df19f8371e9f2bd0f68480969489e402f06ae3669336d0bfb27a9","first_computed_at":"2026-05-18T00:07:17.018974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:17.018974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tY88hSaQBsrWeYlqZOcp/9rbyXEEr157THnQPrM4ASdykDCVf0aFTedpCiIMV6JSUQYw6jTAJLdbGrqlufrrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:17.019533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04523","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e55a5899d8bda0dbc9f013b0d38a57df2bccc44b87268d817ad1ff244ed0ad36","sha256:49e0e219919d2aed28767cbc979ed66f1e34c40d74e6f69fc43a49cd779a008e"],"state_sha256":"bb15bd1a16e952336b6451f8028b4603c82751e43830d23d9872bcd687a8cd34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFk5sH9FXBW3yih2BZGGU1gDr/OL9gTLQI5G16uUHPUdwA9MVISanGdut9uTGs+Q47M18LTobuC7Ba94tTwdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:38:53.614392Z","bundle_sha256":"dedd68b4d1e0c57308972a73f975e85f36d2d8b4e48d8101de30fb8d41d0000c"}}