{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:O24DMAKE6XRWI6P4ILERBIFEN6","short_pith_number":"pith:O24DMAKE","schema_version":"1.0","canonical_sha256":"76b8360144f5e36479fc42c910a0a46faba46e2638032d39ff1e6d8af4fd55a0","source":{"kind":"arxiv","id":"2010.01258","version":1},"attestation_state":"computed","paper":{"title":"Hit ratio: An Evaluation Metric for Hashtag Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Amitava Datta, Areej Alsini, Du Q. Huynh","submitted_at":"2020-10-03T02:07:41Z","abstract_excerpt":"Hashtag recommendation is a crucial task, especially with an increase of interest in using social media platforms such as Twitter in the last decade. Hashtag recommendation systems automatically suggest hashtags to a user while writing a tweet. Most of the research in the area of hashtag recommendation have used classical metrics such as hit rate, precision, recall, and F1-score to measure the accuracy of hashtag recommendation systems. These metrics are based on the exact match of the recommended hashtags with their corresponding ground truth. However, it is not clear how adequate these metri"},"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":"2010.01258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-03T02:07:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e32713a933472857db554e828022fb5d05afc22e2cdde60a8248c86daa562cda","abstract_canon_sha256":"20fd802e9edce2992db3ea6692935be4d6b775713685b89b3e0f1488c47c62b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:03.649112Z","signature_b64":"qnw73KDC6Gv3Q0NRczS2/HOTJ9Vj1QZ5qoh4kx1eRVGWyzJXk8AO0cRcBI7hEtP5dIuczpWbUdMj08rIn8pGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76b8360144f5e36479fc42c910a0a46faba46e2638032d39ff1e6d8af4fd55a0","last_reissued_at":"2026-07-05T01:40:03.648749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:03.648749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hit ratio: An Evaluation Metric for Hashtag Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Amitava Datta, Areej Alsini, Du Q. Huynh","submitted_at":"2020-10-03T02:07:41Z","abstract_excerpt":"Hashtag recommendation is a crucial task, especially with an increase of interest in using social media platforms such as Twitter in the last decade. Hashtag recommendation systems automatically suggest hashtags to a user while writing a tweet. Most of the research in the area of hashtag recommendation have used classical metrics such as hit rate, precision, recall, and F1-score to measure the accuracy of hashtag recommendation systems. These metrics are based on the exact match of the recommended hashtags with their corresponding ground truth. However, it is not clear how adequate these metri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01258","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/2010.01258/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":"2010.01258","created_at":"2026-07-05T01:40:03.648802+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.01258v1","created_at":"2026-07-05T01:40:03.648802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01258","created_at":"2026-07-05T01:40:03.648802+00:00"},{"alias_kind":"pith_short_12","alias_value":"O24DMAKE6XRW","created_at":"2026-07-05T01:40:03.648802+00:00"},{"alias_kind":"pith_short_16","alias_value":"O24DMAKE6XRWI6P4","created_at":"2026-07-05T01:40:03.648802+00:00"},{"alias_kind":"pith_short_8","alias_value":"O24DMAKE","created_at":"2026-07-05T01:40:03.648802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05314","citing_title":"Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6","json":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6.json","graph_json":"https://pith.science/api/pith-number/O24DMAKE6XRWI6P4ILERBIFEN6/graph.json","events_json":"https://pith.science/api/pith-number/O24DMAKE6XRWI6P4ILERBIFEN6/events.json","paper":"https://pith.science/paper/O24DMAKE"},"agent_actions":{"view_html":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6","download_json":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6.json","view_paper":"https://pith.science/paper/O24DMAKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.01258&json=true","fetch_graph":"https://pith.science/api/pith-number/O24DMAKE6XRWI6P4ILERBIFEN6/graph.json","fetch_events":"https://pith.science/api/pith-number/O24DMAKE6XRWI6P4ILERBIFEN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6/action/storage_attestation","attest_author":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6/action/author_attestation","sign_citation":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6/action/citation_signature","submit_replication":"https://pith.science/pith/O24DMAKE6XRWI6P4ILERBIFEN6/action/replication_record"}},"created_at":"2026-07-05T01:40:03.648802+00:00","updated_at":"2026-07-05T01:40:03.648802+00:00"}