{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UEBZ5X2XCUCWTGNA5ACXFIBNZL","short_pith_number":"pith:UEBZ5X2X","canonical_record":{"source":{"id":"1804.06028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-17T03:26:28Z","cross_cats_sorted":[],"title_canon_sha256":"acfdf40776557a5c2079fecdcca3169aad05bcbbc0c8056479d08b70153c149d","abstract_canon_sha256":"c02142b10a2ab7b7cc934dd2eb5ef63093a64195cd0005f8460e8bf20d157dad"},"schema_version":"1.0"},"canonical_sha256":"a1039edf5715056999a0e80572a02dcae1cdfc14c1b3c8661fe84d324431e532","source":{"kind":"arxiv","id":"1804.06028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06028","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06028v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06028","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"UEBZ5X2XCUCW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UEBZ5X2XCUCWTGNA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UEBZ5X2X","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UEBZ5X2XCUCWTGNA5ACXFIBNZL","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-17T03:26:28Z","cross_cats_sorted":[],"title_canon_sha256":"acfdf40776557a5c2079fecdcca3169aad05bcbbc0c8056479d08b70153c149d","abstract_canon_sha256":"c02142b10a2ab7b7cc934dd2eb5ef63093a64195cd0005f8460e8bf20d157dad"},"schema_version":"1.0"},"canonical_sha256":"a1039edf5715056999a0e80572a02dcae1cdfc14c1b3c8661fe84d324431e532","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.949442Z","signature_b64":"i1rRXCmFL4dJPmaVWVy4ANGxti3QYI/w7OIanPgy3Ck/6WbR661RHtTeM42jsR0lvZFUN7z7eUhhPxrPkgzPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1039edf5715056999a0e80572a02dcae1cdfc14c1b3c8661fe84d324431e532","last_reissued_at":"2026-05-18T00:18:21.948824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.948824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06028","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-18T00:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0pjosccZppZ6jqYG3q86op5NxBKmyOKtCcr2i42b8H3U47AsrPby/eImgvXqSrsPBmm4kfgQZSy7DiBmWo+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:03.556263Z"},"content_sha256":"e8a99e3b06686cae203c4189ef1cf1eaee73defe88fbd90c2fc3b9c720ed605a","schema_version":"1.0","event_id":"sha256:e8a99e3b06686cae203c4189ef1cf1eaee73defe88fbd90c2fc3b9c720ed605a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UEBZ5X2XCUCWTGNA5ACXFIBNZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ListOps: A Diagnostic Dataset for Latent Tree Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Nikita Nangia, Samuel R. Bowman","submitted_at":"2018-04-17T03:26:28Z","abstract_excerpt":"Latent tree learning models learn to parse a sentence without syntactic supervision, and use that parse to build the sentence representation. Existing work on such models has shown that, while they perform well on tasks like sentence classification, they do not learn grammars that conform to any plausible semantic or syntactic formalism (Williams et al., 2018a). Studying the parsing ability of such models in natural language can be challenging due to the inherent complexities of natural language, like having several valid parses for a single sentence. In this paper we introduce ListOps, a toy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06028","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-18T00:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDUU2GJlzZgSF6JR69l+FVtpoJvcuixKJWyesRkwhBE87JODHUspntHmWBCTZkFZLquVS+6a95KmaJWAnStcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:03.556629Z"},"content_sha256":"67c25ba58f95166ce7d0e6082eae939080b100be3bbe5554358728e4e5890388","schema_version":"1.0","event_id":"sha256:67c25ba58f95166ce7d0e6082eae939080b100be3bbe5554358728e4e5890388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL/bundle.json","state_url":"https://pith.science/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL/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-03T06:35:03Z","links":{"resolver":"https://pith.science/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL","bundle":"https://pith.science/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL/bundle.json","state":"https://pith.science/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEBZ5X2XCUCWTGNA5ACXFIBNZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UEBZ5X2XCUCWTGNA5ACXFIBNZL","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":"c02142b10a2ab7b7cc934dd2eb5ef63093a64195cd0005f8460e8bf20d157dad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-17T03:26:28Z","title_canon_sha256":"acfdf40776557a5c2079fecdcca3169aad05bcbbc0c8056479d08b70153c149d"},"schema_version":"1.0","source":{"id":"1804.06028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06028","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06028v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06028","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"UEBZ5X2XCUCW","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UEBZ5X2XCUCWTGNA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UEBZ5X2X","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:67c25ba58f95166ce7d0e6082eae939080b100be3bbe5554358728e4e5890388","target":"graph","created_at":"2026-05-18T00:18:21Z","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":"Latent tree learning models learn to parse a sentence without syntactic supervision, and use that parse to build the sentence representation. Existing work on such models has shown that, while they perform well on tasks like sentence classification, they do not learn grammars that conform to any plausible semantic or syntactic formalism (Williams et al., 2018a). Studying the parsing ability of such models in natural language can be challenging due to the inherent complexities of natural language, like having several valid parses for a single sentence. In this paper we introduce ListOps, a toy ","authors_text":"Nikita Nangia, Samuel R. Bowman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-17T03:26:28Z","title":"ListOps: A Diagnostic Dataset for Latent Tree Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06028","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:e8a99e3b06686cae203c4189ef1cf1eaee73defe88fbd90c2fc3b9c720ed605a","target":"record","created_at":"2026-05-18T00:18:21Z","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":"c02142b10a2ab7b7cc934dd2eb5ef63093a64195cd0005f8460e8bf20d157dad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-17T03:26:28Z","title_canon_sha256":"acfdf40776557a5c2079fecdcca3169aad05bcbbc0c8056479d08b70153c149d"},"schema_version":"1.0","source":{"id":"1804.06028","kind":"arxiv","version":1}},"canonical_sha256":"a1039edf5715056999a0e80572a02dcae1cdfc14c1b3c8661fe84d324431e532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1039edf5715056999a0e80572a02dcae1cdfc14c1b3c8661fe84d324431e532","first_computed_at":"2026-05-18T00:18:21.948824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:21.948824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i1rRXCmFL4dJPmaVWVy4ANGxti3QYI/w7OIanPgy3Ck/6WbR661RHtTeM42jsR0lvZFUN7z7eUhhPxrPkgzPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:21.949442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8a99e3b06686cae203c4189ef1cf1eaee73defe88fbd90c2fc3b9c720ed605a","sha256:67c25ba58f95166ce7d0e6082eae939080b100be3bbe5554358728e4e5890388"],"state_sha256":"cecf378e652e310aa3d55b869458da82eb5bf5f6386d7075af71ed63302fb891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYK8CPJ1hyfbPRGHoLdqU7OAJXBJt4d7HsD8Y7a6VOeAiGD6BCZFpEySrd0pU0o+Y9UHeSrz2mPANo84ikgeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:35:03.558548Z","bundle_sha256":"c41c9e864b3677f86b9ee78919584d8d5df72972de2d6d2f8dd6390990b83ac4"}}