{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DSASSAS7KHGO63PCW35KAV2W4P","short_pith_number":"pith:DSASSAS7","canonical_record":{"source":{"id":"1611.01462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-04T17:36:20Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"c286e4e169e2b9a21362480f7840924321d620a0a4fb6867611a029e3cd02b13","abstract_canon_sha256":"d69a413a7950db460488c5e2faadf1fccb8e645c356d63032d85d605e06b7129"},"schema_version":"1.0"},"canonical_sha256":"1c8129025f51ccef6de2b6faa05756e3dce386371c2e3006a9512739f77f9546","source":{"kind":"arxiv","id":"1611.01462","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01462","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01462v3","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01462","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"DSASSAS7KHGO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSASSAS7KHGO63PC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSASSAS7","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DSASSAS7KHGO63PCW35KAV2W4P","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01462","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-04T17:36:20Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"c286e4e169e2b9a21362480f7840924321d620a0a4fb6867611a029e3cd02b13","abstract_canon_sha256":"d69a413a7950db460488c5e2faadf1fccb8e645c356d63032d85d605e06b7129"},"schema_version":"1.0"},"canonical_sha256":"1c8129025f51ccef6de2b6faa05756e3dce386371c2e3006a9512739f77f9546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:53.738725Z","signature_b64":"KI6NzGHeqW2+joEbdQ3foTZIpRGHRpWWT8l47/oBWOYELIS0ffhwkThAHGy9EEHmwfXTBGRmNWgHoLahgclPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c8129025f51ccef6de2b6faa05756e3dce386371c2e3006a9512739f77f9546","last_reissued_at":"2026-05-18T00:48:53.737788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:53.737788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01462","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:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eh4tq+EReCUuWvG+O7l6QR4Hwl9MSCG9eoiOLgYZj0/QcGwCjl91RgBXeNTetGphCf4TSBWZ9mUjCK0zwQYPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:21:58.703629Z"},"content_sha256":"812384d71f2c3357c503d38d878c4a3959590a019d7fab4e5ed27c079b13d7a8","schema_version":"1.0","event_id":"sha256:812384d71f2c3357c503d38d878c4a3959590a019d7fab4e5ed27c079b13d7a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DSASSAS7KHGO63PCW35KAV2W4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tying Word Vectors and Word Classifiers: A Loss Framework for Language Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hakan Inan, Khashayar Khosravi, Richard Socher","submitted_at":"2016-11-04T17:36:20Z","abstract_excerpt":"Recurrent neural networks have been very successful at predicting sequences of words in tasks such as language modeling. However, all such models are based on the conventional classification framework, where the model is trained against one-hot targets, and each word is represented both as an input and as an output in isolation. This causes inefficiencies in learning both in terms of utilizing all of the information and in terms of the number of parameters needed to train. We introduce a novel theoretical framework that facilitates better learning in language modeling, and show that our framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01462","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:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXEY0pI+xnavJnIJtDzDBBTbtlgl3l5+m15GCLd1+1I+ojTF3QhfS8oVpS0PsOpzBYiNxkx4VSkQjovwN9uGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:21:58.704345Z"},"content_sha256":"326130fb36e02e7b0d76f75dda75000c5c22bd1ff563ac1373d89bcdc7a18548","schema_version":"1.0","event_id":"sha256:326130fb36e02e7b0d76f75dda75000c5c22bd1ff563ac1373d89bcdc7a18548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSASSAS7KHGO63PCW35KAV2W4P/bundle.json","state_url":"https://pith.science/pith/DSASSAS7KHGO63PCW35KAV2W4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSASSAS7KHGO63PCW35KAV2W4P/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-27T18:21:58Z","links":{"resolver":"https://pith.science/pith/DSASSAS7KHGO63PCW35KAV2W4P","bundle":"https://pith.science/pith/DSASSAS7KHGO63PCW35KAV2W4P/bundle.json","state":"https://pith.science/pith/DSASSAS7KHGO63PCW35KAV2W4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSASSAS7KHGO63PCW35KAV2W4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DSASSAS7KHGO63PCW35KAV2W4P","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":"d69a413a7950db460488c5e2faadf1fccb8e645c356d63032d85d605e06b7129","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-04T17:36:20Z","title_canon_sha256":"c286e4e169e2b9a21362480f7840924321d620a0a4fb6867611a029e3cd02b13"},"schema_version":"1.0","source":{"id":"1611.01462","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01462","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01462v3","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01462","created_at":"2026-05-18T00:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"DSASSAS7KHGO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DSASSAS7KHGO63PC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DSASSAS7","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:326130fb36e02e7b0d76f75dda75000c5c22bd1ff563ac1373d89bcdc7a18548","target":"graph","created_at":"2026-05-18T00:48:53Z","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":"Recurrent neural networks have been very successful at predicting sequences of words in tasks such as language modeling. However, all such models are based on the conventional classification framework, where the model is trained against one-hot targets, and each word is represented both as an input and as an output in isolation. This causes inefficiencies in learning both in terms of utilizing all of the information and in terms of the number of parameters needed to train. We introduce a novel theoretical framework that facilitates better learning in language modeling, and show that our framew","authors_text":"Hakan Inan, Khashayar Khosravi, Richard Socher","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-04T17:36:20Z","title":"Tying Word Vectors and Word Classifiers: A Loss Framework for Language Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01462","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:812384d71f2c3357c503d38d878c4a3959590a019d7fab4e5ed27c079b13d7a8","target":"record","created_at":"2026-05-18T00:48:53Z","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":"d69a413a7950db460488c5e2faadf1fccb8e645c356d63032d85d605e06b7129","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-04T17:36:20Z","title_canon_sha256":"c286e4e169e2b9a21362480f7840924321d620a0a4fb6867611a029e3cd02b13"},"schema_version":"1.0","source":{"id":"1611.01462","kind":"arxiv","version":3}},"canonical_sha256":"1c8129025f51ccef6de2b6faa05756e3dce386371c2e3006a9512739f77f9546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c8129025f51ccef6de2b6faa05756e3dce386371c2e3006a9512739f77f9546","first_computed_at":"2026-05-18T00:48:53.737788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:53.737788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KI6NzGHeqW2+joEbdQ3foTZIpRGHRpWWT8l47/oBWOYELIS0ffhwkThAHGy9EEHmwfXTBGRmNWgHoLahgclPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:53.738725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01462","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:812384d71f2c3357c503d38d878c4a3959590a019d7fab4e5ed27c079b13d7a8","sha256:326130fb36e02e7b0d76f75dda75000c5c22bd1ff563ac1373d89bcdc7a18548"],"state_sha256":"a50e2e37f9d86d0698fa4fe19a57d69b91c39558f79f6a035172836ddbbf659f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcIZpxT2pOB55asVZVVoLF7nc24MkaZk/TAIC9Inqt7kefP/FPcEYINVOACUYC45SWpMBdIIxrfD+nnfvkWZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:21:58.708161Z","bundle_sha256":"33290d72cbc02626baadc92a303de36bbccad837fc76c2ebd18d0128d41b6e27"}}