{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GDBZSVAD65U5XJRUT6SITBLKNC","short_pith_number":"pith:GDBZSVAD","canonical_record":{"source":{"id":"1503.02801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-03-10T07:51:59Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ecd67a7c7b4a3c7570033506b020c150a7a17bcf251057a4807c8d4a3354a300","abstract_canon_sha256":"097179cb1d6686f0119e5bc9146109720c0b6453cb7f5f4e667ab570ded8a41e"},"schema_version":"1.0"},"canonical_sha256":"30c3995403f769dba6349fa489856a6897d1c277f43118c099f62af27ee0762d","source":{"kind":"arxiv","id":"1503.02801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02801","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02801v1","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02801","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"GDBZSVAD65U5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GDBZSVAD65U5XJRU","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GDBZSVAD","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GDBZSVAD65U5XJRUT6SITBLKNC","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-03-10T07:51:59Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ecd67a7c7b4a3c7570033506b020c150a7a17bcf251057a4807c8d4a3354a300","abstract_canon_sha256":"097179cb1d6686f0119e5bc9146109720c0b6453cb7f5f4e667ab570ded8a41e"},"schema_version":"1.0"},"canonical_sha256":"30c3995403f769dba6349fa489856a6897d1c277f43118c099f62af27ee0762d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:00.256274Z","signature_b64":"VSEUARZbMSmfLA1gMa11MefZ/UJgF0YK1/yOrI4wUOAEthXTBcP9F/mSSxvVbra6YEZQSgXpSOjOudJUMnzSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c3995403f769dba6349fa489856a6897d1c277f43118c099f62af27ee0762d","last_reissued_at":"2026-05-18T02:19:00.255694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:00.255694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02801","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-18T02:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wU4/Fo6UQJGPNF1CFiQ0kQqBSkNvwQ8xicxb7GMYr+uFG+0rkSclV/CroMxojXdFxm0Tlhsv0uEPbfDzut++AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:43:24.790224Z"},"content_sha256":"e1b1749c3a906b9da049d641796329c23d749dd1cb269623ceba321aaded5efc","schema_version":"1.0","event_id":"sha256:e1b1749c3a906b9da049d641796329c23d749dd1cb269623ceba321aaded5efc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GDBZSVAD65U5XJRUT6SITBLKNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short Text Hashing Improved by Integrating Multi-Granularity Topics and Tags","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Bo Xu, Fangyuan Wang, Guanhua Tian, Hongwei Hao, Jiaming Xu, Jun Zhao","submitted_at":"2015-03-10T07:51:59Z","abstract_excerpt":"Due to computational and storage efficiencies of compact binary codes, hashing has been widely used for large-scale similarity search. Unfortunately, many existing hashing methods based on observed keyword features are not effective for short texts due to the sparseness and shortness. Recently, some researchers try to utilize latent topics of certain granularity to preserve semantic similarity in hash codes beyond keyword matching. However, topics of certain granularity are not adequate to represent the intrinsic semantic information. In this paper, we present a novel unified approach for shor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02801","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-18T02:19:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE/Tyf1L80MGfOW9Y8DpZTQimUpZD6hnS5x6KaKhOpbg5dy1ORXPOKWgdOMiCnUh55dRL8YaAiBsKerZ3N90Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:43:24.790964Z"},"content_sha256":"62838ece95b7694895a7f25eece8d3ad77e37caf871957657a3ec34fa8246dcb","schema_version":"1.0","event_id":"sha256:62838ece95b7694895a7f25eece8d3ad77e37caf871957657a3ec34fa8246dcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDBZSVAD65U5XJRUT6SITBLKNC/bundle.json","state_url":"https://pith.science/pith/GDBZSVAD65U5XJRUT6SITBLKNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDBZSVAD65U5XJRUT6SITBLKNC/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-06-05T22:43:24Z","links":{"resolver":"https://pith.science/pith/GDBZSVAD65U5XJRUT6SITBLKNC","bundle":"https://pith.science/pith/GDBZSVAD65U5XJRUT6SITBLKNC/bundle.json","state":"https://pith.science/pith/GDBZSVAD65U5XJRUT6SITBLKNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDBZSVAD65U5XJRUT6SITBLKNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GDBZSVAD65U5XJRUT6SITBLKNC","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":"097179cb1d6686f0119e5bc9146109720c0b6453cb7f5f4e667ab570ded8a41e","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-03-10T07:51:59Z","title_canon_sha256":"ecd67a7c7b4a3c7570033506b020c150a7a17bcf251057a4807c8d4a3354a300"},"schema_version":"1.0","source":{"id":"1503.02801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02801","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02801v1","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02801","created_at":"2026-05-18T02:19:00Z"},{"alias_kind":"pith_short_12","alias_value":"GDBZSVAD65U5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GDBZSVAD65U5XJRU","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GDBZSVAD","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:62838ece95b7694895a7f25eece8d3ad77e37caf871957657a3ec34fa8246dcb","target":"graph","created_at":"2026-05-18T02:19:00Z","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":"Due to computational and storage efficiencies of compact binary codes, hashing has been widely used for large-scale similarity search. Unfortunately, many existing hashing methods based on observed keyword features are not effective for short texts due to the sparseness and shortness. Recently, some researchers try to utilize latent topics of certain granularity to preserve semantic similarity in hash codes beyond keyword matching. However, topics of certain granularity are not adequate to represent the intrinsic semantic information. In this paper, we present a novel unified approach for shor","authors_text":"Bo Xu, Fangyuan Wang, Guanhua Tian, Hongwei Hao, Jiaming Xu, Jun Zhao","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-03-10T07:51:59Z","title":"Short Text Hashing Improved by Integrating Multi-Granularity Topics and Tags"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02801","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:e1b1749c3a906b9da049d641796329c23d749dd1cb269623ceba321aaded5efc","target":"record","created_at":"2026-05-18T02:19:00Z","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":"097179cb1d6686f0119e5bc9146109720c0b6453cb7f5f4e667ab570ded8a41e","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2015-03-10T07:51:59Z","title_canon_sha256":"ecd67a7c7b4a3c7570033506b020c150a7a17bcf251057a4807c8d4a3354a300"},"schema_version":"1.0","source":{"id":"1503.02801","kind":"arxiv","version":1}},"canonical_sha256":"30c3995403f769dba6349fa489856a6897d1c277f43118c099f62af27ee0762d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c3995403f769dba6349fa489856a6897d1c277f43118c099f62af27ee0762d","first_computed_at":"2026-05-18T02:19:00.255694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:00.255694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VSEUARZbMSmfLA1gMa11MefZ/UJgF0YK1/yOrI4wUOAEthXTBcP9F/mSSxvVbra6YEZQSgXpSOjOudJUMnzSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:00.256274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1b1749c3a906b9da049d641796329c23d749dd1cb269623ceba321aaded5efc","sha256:62838ece95b7694895a7f25eece8d3ad77e37caf871957657a3ec34fa8246dcb"],"state_sha256":"4ba503bac322a0c6c6085d10a7c0e2c127babf0af388c3e1828ebd42c4e29008"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTaATmz+UqjGxD/VM7OeOQp9eg67ZPi2fwtJ9BaRGo4zQZY7gWTHJRINiCuj/TkhPgsTjF5BvdQP3f64M43yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:43:24.794893Z","bundle_sha256":"e6ff4ffd0fcd89fe09a4a1ea5a70df116a88e9011ee16967fab552e824a53e05"}}