{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KTUOF64KUPV34A3DIT27V2WHPH","short_pith_number":"pith:KTUOF64K","canonical_record":{"source":{"id":"1712.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-07T19:10:45Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"f4122618dabc12a0f44af3d33de6815c80cf155d24ef81b51e940f753a6df60c","abstract_canon_sha256":"041d80d822bca40a429ec8ebd0ed67aa6e00c488d0d20a3831c3ffb97bb72719"},"schema_version":"1.0"},"canonical_sha256":"54e8e2fb8aa3ebbe036344f5faeac779d9228f2f8c9767e714bbaae57c250b71","source":{"kind":"arxiv","id":"1712.02820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02820","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02820v1","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02820","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"KTUOF64KUPV3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KTUOF64KUPV34A3D","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KTUOF64K","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KTUOF64KUPV34A3DIT27V2WHPH","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-07T19:10:45Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"f4122618dabc12a0f44af3d33de6815c80cf155d24ef81b51e940f753a6df60c","abstract_canon_sha256":"041d80d822bca40a429ec8ebd0ed67aa6e00c488d0d20a3831c3ffb97bb72719"},"schema_version":"1.0"},"canonical_sha256":"54e8e2fb8aa3ebbe036344f5faeac779d9228f2f8c9767e714bbaae57c250b71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:38.797899Z","signature_b64":"PtBlkR+ytIbx1RwtdZaBCkwyszIUxLUJhvejewUWwckr1f3sI6Pegv2oH4ipqGh9Qdc31CWZsfgERdvWAA+YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54e8e2fb8aa3ebbe036344f5faeac779d9228f2f8c9767e714bbaae57c250b71","last_reissued_at":"2026-05-18T00:10:38.797202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:38.797202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02820","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:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLycWsJmpuChng3vkTGf9wcQ9fn8RTzseBp5J/8u9nw9PO7m33l0E2zdqb57wC7rnaYldJkA5y6/pCGfAV1vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T14:13:28.776448Z"},"content_sha256":"ace6d3579fddf84a33073101a9db2744439e26f9b77d480bbfa32d4cc5758e59","schema_version":"1.0","event_id":"sha256:ace6d3579fddf84a33073101a9db2744439e26f9b77d480bbfa32d4cc5758e59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KTUOF64KUPV34A3DIT27V2WHPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deep Network Model for Paraphrase Detection in Short Text Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.IR","authors_text":"Basant Agarwal, Helge Langseth, Heri Ramampiaro, Massimiliano Ruocco","submitted_at":"2017-12-07T19:10:45Z","abstract_excerpt":"This paper is concerned with paraphrase detection. The ability to detect similar sentences written in natural language is crucial for several applications, such as text mining, text summarization, plagiarism detection, authorship authentication and question answering. Given two sentences, the objective is to detect whether they are semantically identical. An important insight from this work is that existing paraphrase systems perform well when applied on clean texts, but they do not necessarily deliver good performance against noisy texts. Challenges with paraphrase detection on user generated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02820","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:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYcw2qV9W+TJJ65VsvQ2CTpMJcMEzPTITLFqkUPLdc/xMBfLvlMdXi1+IlKylTxqO/ZAFRHQNbTeeBAcx67/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T14:13:28.776803Z"},"content_sha256":"cb7e4cb761196bf4837fc66c4c6882e0185a69fd438749c71b691dbd58a852c1","schema_version":"1.0","event_id":"sha256:cb7e4cb761196bf4837fc66c4c6882e0185a69fd438749c71b691dbd58a852c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTUOF64KUPV34A3DIT27V2WHPH/bundle.json","state_url":"https://pith.science/pith/KTUOF64KUPV34A3DIT27V2WHPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTUOF64KUPV34A3DIT27V2WHPH/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-07-04T14:13:28Z","links":{"resolver":"https://pith.science/pith/KTUOF64KUPV34A3DIT27V2WHPH","bundle":"https://pith.science/pith/KTUOF64KUPV34A3DIT27V2WHPH/bundle.json","state":"https://pith.science/pith/KTUOF64KUPV34A3DIT27V2WHPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTUOF64KUPV34A3DIT27V2WHPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KTUOF64KUPV34A3DIT27V2WHPH","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":"041d80d822bca40a429ec8ebd0ed67aa6e00c488d0d20a3831c3ffb97bb72719","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-07T19:10:45Z","title_canon_sha256":"f4122618dabc12a0f44af3d33de6815c80cf155d24ef81b51e940f753a6df60c"},"schema_version":"1.0","source":{"id":"1712.02820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02820","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02820v1","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02820","created_at":"2026-05-18T00:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"KTUOF64KUPV3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KTUOF64KUPV34A3D","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KTUOF64K","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:cb7e4cb761196bf4837fc66c4c6882e0185a69fd438749c71b691dbd58a852c1","target":"graph","created_at":"2026-05-18T00:10: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":"This paper is concerned with paraphrase detection. The ability to detect similar sentences written in natural language is crucial for several applications, such as text mining, text summarization, plagiarism detection, authorship authentication and question answering. Given two sentences, the objective is to detect whether they are semantically identical. An important insight from this work is that existing paraphrase systems perform well when applied on clean texts, but they do not necessarily deliver good performance against noisy texts. Challenges with paraphrase detection on user generated","authors_text":"Basant Agarwal, Helge Langseth, Heri Ramampiaro, Massimiliano Ruocco","cross_cats":["cs.AI","cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-07T19:10:45Z","title":"A Deep Network Model for Paraphrase Detection in Short Text Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02820","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:ace6d3579fddf84a33073101a9db2744439e26f9b77d480bbfa32d4cc5758e59","target":"record","created_at":"2026-05-18T00:10: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":"041d80d822bca40a429ec8ebd0ed67aa6e00c488d0d20a3831c3ffb97bb72719","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-12-07T19:10:45Z","title_canon_sha256":"f4122618dabc12a0f44af3d33de6815c80cf155d24ef81b51e940f753a6df60c"},"schema_version":"1.0","source":{"id":"1712.02820","kind":"arxiv","version":1}},"canonical_sha256":"54e8e2fb8aa3ebbe036344f5faeac779d9228f2f8c9767e714bbaae57c250b71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54e8e2fb8aa3ebbe036344f5faeac779d9228f2f8c9767e714bbaae57c250b71","first_computed_at":"2026-05-18T00:10:38.797202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:38.797202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PtBlkR+ytIbx1RwtdZaBCkwyszIUxLUJhvejewUWwckr1f3sI6Pegv2oH4ipqGh9Qdc31CWZsfgERdvWAA+YCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:38.797899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ace6d3579fddf84a33073101a9db2744439e26f9b77d480bbfa32d4cc5758e59","sha256:cb7e4cb761196bf4837fc66c4c6882e0185a69fd438749c71b691dbd58a852c1"],"state_sha256":"afde804b6e032bc54d1ba2aff34f55777cf5e48deb2184111d3ed45cbaf9b5ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4YarPQblHRNzjWx6TkLfPii3yy2wXzWFGItTh1Njvgwa0TWhUKj3I/BpF3wIYJEtq9ZyL/1rNzPqcZ+ewNBGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T14:13:28.778822Z","bundle_sha256":"4d3b4a8678278d64cc132d1afb5d4f2ba457e5dc787b8cc9d9c7f443425196c9"}}