{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y4TSYUTKCQ2OKNIQVU56D3XAGG","short_pith_number":"pith:Y4TSYUTK","canonical_record":{"source":{"id":"1604.04378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-15T07:23:53Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"a55e99c4b94e58c59a9b49ed3ce19be4925c09ea72758f5a41ce0394be0feb0f","abstract_canon_sha256":"81efec8fe8544718bae02ba35b87505888726507ef978490140d091cdd877569"},"schema_version":"1.0"},"canonical_sha256":"c7272c526a1434e53510ad3be1eee031bb15c4c7f0f131a68d0d8d593de88c9f","source":{"kind":"arxiv","id":"1604.04378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04378","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04378v1","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04378","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"Y4TSYUTKCQ2O","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y4TSYUTKCQ2OKNIQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y4TSYUTK","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y4TSYUTKCQ2OKNIQVU56D3XAGG","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-15T07:23:53Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"a55e99c4b94e58c59a9b49ed3ce19be4925c09ea72758f5a41ce0394be0feb0f","abstract_canon_sha256":"81efec8fe8544718bae02ba35b87505888726507ef978490140d091cdd877569"},"schema_version":"1.0"},"canonical_sha256":"c7272c526a1434e53510ad3be1eee031bb15c4c7f0f131a68d0d8d593de88c9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:38.779137Z","signature_b64":"izL8PdWR0g18iijGikVi5ID73thScDMnKb5ITivlAhYHW+HRXkQ0RevG4BL43liX2g3wtmMl5VbxRhSIpOrhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7272c526a1434e53510ad3be1eee031bb15c4c7f0f131a68d0d8d593de88c9f","last_reissued_at":"2026-05-18T01:16:38.778531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:38.778531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04378","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:16:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq4H2LeFilZZ/nn3Zld0oOdrW3BoK03+CgXwj8VdO04F1Dlep1YJZMKpKQdODOSMBEl2XEPtpOZZlmB9cLLgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:55:12.351136Z"},"content_sha256":"9afc8e2a2e85a4c4386df2612a09626c35437e83826a231ef9f7c362f8c91c95","schema_version":"1.0","event_id":"sha256:9afc8e2a2e85a4c4386df2612a09626c35437e83826a231ef9f7c362f8c91c95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y4TSYUTKCQ2OKNIQVU56D3XAGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Match-SRNN: Modeling the Recursive Matching Structure with Spatial RNN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Jiafeng Guo, Jun Xu, Liang Pang, Shengxian Wan, Xueqi Cheng, Yanyan Lan","submitted_at":"2016-04-15T07:23:53Z","abstract_excerpt":"Semantic matching, which aims to determine the matching degree between two texts, is a fundamental problem for many NLP applications. Recently, deep learning approach has been applied to this problem and significant improvements have been achieved. In this paper, we propose to view the generation of the global interaction between two texts as a recursive process: i.e. the interaction of two texts at each position is a composition of the interactions between their prefixes as well as the word level interaction at the current position. Based on this idea, we propose a novel deep architecture, na"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04378","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:16:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia6Vn2hz7kPbQaZNN0pD90XBSLxb4wpWLRC+kM/fxEcgfkx0eaIo3FUcAc+rp4cObg4rzAAlZwtanU+acC0ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:55:12.351602Z"},"content_sha256":"b5d8a1e38de4597b77b39057b1e8023a0bce26693aab303f54afbca371b00b3e","schema_version":"1.0","event_id":"sha256:b5d8a1e38de4597b77b39057b1e8023a0bce26693aab303f54afbca371b00b3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG/bundle.json","state_url":"https://pith.science/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG/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:55:12Z","links":{"resolver":"https://pith.science/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG","bundle":"https://pith.science/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG/bundle.json","state":"https://pith.science/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4TSYUTKCQ2OKNIQVU56D3XAGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y4TSYUTKCQ2OKNIQVU56D3XAGG","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":"81efec8fe8544718bae02ba35b87505888726507ef978490140d091cdd877569","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-15T07:23:53Z","title_canon_sha256":"a55e99c4b94e58c59a9b49ed3ce19be4925c09ea72758f5a41ce0394be0feb0f"},"schema_version":"1.0","source":{"id":"1604.04378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04378","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04378v1","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04378","created_at":"2026-05-18T01:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"Y4TSYUTKCQ2O","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Y4TSYUTKCQ2OKNIQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Y4TSYUTK","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b5d8a1e38de4597b77b39057b1e8023a0bce26693aab303f54afbca371b00b3e","target":"graph","created_at":"2026-05-18T01:16:38Z","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":"Semantic matching, which aims to determine the matching degree between two texts, is a fundamental problem for many NLP applications. Recently, deep learning approach has been applied to this problem and significant improvements have been achieved. In this paper, we propose to view the generation of the global interaction between two texts as a recursive process: i.e. the interaction of two texts at each position is a composition of the interactions between their prefixes as well as the word level interaction at the current position. Based on this idea, we propose a novel deep architecture, na","authors_text":"Jiafeng Guo, Jun Xu, Liang Pang, Shengxian Wan, Xueqi Cheng, Yanyan Lan","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-15T07:23:53Z","title":"Match-SRNN: Modeling the Recursive Matching Structure with Spatial RNN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04378","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:9afc8e2a2e85a4c4386df2612a09626c35437e83826a231ef9f7c362f8c91c95","target":"record","created_at":"2026-05-18T01:16:38Z","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":"81efec8fe8544718bae02ba35b87505888726507ef978490140d091cdd877569","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-04-15T07:23:53Z","title_canon_sha256":"a55e99c4b94e58c59a9b49ed3ce19be4925c09ea72758f5a41ce0394be0feb0f"},"schema_version":"1.0","source":{"id":"1604.04378","kind":"arxiv","version":1}},"canonical_sha256":"c7272c526a1434e53510ad3be1eee031bb15c4c7f0f131a68d0d8d593de88c9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7272c526a1434e53510ad3be1eee031bb15c4c7f0f131a68d0d8d593de88c9f","first_computed_at":"2026-05-18T01:16:38.778531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:38.778531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izL8PdWR0g18iijGikVi5ID73thScDMnKb5ITivlAhYHW+HRXkQ0RevG4BL43liX2g3wtmMl5VbxRhSIpOrhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:38.779137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9afc8e2a2e85a4c4386df2612a09626c35437e83826a231ef9f7c362f8c91c95","sha256:b5d8a1e38de4597b77b39057b1e8023a0bce26693aab303f54afbca371b00b3e"],"state_sha256":"910aecf1b88dc63ee62fa3b86598be07e0d57848808f516175a33a6da86f576b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGl3uBqfxe8/SNlEwamgHQfwqia1NlflLEf9te6jmw6TUn0ILPNYGofP4GB9dAu0AGZDgKr7VDae12EyqetBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:55:12.355193Z","bundle_sha256":"cba7fd3716d2006cc3c26bcea0901739cdc9142a9261000008cad629d0dc0c44"}}