{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JF7OOLWDIDDEAIBZXMTCMQCSF6","short_pith_number":"pith:JF7OOLWD","canonical_record":{"source":{"id":"1406.2035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-08T22:35:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1c92df92e8745718325bcd4f1236865f5977e94f1d6543a7ffc7cb9ebff98c83","abstract_canon_sha256":"c2fd65a04a7d6504630369ca1e84515f5368de825c1907dfbe1c15337df4ccc4"},"schema_version":"1.0"},"canonical_sha256":"497ee72ec340c6402039bb262640522fb6561d3af9aeb439a7abea734c9e03fd","source":{"kind":"arxiv","id":"1406.2035","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2035","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2035v2","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2035","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"JF7OOLWDIDDE","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JF7OOLWDIDDEAIBZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JF7OOLWD","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JF7OOLWDIDDEAIBZXMTCMQCSF6","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-08T22:35:09Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1c92df92e8745718325bcd4f1236865f5977e94f1d6543a7ffc7cb9ebff98c83","abstract_canon_sha256":"c2fd65a04a7d6504630369ca1e84515f5368de825c1907dfbe1c15337df4ccc4"},"schema_version":"1.0"},"canonical_sha256":"497ee72ec340c6402039bb262640522fb6561d3af9aeb439a7abea734c9e03fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:29.501281Z","signature_b64":"K6sfkYpXKgQgbGzLofgmXLbsdxYpkGp49jWisYjMOGbjBW5mVBmZD4qWhSijO5AwjbISQkwPeQm4V3Ye7Y43Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497ee72ec340c6402039bb262640522fb6561d3af9aeb439a7abea734c9e03fd","last_reissued_at":"2026-05-18T02:38:29.500554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:29.500554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2035","source_version":2,"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:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7G+ZW0myv4/x0weLPsjG5zJSQzD3ScMrQOY/ngnWooruI2h8jqlhMc7eukK8UPmB7zxyeysbft0v2h9EzCoVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:19:46.068624Z"},"content_sha256":"064df8b3f14e8f62e31eb36e9a7ca9fc1336209780e9c18f65ceac268d462b36","schema_version":"1.0","event_id":"sha256:064df8b3f14e8f62e31eb36e9a7ca9fc1336209780e9c18f65ceac268d462b36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JF7OOLWDIDDEAIBZXMTCMQCSF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Word Representations with Hierarchical Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Chris Dyer, Dani Yogatama, Manaal Faruqui, Noah A. Smith","submitted_at":"2014-06-08T22:35:09Z","abstract_excerpt":"We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perform hierarchical sparse coding on a corpus of billions of word tokens. Experiments on various benchmark tasks---word similarity ranking, analogies, sentence completion, and sentiment analysis---demonstrate that the method outperforms or is competitive with state-of-the-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2035","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"},"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:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgQ0CpgwUnPbw1MvtbcSZFO6tSHQQBnqOhoqFkQvjgLqZntbcdCRNSIb7WhL3ZSA++zecEltcN+/joFOL2CWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:19:46.069060Z"},"content_sha256":"0fcd6a2ad0feaf15d373baf53d9ddcdbe642426b9a92b2f247f1847664d51ab4","schema_version":"1.0","event_id":"sha256:0fcd6a2ad0feaf15d373baf53d9ddcdbe642426b9a92b2f247f1847664d51ab4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6/bundle.json","state_url":"https://pith.science/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6/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-24T20:19:46Z","links":{"resolver":"https://pith.science/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6","bundle":"https://pith.science/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6/bundle.json","state":"https://pith.science/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF7OOLWDIDDEAIBZXMTCMQCSF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JF7OOLWDIDDEAIBZXMTCMQCSF6","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":"c2fd65a04a7d6504630369ca1e84515f5368de825c1907dfbe1c15337df4ccc4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-08T22:35:09Z","title_canon_sha256":"1c92df92e8745718325bcd4f1236865f5977e94f1d6543a7ffc7cb9ebff98c83"},"schema_version":"1.0","source":{"id":"1406.2035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2035","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2035v2","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2035","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"JF7OOLWDIDDE","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JF7OOLWDIDDEAIBZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JF7OOLWD","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:0fcd6a2ad0feaf15d373baf53d9ddcdbe642426b9a92b2f247f1847664d51ab4","target":"graph","created_at":"2026-05-18T02:38:29Z","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":"We propose a new method for learning word representations using hierarchical regularization in sparse coding inspired by the linguistic study of word meanings. We show an efficient learning algorithm based on stochastic proximal methods that is significantly faster than previous approaches, making it possible to perform hierarchical sparse coding on a corpus of billions of word tokens. Experiments on various benchmark tasks---word similarity ranking, analogies, sentence completion, and sentiment analysis---demonstrate that the method outperforms or is competitive with state-of-the-art methods.","authors_text":"Chris Dyer, Dani Yogatama, Manaal Faruqui, 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":"2014-06-08T22:35:09Z","title":"Learning Word Representations with Hierarchical Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2035","kind":"arxiv","version":2},"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:064df8b3f14e8f62e31eb36e9a7ca9fc1336209780e9c18f65ceac268d462b36","target":"record","created_at":"2026-05-18T02:38:29Z","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":"c2fd65a04a7d6504630369ca1e84515f5368de825c1907dfbe1c15337df4ccc4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-06-08T22:35:09Z","title_canon_sha256":"1c92df92e8745718325bcd4f1236865f5977e94f1d6543a7ffc7cb9ebff98c83"},"schema_version":"1.0","source":{"id":"1406.2035","kind":"arxiv","version":2}},"canonical_sha256":"497ee72ec340c6402039bb262640522fb6561d3af9aeb439a7abea734c9e03fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"497ee72ec340c6402039bb262640522fb6561d3af9aeb439a7abea734c9e03fd","first_computed_at":"2026-05-18T02:38:29.500554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:29.500554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6sfkYpXKgQgbGzLofgmXLbsdxYpkGp49jWisYjMOGbjBW5mVBmZD4qWhSijO5AwjbISQkwPeQm4V3Ye7Y43Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:29.501281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:064df8b3f14e8f62e31eb36e9a7ca9fc1336209780e9c18f65ceac268d462b36","sha256:0fcd6a2ad0feaf15d373baf53d9ddcdbe642426b9a92b2f247f1847664d51ab4"],"state_sha256":"4f0a468630d63085feaccdb22cd356ab52c5d4d3cdad13746afc2cf91c7cf5b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/lFVao5Pi4bJQl75HPfEeC8AQD7+lzYqC4rD2cnDRom0rPFB2E3ulaRsAjMYogfFlKmBKHH6s6S16n+oo+qeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:19:46.072052Z","bundle_sha256":"21a77c5f28209f557f73e53844b5fc6b4ad22fed99fd63f439efa8b5d2be7246"}}