{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TBJNHAKGPDIJ6OUTY7WYXVZ5BH","short_pith_number":"pith:TBJNHAKG","canonical_record":{"source":{"id":"1901.02222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-08T09:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"d7158cf67fbcafb58d126c66c1b3a44a0dd4f0a6a23e73a8bc7389103beba685","abstract_canon_sha256":"3b66434e10e726ed7e2b96da7ac36572e9b910ac52130983d6043d037cdb4133"},"schema_version":"1.0"},"canonical_sha256":"9852d3814678d09f3a93c7ed8bd73d09f63c8d02f3fa466edceabc5b42fd4cef","source":{"kind":"arxiv","id":"1901.02222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02222","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02222v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02222","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"TBJNHAKGPDIJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TBJNHAKGPDIJ6OUT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TBJNHAKG","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TBJNHAKGPDIJ6OUTY7WYXVZ5BH","target":"record","payload":{"canonical_record":{"source":{"id":"1901.02222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-08T09:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"d7158cf67fbcafb58d126c66c1b3a44a0dd4f0a6a23e73a8bc7389103beba685","abstract_canon_sha256":"3b66434e10e726ed7e2b96da7ac36572e9b910ac52130983d6043d037cdb4133"},"schema_version":"1.0"},"canonical_sha256":"9852d3814678d09f3a93c7ed8bd73d09f63c8d02f3fa466edceabc5b42fd4cef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:43.738977Z","signature_b64":"34ElVDRJKnPpoMGfuzdg6JWmnxlqlz7sWDiNey3qeJ/do8M6zS8BxXnN3N94PvaMI7gjZBVJwtPF71MC9wTkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9852d3814678d09f3a93c7ed8bd73d09f63c8d02f3fa466edceabc5b42fd4cef","last_reissued_at":"2026-05-17T23:56:43.738591Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:43.738591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.02222","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-17T23:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtVBFc9Xp33LEl0GqfUNtPU0ksnhSAC/VWInIqV++spglM94UWYIR5ngH52DMildFIrQva/Ay8PBhhRyUQkZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:55:59.420184Z"},"content_sha256":"724c7bad1f75b7c9fbaad09209cfb306e03801758de7653f6eb748e70e1d8a35","schema_version":"1.0","event_id":"sha256:724c7bad1f75b7c9fbaad09209cfb306e03801758de7653f6eb748e70e1d8a35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TBJNHAKGPDIJ6OUTY7WYXVZ5BH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-turn Inference Matching Network for Natural Language Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chunhua Liu, Dong Yu, Hainan Yu, Shan Jiang","submitted_at":"2019-01-08T09:48:41Z","abstract_excerpt":"Natural Language Inference (NLI) is a fundamental and challenging task in Natural Language Processing (NLP). Most existing methods only apply one-pass inference process on a mixed matching feature, which is a concatenation of different matching features between a premise and a hypothesis. In this paper, we propose a new model called Multi-turn Inference Matching Network (MIMN) to perform multi-turn inference on different matching features. In each turn, the model focuses on one particular matching feature instead of the mixed matching feature. To enhance the interaction between different match"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02222","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-17T23:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsempLXszvg9yM6biV1HEkeZEFW8Efzs6BxaF4jgQ8wMYeyb3vHEmaNZUJaQ0ZT6j16UfzOtUs0SrP07iu2PAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:55:59.420849Z"},"content_sha256":"5bac6a82bf73976e7920062f3348a444bdeeecf1d52d1ee3399eb64e92647e0f","schema_version":"1.0","event_id":"sha256:5bac6a82bf73976e7920062f3348a444bdeeecf1d52d1ee3399eb64e92647e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH/bundle.json","state_url":"https://pith.science/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH/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-05T21:55:59Z","links":{"resolver":"https://pith.science/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH","bundle":"https://pith.science/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH/bundle.json","state":"https://pith.science/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBJNHAKGPDIJ6OUTY7WYXVZ5BH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TBJNHAKGPDIJ6OUTY7WYXVZ5BH","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":"3b66434e10e726ed7e2b96da7ac36572e9b910ac52130983d6043d037cdb4133","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-08T09:48:41Z","title_canon_sha256":"d7158cf67fbcafb58d126c66c1b3a44a0dd4f0a6a23e73a8bc7389103beba685"},"schema_version":"1.0","source":{"id":"1901.02222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.02222","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1901.02222v1","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02222","created_at":"2026-05-17T23:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"TBJNHAKGPDIJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TBJNHAKGPDIJ6OUT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TBJNHAKG","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5bac6a82bf73976e7920062f3348a444bdeeecf1d52d1ee3399eb64e92647e0f","target":"graph","created_at":"2026-05-17T23:56:43Z","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":"Natural Language Inference (NLI) is a fundamental and challenging task in Natural Language Processing (NLP). Most existing methods only apply one-pass inference process on a mixed matching feature, which is a concatenation of different matching features between a premise and a hypothesis. In this paper, we propose a new model called Multi-turn Inference Matching Network (MIMN) to perform multi-turn inference on different matching features. In each turn, the model focuses on one particular matching feature instead of the mixed matching feature. To enhance the interaction between different match","authors_text":"Chunhua Liu, Dong Yu, Hainan Yu, Shan Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-08T09:48:41Z","title":"Multi-turn Inference Matching Network for Natural Language Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02222","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:724c7bad1f75b7c9fbaad09209cfb306e03801758de7653f6eb748e70e1d8a35","target":"record","created_at":"2026-05-17T23:56:43Z","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":"3b66434e10e726ed7e2b96da7ac36572e9b910ac52130983d6043d037cdb4133","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-01-08T09:48:41Z","title_canon_sha256":"d7158cf67fbcafb58d126c66c1b3a44a0dd4f0a6a23e73a8bc7389103beba685"},"schema_version":"1.0","source":{"id":"1901.02222","kind":"arxiv","version":1}},"canonical_sha256":"9852d3814678d09f3a93c7ed8bd73d09f63c8d02f3fa466edceabc5b42fd4cef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9852d3814678d09f3a93c7ed8bd73d09f63c8d02f3fa466edceabc5b42fd4cef","first_computed_at":"2026-05-17T23:56:43.738591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:43.738591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34ElVDRJKnPpoMGfuzdg6JWmnxlqlz7sWDiNey3qeJ/do8M6zS8BxXnN3N94PvaMI7gjZBVJwtPF71MC9wTkCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:43.738977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.02222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:724c7bad1f75b7c9fbaad09209cfb306e03801758de7653f6eb748e70e1d8a35","sha256:5bac6a82bf73976e7920062f3348a444bdeeecf1d52d1ee3399eb64e92647e0f"],"state_sha256":"4a8dc4073a7346ddb9411d556171ce30e43fbc9bbccd5adba2447e1e0f90b1f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7fEQEXWygfRS3n2sA5cto9RbdUJzqNIHqbUaXSY5+hE6oBJj2EDuV93OSMGgSJh1taG6tM91ipM6CpfaHFiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:55:59.424110Z","bundle_sha256":"87034dbcc7c006f5e7bb5592f82eea2946ba7c5e381aa7623fd193e8002bdb4d"}}