{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MMOKH4SB77TMSJ2M72QLXOCKJJ","short_pith_number":"pith:MMOKH4SB","canonical_record":{"source":{"id":"1803.03370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-03-09T03:28:36Z","cross_cats_sorted":["cs.AI","cs.CL","cs.SI"],"title_canon_sha256":"abb81c9420db335292e3f8840c5336df8a6d41f8b0f3775aa6fc7a5f81128c9a","abstract_canon_sha256":"18f06c4376c930703bb081d5ae9cb9a671721a21af3b57b9d94f42a21f4cd821"},"schema_version":"1.0"},"canonical_sha256":"631ca3f241ffe6c9274cfea0bbb84a4a796e45a4e5c8bfee8311139c9bbc8308","source":{"kind":"arxiv","id":"1803.03370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03370","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03370v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03370","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"MMOKH4SB77TM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMOKH4SB77TMSJ2M","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMOKH4SB","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MMOKH4SB77TMSJ2M72QLXOCKJJ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-03-09T03:28:36Z","cross_cats_sorted":["cs.AI","cs.CL","cs.SI"],"title_canon_sha256":"abb81c9420db335292e3f8840c5336df8a6d41f8b0f3775aa6fc7a5f81128c9a","abstract_canon_sha256":"18f06c4376c930703bb081d5ae9cb9a671721a21af3b57b9d94f42a21f4cd821"},"schema_version":"1.0"},"canonical_sha256":"631ca3f241ffe6c9274cfea0bbb84a4a796e45a4e5c8bfee8311139c9bbc8308","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:39.781941Z","signature_b64":"JgfhWeAQEIudQdr1T62/Lz6iakZ8f/NSXOGQLOSuZRHTSBZsicoC+QEv/QXlU1SCTLadKatZm1JIjYjlmDUSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"631ca3f241ffe6c9274cfea0bbb84a4a796e45a4e5c8bfee8311139c9bbc8308","last_reissued_at":"2026-05-18T00:21:39.781309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:39.781309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03370","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-18T00:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ntX+y4Hy9NkzpzqBGsxF+aU9pLIl+jCrf7kHeYXos4bMAvQv6bnIwsAA2uaRE95CrGIQdfYFw59QLs5c9dKBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:19:01.358915Z"},"content_sha256":"7b118a2d850b84fca6f111437c47a6c555a4624e67c6ced3871109744151a624","schema_version":"1.0","event_id":"sha256:7b118a2d850b84fca6f111437c47a6c555a4624e67c6ced3871109744151a624"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MMOKH4SB77TMSJ2M72QLXOCKJJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expert Finding in Heterogeneous Bibliographic Networks with Locally-trained Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.SI"],"primary_cat":"cs.IR","authors_text":"Aston Zhang, Huan Gui, Jiawei Han, Liyuan Liu, Qi Zhu","submitted_at":"2018-03-09T03:28:36Z","abstract_excerpt":"Expert finding is an important task in both industry and academia. It is challenging to rank candidates with appropriate expertise for various queries. In addition, different types of objects interact with one another, which naturally forms heterogeneous information networks. We study the task of expert finding in heterogeneous bibliographical networks based on two aspects: textual content analysis and authority ranking. Regarding the textual content analysis, we propose a new method for query expansion via locally-trained embedding learning with concept hierarchy as guidance, which is particu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03370","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-18T00:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Jvgn2TDVSPMIR2cPcR609EeUjxbNihddiWTmMTvg1x5UZU+HgdShfcrJ/xuoWrGah25EcF5UKqi6QBNTuhiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:19:01.359266Z"},"content_sha256":"bbbf8be85e9adf828e3cd40e9c9784f6d7a5425e6f4277cfb824833194acdbd0","schema_version":"1.0","event_id":"sha256:bbbf8be85e9adf828e3cd40e9c9784f6d7a5425e6f4277cfb824833194acdbd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ/bundle.json","state_url":"https://pith.science/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ/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-04T20:19:01Z","links":{"resolver":"https://pith.science/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ","bundle":"https://pith.science/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ/bundle.json","state":"https://pith.science/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMOKH4SB77TMSJ2M72QLXOCKJJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MMOKH4SB77TMSJ2M72QLXOCKJJ","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":"18f06c4376c930703bb081d5ae9cb9a671721a21af3b57b9d94f42a21f4cd821","cross_cats_sorted":["cs.AI","cs.CL","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-03-09T03:28:36Z","title_canon_sha256":"abb81c9420db335292e3f8840c5336df8a6d41f8b0f3775aa6fc7a5f81128c9a"},"schema_version":"1.0","source":{"id":"1803.03370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03370","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03370v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03370","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"MMOKH4SB77TM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMOKH4SB77TMSJ2M","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMOKH4SB","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:bbbf8be85e9adf828e3cd40e9c9784f6d7a5425e6f4277cfb824833194acdbd0","target":"graph","created_at":"2026-05-18T00:21:39Z","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":"Expert finding is an important task in both industry and academia. It is challenging to rank candidates with appropriate expertise for various queries. In addition, different types of objects interact with one another, which naturally forms heterogeneous information networks. We study the task of expert finding in heterogeneous bibliographical networks based on two aspects: textual content analysis and authority ranking. Regarding the textual content analysis, we propose a new method for query expansion via locally-trained embedding learning with concept hierarchy as guidance, which is particu","authors_text":"Aston Zhang, Huan Gui, Jiawei Han, Liyuan Liu, Qi Zhu","cross_cats":["cs.AI","cs.CL","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-03-09T03:28:36Z","title":"Expert Finding in Heterogeneous Bibliographic Networks with Locally-trained Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03370","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:7b118a2d850b84fca6f111437c47a6c555a4624e67c6ced3871109744151a624","target":"record","created_at":"2026-05-18T00:21:39Z","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":"18f06c4376c930703bb081d5ae9cb9a671721a21af3b57b9d94f42a21f4cd821","cross_cats_sorted":["cs.AI","cs.CL","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-03-09T03:28:36Z","title_canon_sha256":"abb81c9420db335292e3f8840c5336df8a6d41f8b0f3775aa6fc7a5f81128c9a"},"schema_version":"1.0","source":{"id":"1803.03370","kind":"arxiv","version":1}},"canonical_sha256":"631ca3f241ffe6c9274cfea0bbb84a4a796e45a4e5c8bfee8311139c9bbc8308","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"631ca3f241ffe6c9274cfea0bbb84a4a796e45a4e5c8bfee8311139c9bbc8308","first_computed_at":"2026-05-18T00:21:39.781309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:39.781309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JgfhWeAQEIudQdr1T62/Lz6iakZ8f/NSXOGQLOSuZRHTSBZsicoC+QEv/QXlU1SCTLadKatZm1JIjYjlmDUSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:39.781941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b118a2d850b84fca6f111437c47a6c555a4624e67c6ced3871109744151a624","sha256:bbbf8be85e9adf828e3cd40e9c9784f6d7a5425e6f4277cfb824833194acdbd0"],"state_sha256":"699ef84999ef828226496861f641c3ae1cc5e7b0f723aee149441b4dcdc91907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s33NWgYb/RXF+h7PlWIA/lMYXdxKdYQlB7zqPMEnWmnKLFBKzvR88+pBcM4FpU781mceK0VWgZV3FrlqzB/ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:19:01.361736Z","bundle_sha256":"8385969c2c4f5440d27fd8d6e743e367c76b958143f410e8e13d61d0bbcbf8ad"}}