{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NK25A6WL6RVK7O64OV3ESPJDLT","short_pith_number":"pith:NK25A6WL","schema_version":"1.0","canonical_sha256":"6ab5d07acbf46aafbbdc7576493d235cfd7133737dfe83a446628714de92642b","source":{"kind":"arxiv","id":"1309.7393","version":1},"attestation_state":"computed","paper":{"title":"HeteSim: A General Framework for Relevance Measure in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Bin Wu, Chuan Shi, Philip S. Yu, Xiangnan Kong, Yue Huang","submitted_at":"2013-09-28T00:31:30Z","abstract_excerpt":"Similarity search is an important function in many applications, which usually focuses on measuring the similarity between objects with the same type. However, in many scenarios, we need to measure the relatedness between objects with different types. With the surge of study on heterogeneous networks, the relevance measure on objects with different types becomes increasingly important. In this paper, we study the relevance search problem in heterogeneous networks, where the task is to measure the relatedness of heterogeneous objects (including objects with the same type or different types). A "},"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":"1309.7393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2013-09-28T00:31:30Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5c6ef4fb0d6f8e07f5af485daa36654d7a81f2436600f5ea7728df6f30a71c21","abstract_canon_sha256":"0348c2e682b345bf1cea68db9096b1354d43a639feabc38b2bccdcee217b465e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:58.849362Z","signature_b64":"nhmzBwoypsZ6RH0CLfF6TUZqOU9/+2AmhGqSTT9PeNtZRG/q98tZ9BtafHeRFlaLZPZqr+H852H6dKkeaJzMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ab5d07acbf46aafbbdc7576493d235cfd7133737dfe83a446628714de92642b","last_reissued_at":"2026-05-18T03:11:58.848721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:58.848721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HeteSim: A General Framework for Relevance Measure in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Bin Wu, Chuan Shi, Philip S. Yu, Xiangnan Kong, Yue Huang","submitted_at":"2013-09-28T00:31:30Z","abstract_excerpt":"Similarity search is an important function in many applications, which usually focuses on measuring the similarity between objects with the same type. However, in many scenarios, we need to measure the relatedness between objects with different types. With the surge of study on heterogeneous networks, the relevance measure on objects with different types becomes increasingly important. In this paper, we study the relevance search problem in heterogeneous networks, where the task is to measure the relatedness of heterogeneous objects (including objects with the same type or different types). A "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7393","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":"1309.7393","created_at":"2026-05-18T03:11:58.848817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7393v1","created_at":"2026-05-18T03:11:58.848817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7393","created_at":"2026-05-18T03:11:58.848817+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK25A6WL6RVK","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK25A6WL6RVK7O64","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK25A6WL","created_at":"2026-05-18T12:27:52.871228+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/NK25A6WL6RVK7O64OV3ESPJDLT","json":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT.json","graph_json":"https://pith.science/api/pith-number/NK25A6WL6RVK7O64OV3ESPJDLT/graph.json","events_json":"https://pith.science/api/pith-number/NK25A6WL6RVK7O64OV3ESPJDLT/events.json","paper":"https://pith.science/paper/NK25A6WL"},"agent_actions":{"view_html":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT","download_json":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT.json","view_paper":"https://pith.science/paper/NK25A6WL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7393&json=true","fetch_graph":"https://pith.science/api/pith-number/NK25A6WL6RVK7O64OV3ESPJDLT/graph.json","fetch_events":"https://pith.science/api/pith-number/NK25A6WL6RVK7O64OV3ESPJDLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT/action/storage_attestation","attest_author":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT/action/author_attestation","sign_citation":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT/action/citation_signature","submit_replication":"https://pith.science/pith/NK25A6WL6RVK7O64OV3ESPJDLT/action/replication_record"}},"created_at":"2026-05-18T03:11:58.848817+00:00","updated_at":"2026-05-18T03:11:58.848817+00:00"}