{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SMLLJBPXUWA2UUXSSEXEHCVQ7C","short_pith_number":"pith:SMLLJBPX","canonical_record":{"source":{"id":"1503.00693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-03-02T20:23:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8b47c26e132559472340e73c55bcb5d560f034e99466b5e4a00dbae93eeac3b6","abstract_canon_sha256":"e840c39f6c4cc64ac52357df16f864bd45a8d8313c9cc798e60d1d22690e6cd3"},"schema_version":"1.0"},"canonical_sha256":"9316b485f7a581aa52f2912e438ab0f895f17ba40b47951fc1ddfa8aa6844614","source":{"kind":"arxiv","id":"1503.00693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00693","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00693v1","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00693","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"SMLLJBPXUWA2","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SMLLJBPXUWA2UUXS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SMLLJBPX","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SMLLJBPXUWA2UUXSSEXEHCVQ7C","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-03-02T20:23:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"8b47c26e132559472340e73c55bcb5d560f034e99466b5e4a00dbae93eeac3b6","abstract_canon_sha256":"e840c39f6c4cc64ac52357df16f864bd45a8d8313c9cc798e60d1d22690e6cd3"},"schema_version":"1.0"},"canonical_sha256":"9316b485f7a581aa52f2912e438ab0f895f17ba40b47951fc1ddfa8aa6844614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:49.496481Z","signature_b64":"/NEoOP0KsWdlZsAnTJwCdrdUqASvIZoe8rmrIHjL/NK0n/U0W20fu9bhKEc4jAZCleRyeZB5NJeom6y1CID2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9316b485f7a581aa52f2912e438ab0f895f17ba40b47951fc1ddfa8aa6844614","last_reissued_at":"2026-05-18T02:25:49.496089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:49.496089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00693","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-18T02:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UsGf/CSJC/VcPpMUJMJtu66gC4d42L1muRkBP/5WexrWfWA/7jxfg//qqMm+SDdnXxVQd2INWNxtwuXOylfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:46:11.700834Z"},"content_sha256":"351a410cc0520efc590632185347d0d2b7311de4f5086a674aa9fe20673031f6","schema_version":"1.0","event_id":"sha256:351a410cc0520efc590632185347d0d2b7311de4f5086a674aa9fe20673031f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SMLLJBPXUWA2UUXSSEXEHCVQ7C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Optimization of Text Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Dani Yogatama, Noah A. Smith","submitted_at":"2015-03-02T20:23:18Z","abstract_excerpt":"When applying machine learning to problems in NLP, there are many choices to make about how to represent input texts. These choices can have a big effect on performance, but they are often uninteresting to researchers or practitioners who simply need a module that performs well. We propose an approach to optimizing over this space of choices, formulating the problem as global optimization. We apply a sequential model-based optimization technique and show that our method makes standard linear models competitive with more sophisticated, expensive state-of-the-art methods based on latent variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00693","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-18T02:25:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LeDu8r6tkmB2T4h3XxkymA3lTdXvwIBChudjvc1I0yJpiIs5FCNiMGCIE27DmQmk7xAzskqaRgYogaNvNABWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:46:11.701578Z"},"content_sha256":"e0dd3b5aaa933f9da8d816bf11cfff38266a2fc7f5dbf0b47273c4ce0787b2a1","schema_version":"1.0","event_id":"sha256:e0dd3b5aaa933f9da8d816bf11cfff38266a2fc7f5dbf0b47273c4ce0787b2a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C/bundle.json","state_url":"https://pith.science/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C/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-05-25T02:46:11Z","links":{"resolver":"https://pith.science/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C","bundle":"https://pith.science/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C/bundle.json","state":"https://pith.science/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMLLJBPXUWA2UUXSSEXEHCVQ7C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SMLLJBPXUWA2UUXSSEXEHCVQ7C","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":"e840c39f6c4cc64ac52357df16f864bd45a8d8313c9cc798e60d1d22690e6cd3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-03-02T20:23:18Z","title_canon_sha256":"8b47c26e132559472340e73c55bcb5d560f034e99466b5e4a00dbae93eeac3b6"},"schema_version":"1.0","source":{"id":"1503.00693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00693","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00693v1","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00693","created_at":"2026-05-18T02:25:49Z"},{"alias_kind":"pith_short_12","alias_value":"SMLLJBPXUWA2","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SMLLJBPXUWA2UUXS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SMLLJBPX","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:e0dd3b5aaa933f9da8d816bf11cfff38266a2fc7f5dbf0b47273c4ce0787b2a1","target":"graph","created_at":"2026-05-18T02:25:49Z","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":"When applying machine learning to problems in NLP, there are many choices to make about how to represent input texts. These choices can have a big effect on performance, but they are often uninteresting to researchers or practitioners who simply need a module that performs well. We propose an approach to optimizing over this space of choices, formulating the problem as global optimization. We apply a sequential model-based optimization technique and show that our method makes standard linear models competitive with more sophisticated, expensive state-of-the-art methods based on latent variable","authors_text":"Dani Yogatama, Noah A. Smith","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-03-02T20:23:18Z","title":"Bayesian Optimization of Text Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00693","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:351a410cc0520efc590632185347d0d2b7311de4f5086a674aa9fe20673031f6","target":"record","created_at":"2026-05-18T02:25:49Z","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":"e840c39f6c4cc64ac52357df16f864bd45a8d8313c9cc798e60d1d22690e6cd3","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-03-02T20:23:18Z","title_canon_sha256":"8b47c26e132559472340e73c55bcb5d560f034e99466b5e4a00dbae93eeac3b6"},"schema_version":"1.0","source":{"id":"1503.00693","kind":"arxiv","version":1}},"canonical_sha256":"9316b485f7a581aa52f2912e438ab0f895f17ba40b47951fc1ddfa8aa6844614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9316b485f7a581aa52f2912e438ab0f895f17ba40b47951fc1ddfa8aa6844614","first_computed_at":"2026-05-18T02:25:49.496089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:49.496089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NEoOP0KsWdlZsAnTJwCdrdUqASvIZoe8rmrIHjL/NK0n/U0W20fu9bhKEc4jAZCleRyeZB5NJeom6y1CID2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:49.496481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:351a410cc0520efc590632185347d0d2b7311de4f5086a674aa9fe20673031f6","sha256:e0dd3b5aaa933f9da8d816bf11cfff38266a2fc7f5dbf0b47273c4ce0787b2a1"],"state_sha256":"ad81a5b3ac964a3db885ba6617f3056558041af0632c53698de9a0f8a13e5227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZqQA9YyHlqOkXXcQM5bGUWX6oq1cdgMg7Xy4mG6iUiTHSTNKBHGJd3nSCcbBBOBtTEPtB/NSgXSSDDXxG4WAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:46:11.705869Z","bundle_sha256":"eaccbb6a410b0455fb15e1b2b7e65b72a5752d628b9a9a4ff05c4861659a387a"}}