{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:REMZKOYJQQTDVUUAB6TYM6MR5A","short_pith_number":"pith:REMZKOYJ","schema_version":"1.0","canonical_sha256":"8919953b0984263ad2800fa7867991e815bec81673194e5bc6a7e37cdc7431b5","source":{"kind":"arxiv","id":"1709.00389","version":1},"attestation_state":"computed","paper":{"title":"End-to-end Learning for Short Text Expansion","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Jian Tang, Kai Zheng, Qiaozhu Mei, Yue Wang","submitted_at":"2017-08-30T04:24:06Z","abstract_excerpt":"Effectively making sense of short texts is a critical task for many real world applications such as search engines, social media services, and recommender systems. The task is particularly challenging as a short text contains very sparse information, often too sparse for a machine learning algorithm to pick up useful signals. A common practice for analyzing short text is to first expand it with external information, which is usually harvested from a large collection of longer texts. In literature, short text expansion has been done with all kinds of heuristics. We propose an end-to-end solutio"},"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":"1709.00389","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2017-08-30T04:24:06Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"21ecf25262ad63664d4b31800437920dc3bf38a28dda628f7c83a855ce572668","abstract_canon_sha256":"afd48086d8ab90435f0b24f5809da86339ae063f1a496c62e77b4b95c5d6a952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:10.484917Z","signature_b64":"jDAJeq3PFQSQMWZJWkA4g4o2A7qb7HOZKmSvfJS5m/AtRVDC5OeU0+HduiR+mll9cLn3VoYSkQx9xuUCwl3jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8919953b0984263ad2800fa7867991e815bec81673194e5bc6a7e37cdc7431b5","last_reissued_at":"2026-05-18T00:36:10.484266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:10.484266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Learning for Short Text Expansion","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CL","authors_text":"Jian Tang, Kai Zheng, Qiaozhu Mei, Yue Wang","submitted_at":"2017-08-30T04:24:06Z","abstract_excerpt":"Effectively making sense of short texts is a critical task for many real world applications such as search engines, social media services, and recommender systems. The task is particularly challenging as a short text contains very sparse information, often too sparse for a machine learning algorithm to pick up useful signals. A common practice for analyzing short text is to first expand it with external information, which is usually harvested from a large collection of longer texts. In literature, short text expansion has been done with all kinds of heuristics. We propose an end-to-end solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00389","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":"1709.00389","created_at":"2026-05-18T00:36:10.484381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00389v1","created_at":"2026-05-18T00:36:10.484381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00389","created_at":"2026-05-18T00:36:10.484381+00:00"},{"alias_kind":"pith_short_12","alias_value":"REMZKOYJQQTD","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"REMZKOYJQQTDVUUA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"REMZKOYJ","created_at":"2026-05-18T12:31:39.905425+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/REMZKOYJQQTDVUUAB6TYM6MR5A","json":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A.json","graph_json":"https://pith.science/api/pith-number/REMZKOYJQQTDVUUAB6TYM6MR5A/graph.json","events_json":"https://pith.science/api/pith-number/REMZKOYJQQTDVUUAB6TYM6MR5A/events.json","paper":"https://pith.science/paper/REMZKOYJ"},"agent_actions":{"view_html":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A","download_json":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A.json","view_paper":"https://pith.science/paper/REMZKOYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00389&json=true","fetch_graph":"https://pith.science/api/pith-number/REMZKOYJQQTDVUUAB6TYM6MR5A/graph.json","fetch_events":"https://pith.science/api/pith-number/REMZKOYJQQTDVUUAB6TYM6MR5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A/action/storage_attestation","attest_author":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A/action/author_attestation","sign_citation":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A/action/citation_signature","submit_replication":"https://pith.science/pith/REMZKOYJQQTDVUUAB6TYM6MR5A/action/replication_record"}},"created_at":"2026-05-18T00:36:10.484381+00:00","updated_at":"2026-05-18T00:36:10.484381+00:00"}