{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:53ZY4PLLFMKGEWBZHOTDQLFH6J","short_pith_number":"pith:53ZY4PLL","canonical_record":{"source":{"id":"1604.00100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-01T01:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"dca427473642582e5aaad4e2857d4e603fdc79a4ba4b3bfe5eb6587b62fe0275","abstract_canon_sha256":"81fdf0619f88966f62172352cf2498bca6799d08b9d84315a9bc05c9be55e250"},"schema_version":"1.0"},"canonical_sha256":"eef38e3d6b2b146258393ba6382ca7f240468a6cd2ebc8cd67ebf408cf0ee002","source":{"kind":"arxiv","id":"1604.00100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00100","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00100v1","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00100","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"53ZY4PLLFMKG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"53ZY4PLLFMKGEWBZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"53ZY4PLL","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:53ZY4PLLFMKGEWBZHOTDQLFH6J","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-01T01:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"dca427473642582e5aaad4e2857d4e603fdc79a4ba4b3bfe5eb6587b62fe0275","abstract_canon_sha256":"81fdf0619f88966f62172352cf2498bca6799d08b9d84315a9bc05c9be55e250"},"schema_version":"1.0"},"canonical_sha256":"eef38e3d6b2b146258393ba6382ca7f240468a6cd2ebc8cd67ebf408cf0ee002","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:54.559279Z","signature_b64":"NOY7mejbtSJtZ6oTgnjsE40mMzztF9oj7drcro9oNUJAcnpr6pHnqpXwoCI/vGRFFkQxSf6fn9uVnFq2DmkqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef38e3d6b2b146258393ba6382ca7f240468a6cd2ebc8cd67ebf408cf0ee002","last_reissued_at":"2026-05-18T01:17:54.558616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:54.558616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00100","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:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZkoJsiQKbD/BrBCdswwZVv2+3vkBM0qInBrryWm7jAlGbxex0YkYns05+3iY16h5rfhtpwIyJU0h21xaB12Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:18:21.947365Z"},"content_sha256":"df73dd4c70887620474b10dc6f2cdf9ee7a837fe6e98e22028dde4a54bb53e8f","schema_version":"1.0","event_id":"sha256:df73dd4c70887620474b10dc6f2cdf9ee7a837fe6e98e22028dde4a54bb53e8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:53ZY4PLLFMKGEWBZHOTDQLFH6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Compositional Approach to Language Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Anand Rangarajan, Kushal Arora","submitted_at":"2016-04-01T01:51:34Z","abstract_excerpt":"Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by showing how the linear chain assumption inherent in previous work can be translated into a sequential composition tree. We then propose a new model that marginalizes over all possible composition trees thereby removing any underlying structural assumptions. As the partition function of this new model is intractable, we use a recently proposed sentence level eval"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00100","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:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5cKoIHPPBlDZrZL3y3NWJChrB/HafLOobU+78oq2CenR1gsLxxTKhwF+twBBgSesdDLNAtj7u3TPOnqDs6ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:18:21.947715Z"},"content_sha256":"e1b93b43b9023ea420c255f4b8801e2038ccac2a801f9c98f5d55fb0dcf6f69e","schema_version":"1.0","event_id":"sha256:e1b93b43b9023ea420c255f4b8801e2038ccac2a801f9c98f5d55fb0dcf6f69e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J/bundle.json","state_url":"https://pith.science/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J/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-04T18:18:21Z","links":{"resolver":"https://pith.science/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J","bundle":"https://pith.science/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J/bundle.json","state":"https://pith.science/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/53ZY4PLLFMKGEWBZHOTDQLFH6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:53ZY4PLLFMKGEWBZHOTDQLFH6J","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":"81fdf0619f88966f62172352cf2498bca6799d08b9d84315a9bc05c9be55e250","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-01T01:51:34Z","title_canon_sha256":"dca427473642582e5aaad4e2857d4e603fdc79a4ba4b3bfe5eb6587b62fe0275"},"schema_version":"1.0","source":{"id":"1604.00100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00100","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00100v1","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00100","created_at":"2026-05-18T01:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"53ZY4PLLFMKG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"53ZY4PLLFMKGEWBZ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"53ZY4PLL","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:e1b93b43b9023ea420c255f4b8801e2038ccac2a801f9c98f5d55fb0dcf6f69e","target":"graph","created_at":"2026-05-18T01:17:54Z","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":"Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by showing how the linear chain assumption inherent in previous work can be translated into a sequential composition tree. We then propose a new model that marginalizes over all possible composition trees thereby removing any underlying structural assumptions. As the partition function of this new model is intractable, we use a recently proposed sentence level eval","authors_text":"Anand Rangarajan, Kushal Arora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-01T01:51:34Z","title":"A Compositional Approach to Language Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00100","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:df73dd4c70887620474b10dc6f2cdf9ee7a837fe6e98e22028dde4a54bb53e8f","target":"record","created_at":"2026-05-18T01:17:54Z","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":"81fdf0619f88966f62172352cf2498bca6799d08b9d84315a9bc05c9be55e250","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-01T01:51:34Z","title_canon_sha256":"dca427473642582e5aaad4e2857d4e603fdc79a4ba4b3bfe5eb6587b62fe0275"},"schema_version":"1.0","source":{"id":"1604.00100","kind":"arxiv","version":1}},"canonical_sha256":"eef38e3d6b2b146258393ba6382ca7f240468a6cd2ebc8cd67ebf408cf0ee002","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eef38e3d6b2b146258393ba6382ca7f240468a6cd2ebc8cd67ebf408cf0ee002","first_computed_at":"2026-05-18T01:17:54.558616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:54.558616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NOY7mejbtSJtZ6oTgnjsE40mMzztF9oj7drcro9oNUJAcnpr6pHnqpXwoCI/vGRFFkQxSf6fn9uVnFq2DmkqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:54.559279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df73dd4c70887620474b10dc6f2cdf9ee7a837fe6e98e22028dde4a54bb53e8f","sha256:e1b93b43b9023ea420c255f4b8801e2038ccac2a801f9c98f5d55fb0dcf6f69e"],"state_sha256":"b55b4ba3083190a7374df9ae981ebf6fab158826614dd14cdcaa94db8fd9a3c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/+LWcDOWMGoWKAWFSFtnMU7UhDRlcAMQHjK+PVbBQORyNkKNitOoF0OP5nBAddtbeQIoWgNbS+Qe7sbDdRAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:18:21.949593Z","bundle_sha256":"879906d096c0b9b090c82dbefbdbf97acfa01c8256403ca355d37b2faa8ba849"}}