{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RVOPCUPQL2RENWCTJEAWPFLD6O","short_pith_number":"pith:RVOPCUPQ","schema_version":"1.0","canonical_sha256":"8d5cf151f05ea246d8534901679563f38954d8f8ac6e990cc0f5b8a4139bc226","source":{"kind":"arxiv","id":"1711.07227","version":1},"attestation_state":"computed","paper":{"title":"Linear-Complexity Relaxed Word Mover's Distance with GPU Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.IR","authors_text":"Abdel Labbi, Celestine D\\\"unner, Cesar Berrospi, Haralampos Pozidis, Kubilay Atasu, Manolis Sifalakis, Michail Vlachos, Thomas Parnell, Vasileios Vasileiadis","submitted_at":"2017-11-20T09:45:02Z","abstract_excerpt":"The amount of unstructured text-based data is growing every day. Querying, clustering, and classifying this big data requires similarity computations across large sets of documents. Whereas low-complexity similarity metrics are available, attention has been shifting towards more complex methods that achieve a higher accuracy. In particular, the Word Mover's Distance (WMD) method proposed by Kusner et al. is a promising new approach, but its time complexity grows cubically with the number of unique words in the documents. The Relaxed Word Mover's Distance (RWMD) method, again proposed by Kusner"},"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":"1711.07227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-11-20T09:45:02Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"60e33b92040c0e9d107b110c185ad18d826f227aeb36b37b49dc92709cccb344","abstract_canon_sha256":"dba8aaa9a92611cf58ed4838d27f40f61a0efa926e49f217b8dc9926e2c22caf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:10.804773Z","signature_b64":"2iTjrLgaLnKiO7uEsZb/kYMRJKRtLLj3VnlYSVsLy32vyMEoF8tFTTGagtISpQZtzTPKelZFTfxiIbey7UaZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d5cf151f05ea246d8534901679563f38954d8f8ac6e990cc0f5b8a4139bc226","last_reissued_at":"2026-05-18T00:30:10.804116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:10.804116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Complexity Relaxed Word Mover's Distance with GPU Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.IR","authors_text":"Abdel Labbi, Celestine D\\\"unner, Cesar Berrospi, Haralampos Pozidis, Kubilay Atasu, Manolis Sifalakis, Michail Vlachos, Thomas Parnell, Vasileios Vasileiadis","submitted_at":"2017-11-20T09:45:02Z","abstract_excerpt":"The amount of unstructured text-based data is growing every day. Querying, clustering, and classifying this big data requires similarity computations across large sets of documents. Whereas low-complexity similarity metrics are available, attention has been shifting towards more complex methods that achieve a higher accuracy. In particular, the Word Mover's Distance (WMD) method proposed by Kusner et al. is a promising new approach, but its time complexity grows cubically with the number of unique words in the documents. The Relaxed Word Mover's Distance (RWMD) method, again proposed by Kusner"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07227","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.07227","created_at":"2026-05-18T00:30:10.804235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07227v1","created_at":"2026-05-18T00:30:10.804235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07227","created_at":"2026-05-18T00:30:10.804235+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVOPCUPQL2RE","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVOPCUPQL2RENWCT","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVOPCUPQ","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O","json":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O.json","graph_json":"https://pith.science/api/pith-number/RVOPCUPQL2RENWCTJEAWPFLD6O/graph.json","events_json":"https://pith.science/api/pith-number/RVOPCUPQL2RENWCTJEAWPFLD6O/events.json","paper":"https://pith.science/paper/RVOPCUPQ"},"agent_actions":{"view_html":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O","download_json":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O.json","view_paper":"https://pith.science/paper/RVOPCUPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07227&json=true","fetch_graph":"https://pith.science/api/pith-number/RVOPCUPQL2RENWCTJEAWPFLD6O/graph.json","fetch_events":"https://pith.science/api/pith-number/RVOPCUPQL2RENWCTJEAWPFLD6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O/action/storage_attestation","attest_author":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O/action/author_attestation","sign_citation":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O/action/citation_signature","submit_replication":"https://pith.science/pith/RVOPCUPQL2RENWCTJEAWPFLD6O/action/replication_record"}},"created_at":"2026-05-18T00:30:10.804235+00:00","updated_at":"2026-05-18T00:30:10.804235+00:00"}