{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:432AEHYN2HBVQYB2CK2P5PXFHQ","short_pith_number":"pith:432AEHYN","canonical_record":{"source":{"id":"1403.7315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-03-28T09:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"78c17b99751e950ed72e305ca1d551dae0ba8793d0cdc7ffaebe23a8321dde42","abstract_canon_sha256":"e97e20c06881b0b75afdd321b81cb90075f6cab13773b8212a587d80c1045daf"},"schema_version":"1.0"},"canonical_sha256":"e6f4021f0dd1c358603a12b4febee53c21d8f9b384614e7b1809e967b2edf5de","source":{"kind":"arxiv","id":"1403.7315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7315","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7315v1","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7315","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"432AEHYN2HBV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"432AEHYN2HBVQYB2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"432AEHYN","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:432AEHYN2HBVQYB2CK2P5PXFHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1403.7315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-03-28T09:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"78c17b99751e950ed72e305ca1d551dae0ba8793d0cdc7ffaebe23a8321dde42","abstract_canon_sha256":"e97e20c06881b0b75afdd321b81cb90075f6cab13773b8212a587d80c1045daf"},"schema_version":"1.0"},"canonical_sha256":"e6f4021f0dd1c358603a12b4febee53c21d8f9b384614e7b1809e967b2edf5de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:19.938035Z","signature_b64":"JELNeJ7w9FE/OEuYZa26+FujZgc77OCuQZ+jwAZptTv1JD1FebTfYrk5kPnEMBM4bK5cqIM968G38BfcRo/rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6f4021f0dd1c358603a12b4febee53c21d8f9b384614e7b1809e967b2edf5de","last_reissued_at":"2026-05-18T02:55:19.937564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:19.937564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.7315","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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ta3dDXxE51mRxyMwRhCxR2q7faZbmJL4tUdhLMhNd4ialQ0GVmn70OLM6Fw1ASJViw6K+J6mo+WBEzEyvujNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:28:18.294849Z"},"content_sha256":"7e7164929881edc166775ed4738f7a1029882755cc0f9c04b7d925c1645a1c3b","schema_version":"1.0","event_id":"sha256:7e7164929881edc166775ed4738f7a1029882755cc0f9c04b7d925c1645a1c3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:432AEHYN2HBVQYB2CK2P5PXFHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HRank: A Path based Ranking Framework in Heterogeneous Information Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuan Shi, Philip S. Yu, Qing Chen, Yitong Li","submitted_at":"2014-03-28T09:31:43Z","abstract_excerpt":"Recently, there is a surge of interests on heterogeneous information network analysis. As a newly emerging network model, heterogeneous information networks have many unique features (e.g., complex structure and rich semantics) and a number of interesting data mining tasks have been exploited in this kind of networks, such as similarity measure, clustering, and classification. Although evaluating the importance of objects has been well studied in homogeneous networks, it is not yet exploited in heterogeneous networks. In this paper, we study the ranking problem in heterogeneous networks and pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7315","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:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsCU1E8h+h34DTsL/C/cHTwySdGgRYCDLkXR6D375Xhu8G2bisp/2XpYPkAV2/WzgbahJsI8S0OY5aStEbI/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T11:28:18.295612Z"},"content_sha256":"b6d4bea6aae43696139715fc67a6aefcc38a79ed5ce63d70c1199cb5e669abd3","schema_version":"1.0","event_id":"sha256:b6d4bea6aae43696139715fc67a6aefcc38a79ed5ce63d70c1199cb5e669abd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/432AEHYN2HBVQYB2CK2P5PXFHQ/bundle.json","state_url":"https://pith.science/pith/432AEHYN2HBVQYB2CK2P5PXFHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/432AEHYN2HBVQYB2CK2P5PXFHQ/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-05-23T11:28:18Z","links":{"resolver":"https://pith.science/pith/432AEHYN2HBVQYB2CK2P5PXFHQ","bundle":"https://pith.science/pith/432AEHYN2HBVQYB2CK2P5PXFHQ/bundle.json","state":"https://pith.science/pith/432AEHYN2HBVQYB2CK2P5PXFHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/432AEHYN2HBVQYB2CK2P5PXFHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:432AEHYN2HBVQYB2CK2P5PXFHQ","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":"e97e20c06881b0b75afdd321b81cb90075f6cab13773b8212a587d80c1045daf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-03-28T09:31:43Z","title_canon_sha256":"78c17b99751e950ed72e305ca1d551dae0ba8793d0cdc7ffaebe23a8321dde42"},"schema_version":"1.0","source":{"id":"1403.7315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.7315","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"1403.7315v1","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7315","created_at":"2026-05-18T02:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"432AEHYN2HBV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"432AEHYN2HBVQYB2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"432AEHYN","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:b6d4bea6aae43696139715fc67a6aefcc38a79ed5ce63d70c1199cb5e669abd3","target":"graph","created_at":"2026-05-18T02:55:19Z","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":"Recently, there is a surge of interests on heterogeneous information network analysis. As a newly emerging network model, heterogeneous information networks have many unique features (e.g., complex structure and rich semantics) and a number of interesting data mining tasks have been exploited in this kind of networks, such as similarity measure, clustering, and classification. Although evaluating the importance of objects has been well studied in homogeneous networks, it is not yet exploited in heterogeneous networks. In this paper, we study the ranking problem in heterogeneous networks and pr","authors_text":"Chuan Shi, Philip S. Yu, Qing Chen, Yitong Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-03-28T09:31:43Z","title":"HRank: A Path based Ranking Framework in Heterogeneous Information Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7315","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:7e7164929881edc166775ed4738f7a1029882755cc0f9c04b7d925c1645a1c3b","target":"record","created_at":"2026-05-18T02:55:19Z","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":"e97e20c06881b0b75afdd321b81cb90075f6cab13773b8212a587d80c1045daf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2014-03-28T09:31:43Z","title_canon_sha256":"78c17b99751e950ed72e305ca1d551dae0ba8793d0cdc7ffaebe23a8321dde42"},"schema_version":"1.0","source":{"id":"1403.7315","kind":"arxiv","version":1}},"canonical_sha256":"e6f4021f0dd1c358603a12b4febee53c21d8f9b384614e7b1809e967b2edf5de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6f4021f0dd1c358603a12b4febee53c21d8f9b384614e7b1809e967b2edf5de","first_computed_at":"2026-05-18T02:55:19.937564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:19.937564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JELNeJ7w9FE/OEuYZa26+FujZgc77OCuQZ+jwAZptTv1JD1FebTfYrk5kPnEMBM4bK5cqIM968G38BfcRo/rCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:19.938035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.7315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e7164929881edc166775ed4738f7a1029882755cc0f9c04b7d925c1645a1c3b","sha256:b6d4bea6aae43696139715fc67a6aefcc38a79ed5ce63d70c1199cb5e669abd3"],"state_sha256":"a44916be92a0dec560819e5db306918e0def7694eee9e2ef18d3caee047b2e30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hd1W7b6w5GxthrtfX7qRibBxj1KqgSQxs/FyPwE8L48biG8r9+Ao6P2P4tvr86TdOcnXOO0TXyQzxeqoJpcBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T11:28:18.299939Z","bundle_sha256":"a2a38ea4d9eee822f3c85f95337fa22b55e2d8cf5ba838341cbb71ee9962b10f"}}