{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TTSWAWSX3UZFZPRTNKB4TFBEZE","short_pith_number":"pith:TTSWAWSX","schema_version":"1.0","canonical_sha256":"9ce5605a57dd325cbe336a83c99424c93824385751e2f595e3fdc5c954b6cc4b","source":{"kind":"arxiv","id":"1805.10685","version":1},"attestation_state":"computed","paper":{"title":"Legal Document Retrieval using Document Vector Embeddings and Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Amal Shehan Perera, Buddhi Ayesha, Dimuthu Lakmal, Keet Sugathadasa, Madhavi Perera, Nisansa de Silva, Vindula Jayawardana","submitted_at":"2018-05-27T20:55:50Z","abstract_excerpt":"Domain specific information retrieval process has been a prominent and ongoing research in the field of natural language processing. Many researchers have incorporated different techniques to overcome the technical and domain specificity and provide a mature model for various domains of interest. The main bottleneck in these studies is the heavy coupling of domain experts, that makes the entire process to be time consuming and cumbersome. In this study, we have developed three novel models which are compared against a golden standard generated via the on line repositories provided, specificall"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.10685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-05-27T20:55:50Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"255d363a042fc7c35a7306f930e67159e4b23243affc08788a70dd5a646bb8cf","abstract_canon_sha256":"e7a1892b008dee2b84d11e02bb50d7ba79b1bc44e2078d01ceb2cf2e235cdfc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:36.338796Z","signature_b64":"/ftz4r7OscvXf1PHokoUJpNXBe3HV6Wdp2Q+pS6IQkQf+D74iL7jhdFA6HyxsxxL7MCpEIJQs6vdbhqXOtk/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ce5605a57dd325cbe336a83c99424c93824385751e2f595e3fdc5c954b6cc4b","last_reissued_at":"2026-07-05T03:37:36.338292Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:36.338292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Legal Document Retrieval using Document Vector Embeddings and Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Amal Shehan Perera, Buddhi Ayesha, Dimuthu Lakmal, Keet Sugathadasa, Madhavi Perera, Nisansa de Silva, Vindula Jayawardana","submitted_at":"2018-05-27T20:55:50Z","abstract_excerpt":"Domain specific information retrieval process has been a prominent and ongoing research in the field of natural language processing. Many researchers have incorporated different techniques to overcome the technical and domain specificity and provide a mature model for various domains of interest. The main bottleneck in these studies is the heavy coupling of domain experts, that makes the entire process to be time consuming and cumbersome. In this study, we have developed three novel models which are compared against a golden standard generated via the on line repositories provided, specificall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10685","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.10685/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.10685","created_at":"2026-07-05T03:37:36.338362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10685v1","created_at":"2026-07-05T03:37:36.338362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10685","created_at":"2026-07-05T03:37:36.338362+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTSWAWSX3UZF","created_at":"2026-07-05T03:37:36.338362+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTSWAWSX3UZFZPRT","created_at":"2026-07-05T03:37:36.338362+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTSWAWSX","created_at":"2026-07-05T03:37:36.338362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14619","citing_title":"Optimizing Legal Document Retrieval in Vietnamese with Semi-Hard Negative Mining","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE","json":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE.json","graph_json":"https://pith.science/api/pith-number/TTSWAWSX3UZFZPRTNKB4TFBEZE/graph.json","events_json":"https://pith.science/api/pith-number/TTSWAWSX3UZFZPRTNKB4TFBEZE/events.json","paper":"https://pith.science/paper/TTSWAWSX"},"agent_actions":{"view_html":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE","download_json":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE.json","view_paper":"https://pith.science/paper/TTSWAWSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10685&json=true","fetch_graph":"https://pith.science/api/pith-number/TTSWAWSX3UZFZPRTNKB4TFBEZE/graph.json","fetch_events":"https://pith.science/api/pith-number/TTSWAWSX3UZFZPRTNKB4TFBEZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE/action/storage_attestation","attest_author":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE/action/author_attestation","sign_citation":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE/action/citation_signature","submit_replication":"https://pith.science/pith/TTSWAWSX3UZFZPRTNKB4TFBEZE/action/replication_record"}},"created_at":"2026-07-05T03:37:36.338362+00:00","updated_at":"2026-07-05T03:37:36.338362+00:00"}