{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:D2NP2UGIG4WJ53KESRKGWVZONG","short_pith_number":"pith:D2NP2UGI","canonical_record":{"source":{"id":"1606.01933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-06T20:30:57Z","cross_cats_sorted":[],"title_canon_sha256":"1ea61d1b7018173e6cd4227d7360911cb0b48725c9492469b22a6cfa7a27358c","abstract_canon_sha256":"25a76442cab59dd875f2f3bf05afedcc254e1ad735db85808d7cef202dd9395a"},"schema_version":"1.0"},"canonical_sha256":"1e9afd50c8372c9eed4494546b572e6989b2135228e05ca16a3254cc374d78c0","source":{"kind":"arxiv","id":"1606.01933","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01933","created_at":"2026-05-18T01:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01933v2","created_at":"2026-05-18T01:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01933","created_at":"2026-05-18T01:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"D2NP2UGIG4WJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D2NP2UGIG4WJ53KE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D2NP2UGI","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:D2NP2UGIG4WJ53KESRKGWVZONG","target":"record","payload":{"canonical_record":{"source":{"id":"1606.01933","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-06T20:30:57Z","cross_cats_sorted":[],"title_canon_sha256":"1ea61d1b7018173e6cd4227d7360911cb0b48725c9492469b22a6cfa7a27358c","abstract_canon_sha256":"25a76442cab59dd875f2f3bf05afedcc254e1ad735db85808d7cef202dd9395a"},"schema_version":"1.0"},"canonical_sha256":"1e9afd50c8372c9eed4494546b572e6989b2135228e05ca16a3254cc374d78c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:58.841236Z","signature_b64":"YL5zKvTZfgRhGqPfZpPyl1RwGq57Z3nIHZWnSf2nugdIncuWPA9FdK1/dph6DekDPNn37UvXQqLxrXRBhz2/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e9afd50c8372c9eed4494546b572e6989b2135228e05ca16a3254cc374d78c0","last_reissued_at":"2026-05-18T01:03:58.840511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:58.840511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.01933","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-18T01:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ymV4pbfbZ7ETW2hQ+MCwLvgBq1YInQeCo8XNDjBdUQVBcQVli264oBo0TKY6nXJSylPMMDh71oGcg+Bf/MrKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:48.988051Z"},"content_sha256":"494fba10803f65ecae4fab3849e9aee1747ceb1533d1545e7b7c9a51de54891d","schema_version":"1.0","event_id":"sha256:494fba10803f65ecae4fab3849e9aee1747ceb1533d1545e7b7c9a51de54891d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:D2NP2UGIG4WJ53KESRKGWVZONG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Decomposable Attention Model for Natural Language Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ankur P. Parikh, Dipanjan Das, Jakob Uszkoreit, Oscar T\\\"ackstr\\\"om","submitted_at":"2016-06-06T20:30:57Z","abstract_excerpt":"We propose a simple neural architecture for natural language inference. Our approach uses attention to decompose the problem into subproblems that can be solved separately, thus making it trivially parallelizable. On the Stanford Natural Language Inference (SNLI) dataset, we obtain state-of-the-art results with almost an order of magnitude fewer parameters than previous work and without relying on any word-order information. Adding intra-sentence attention that takes a minimum amount of order into account yields further improvements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01933","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-18T01:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZbBOQx2hCMv8AnKKofBcT3KKQFG46Rra840hpexM7HKP3T34LQyf1dj/WP4w0LBmNykUC/ULuJDgdi5s5pTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:48.988412Z"},"content_sha256":"0a0d80d614be56b8863dbe7128ca1a08ed845b98175c3cbed9d1e074019153cd","schema_version":"1.0","event_id":"sha256:0a0d80d614be56b8863dbe7128ca1a08ed845b98175c3cbed9d1e074019153cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2NP2UGIG4WJ53KESRKGWVZONG/bundle.json","state_url":"https://pith.science/pith/D2NP2UGIG4WJ53KESRKGWVZONG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2NP2UGIG4WJ53KESRKGWVZONG/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-03T02:37:48Z","links":{"resolver":"https://pith.science/pith/D2NP2UGIG4WJ53KESRKGWVZONG","bundle":"https://pith.science/pith/D2NP2UGIG4WJ53KESRKGWVZONG/bundle.json","state":"https://pith.science/pith/D2NP2UGIG4WJ53KESRKGWVZONG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2NP2UGIG4WJ53KESRKGWVZONG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:D2NP2UGIG4WJ53KESRKGWVZONG","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":"25a76442cab59dd875f2f3bf05afedcc254e1ad735db85808d7cef202dd9395a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-06T20:30:57Z","title_canon_sha256":"1ea61d1b7018173e6cd4227d7360911cb0b48725c9492469b22a6cfa7a27358c"},"schema_version":"1.0","source":{"id":"1606.01933","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01933","created_at":"2026-05-18T01:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01933v2","created_at":"2026-05-18T01:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01933","created_at":"2026-05-18T01:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"D2NP2UGIG4WJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"D2NP2UGIG4WJ53KE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"D2NP2UGI","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:0a0d80d614be56b8863dbe7128ca1a08ed845b98175c3cbed9d1e074019153cd","target":"graph","created_at":"2026-05-18T01:03:58Z","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 simple neural architecture for natural language inference. Our approach uses attention to decompose the problem into subproblems that can be solved separately, thus making it trivially parallelizable. On the Stanford Natural Language Inference (SNLI) dataset, we obtain state-of-the-art results with almost an order of magnitude fewer parameters than previous work and without relying on any word-order information. Adding intra-sentence attention that takes a minimum amount of order into account yields further improvements.","authors_text":"Ankur P. Parikh, Dipanjan Das, Jakob Uszkoreit, Oscar T\\\"ackstr\\\"om","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-06T20:30:57Z","title":"A Decomposable Attention Model for Natural Language Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01933","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:494fba10803f65ecae4fab3849e9aee1747ceb1533d1545e7b7c9a51de54891d","target":"record","created_at":"2026-05-18T01:03:58Z","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":"25a76442cab59dd875f2f3bf05afedcc254e1ad735db85808d7cef202dd9395a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-06T20:30:57Z","title_canon_sha256":"1ea61d1b7018173e6cd4227d7360911cb0b48725c9492469b22a6cfa7a27358c"},"schema_version":"1.0","source":{"id":"1606.01933","kind":"arxiv","version":2}},"canonical_sha256":"1e9afd50c8372c9eed4494546b572e6989b2135228e05ca16a3254cc374d78c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e9afd50c8372c9eed4494546b572e6989b2135228e05ca16a3254cc374d78c0","first_computed_at":"2026-05-18T01:03:58.840511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:58.840511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YL5zKvTZfgRhGqPfZpPyl1RwGq57Z3nIHZWnSf2nugdIncuWPA9FdK1/dph6DekDPNn37UvXQqLxrXRBhz2/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:58.841236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01933","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:494fba10803f65ecae4fab3849e9aee1747ceb1533d1545e7b7c9a51de54891d","sha256:0a0d80d614be56b8863dbe7128ca1a08ed845b98175c3cbed9d1e074019153cd"],"state_sha256":"80e470678f7a450bb5452c88ba5e87f83ea8b2ac91c97d80d4bdf66c7a164e9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3WPjkEW0u9fq5Gfv6/ufwm06573k4uFu+Mer+hHuCVDbiDlThBjznW9auEof59EbWPkBqt12HVpKwMjd19GBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:37:48.990379Z","bundle_sha256":"2dbe7d9c35ef5b5daff47433f8ee3f131dc2e085c79c84aea245bd9bc3803057"}}