{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NSYGEYAG24L7BZ7QAWIZDBVIBX","short_pith_number":"pith:NSYGEYAG","canonical_record":{"source":{"id":"1801.00102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-30T08:54:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6bee4ea3203642e0312e90ed331fab0afd23c1967cf2b875ad54e439baa35313","abstract_canon_sha256":"4f9f21215a98dd18d0bf7669093ecbe8d7b635eba2c8102b8ca4eb22f06f9680"},"schema_version":"1.0"},"canonical_sha256":"6cb0626006d717f0e7f005919186a80df705d8827c89427f40424fcc8c820312","source":{"kind":"arxiv","id":"1801.00102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00102","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00102v2","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00102","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"NSYGEYAG24L7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSYGEYAG24L7BZ7Q","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSYGEYAG","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NSYGEYAG24L7BZ7QAWIZDBVIBX","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-30T08:54:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6bee4ea3203642e0312e90ed331fab0afd23c1967cf2b875ad54e439baa35313","abstract_canon_sha256":"4f9f21215a98dd18d0bf7669093ecbe8d7b635eba2c8102b8ca4eb22f06f9680"},"schema_version":"1.0"},"canonical_sha256":"6cb0626006d717f0e7f005919186a80df705d8827c89427f40424fcc8c820312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:11.945372Z","signature_b64":"ELufF10mHmwwVQvOd085kM/WNa2DkG+JDG/hr7A+M+wRaT3v/LPJBea0WPHIFEHAPvs/locojK58chiQHEFHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cb0626006d717f0e7f005919186a80df705d8827c89427f40424fcc8c820312","last_reissued_at":"2026-05-18T00:06:11.944800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:11.944800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00102","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-18T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IN6eiGx+P2k7LatO1dANE1idIopARYmyXbqk1uk33jAflwTx93T+Qdub1lwprzGJCFo2jXr6GbY5SUa21LphCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:56:00.716917Z"},"content_sha256":"98313a9dd844fd6b47a7b7cdfc481ba0bea536340973189cc3bc67b0f00b02da","schema_version":"1.0","event_id":"sha256:98313a9dd844fd6b47a7b7cdfc481ba0bea536340973189cc3bc67b0f00b02da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NSYGEYAG24L7BZ7QAWIZDBVIBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compare, Compress and Propagate: Enhancing Neural Architectures with Alignment Factorization for Natural Language Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Luu Anh Tuan, Siu Cheung Hui, Yi Tay","submitted_at":"2017-12-30T08:54:16Z","abstract_excerpt":"This paper presents a new deep learning architecture for Natural Language Inference (NLI). Firstly, we introduce a new architecture where alignment pairs are compared, compressed and then propagated to upper layers for enhanced representation learning. Secondly, we adopt factorization layers for efficient and expressive compression of alignment vectors into scalar features, which are then used to augment the base word representations. The design of our approach is aimed to be conceptually simple, compact and yet powerful. We conduct experiments on three popular benchmarks, SNLI, MultiNLI and S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00102","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-18T00:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrQ2aDZUsLy0+eKPjJdOXad0qApzcMGWxAMpUhuGMwoTjKSOzDzeqsrhT94UduxoQt40RcJU07HGtmU3UOo4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:56:00.717536Z"},"content_sha256":"b0eefe73e025356420efe821a67bb4ba377ab4732b28c831d94f4ba492ce105e","schema_version":"1.0","event_id":"sha256:b0eefe73e025356420efe821a67bb4ba377ab4732b28c831d94f4ba492ce105e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX/bundle.json","state_url":"https://pith.science/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX/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-26T02:56:00Z","links":{"resolver":"https://pith.science/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX","bundle":"https://pith.science/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX/bundle.json","state":"https://pith.science/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSYGEYAG24L7BZ7QAWIZDBVIBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NSYGEYAG24L7BZ7QAWIZDBVIBX","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":"4f9f21215a98dd18d0bf7669093ecbe8d7b635eba2c8102b8ca4eb22f06f9680","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-30T08:54:16Z","title_canon_sha256":"6bee4ea3203642e0312e90ed331fab0afd23c1967cf2b875ad54e439baa35313"},"schema_version":"1.0","source":{"id":"1801.00102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00102","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00102v2","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00102","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"NSYGEYAG24L7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSYGEYAG24L7BZ7Q","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSYGEYAG","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:b0eefe73e025356420efe821a67bb4ba377ab4732b28c831d94f4ba492ce105e","target":"graph","created_at":"2026-05-18T00:06:11Z","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":"This paper presents a new deep learning architecture for Natural Language Inference (NLI). Firstly, we introduce a new architecture where alignment pairs are compared, compressed and then propagated to upper layers for enhanced representation learning. Secondly, we adopt factorization layers for efficient and expressive compression of alignment vectors into scalar features, which are then used to augment the base word representations. The design of our approach is aimed to be conceptually simple, compact and yet powerful. We conduct experiments on three popular benchmarks, SNLI, MultiNLI and S","authors_text":"Luu Anh Tuan, Siu Cheung Hui, Yi Tay","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-30T08:54:16Z","title":"Compare, Compress and Propagate: Enhancing Neural Architectures with Alignment Factorization for Natural Language Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00102","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:98313a9dd844fd6b47a7b7cdfc481ba0bea536340973189cc3bc67b0f00b02da","target":"record","created_at":"2026-05-18T00:06:11Z","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":"4f9f21215a98dd18d0bf7669093ecbe8d7b635eba2c8102b8ca4eb22f06f9680","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-12-30T08:54:16Z","title_canon_sha256":"6bee4ea3203642e0312e90ed331fab0afd23c1967cf2b875ad54e439baa35313"},"schema_version":"1.0","source":{"id":"1801.00102","kind":"arxiv","version":2}},"canonical_sha256":"6cb0626006d717f0e7f005919186a80df705d8827c89427f40424fcc8c820312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cb0626006d717f0e7f005919186a80df705d8827c89427f40424fcc8c820312","first_computed_at":"2026-05-18T00:06:11.944800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:11.944800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELufF10mHmwwVQvOd085kM/WNa2DkG+JDG/hr7A+M+wRaT3v/LPJBea0WPHIFEHAPvs/locojK58chiQHEFHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:11.945372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98313a9dd844fd6b47a7b7cdfc481ba0bea536340973189cc3bc67b0f00b02da","sha256:b0eefe73e025356420efe821a67bb4ba377ab4732b28c831d94f4ba492ce105e"],"state_sha256":"06e2e946bf3f613563d3ea73557e70e71ecb10a04c3b92904323df297c6f5f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TWUBFYM+jTwSfNe82fcyxETAbApfrmIsXkIcSAo/VFfTqDXIQjKUFdo3L+cW/qFV0Pt9+sKrBxMSIixpnHgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:56:00.720810Z","bundle_sha256":"e9c3377c782c0f9daf9f7b5b44c0f90a47b66345132614483dda07e816262203"}}