{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HOL2QF5IRBJ35BF372SOFU74TY","short_pith_number":"pith:HOL2QF5I","schema_version":"1.0","canonical_sha256":"3b97a817a88853be84bbfea4e2d3fc9e28eb9ed26f11c37ff5f62c4a1da15311","source":{"kind":"arxiv","id":"1502.06818","version":1},"attestation_state":"computed","paper":{"title":"Tensor SimRank for Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ben Usman, Ivan Oseledets","submitted_at":"2015-02-24T14:10:04Z","abstract_excerpt":"We propose a generalization of SimRank similarity measure for heterogeneous information networks. Given the information network, the intraclass similarity score s(a, b) is high if the set of objects that are related with a and the set of objects that are related with b are pair-wise similar according to all imposed relations."},"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":"1502.06818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-24T14:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"72952574ab078c29c1dc2f33c75a599e274875e47bfca955de4971e1e23fbb64","abstract_canon_sha256":"d4d3370a3ae9fa3b37d6ec963032975d72dd7187cd183ea637750b68a03fafe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:24.634610Z","signature_b64":"hHVgyCnZRycN93CLKdiPtCNhOpSNaSlZzx0+LoBIFqMJl7ALIuGVrhfMcoICqf/OC3ghK7mW/KoNQSWxqof1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b97a817a88853be84bbfea4e2d3fc9e28eb9ed26f11c37ff5f62c4a1da15311","last_reissued_at":"2026-05-18T02:26:24.633887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:24.633887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor SimRank for Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ben Usman, Ivan Oseledets","submitted_at":"2015-02-24T14:10:04Z","abstract_excerpt":"We propose a generalization of SimRank similarity measure for heterogeneous information networks. Given the information network, the intraclass similarity score s(a, b) is high if the set of objects that are related with a and the set of objects that are related with b are pair-wise similar according to all imposed relations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06818","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":"1502.06818","created_at":"2026-05-18T02:26:24.633999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06818v1","created_at":"2026-05-18T02:26:24.633999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06818","created_at":"2026-05-18T02:26:24.633999+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOL2QF5IRBJ3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOL2QF5IRBJ35BF3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOL2QF5I","created_at":"2026-05-18T12:29:25.134429+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/HOL2QF5IRBJ35BF372SOFU74TY","json":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY.json","graph_json":"https://pith.science/api/pith-number/HOL2QF5IRBJ35BF372SOFU74TY/graph.json","events_json":"https://pith.science/api/pith-number/HOL2QF5IRBJ35BF372SOFU74TY/events.json","paper":"https://pith.science/paper/HOL2QF5I"},"agent_actions":{"view_html":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY","download_json":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY.json","view_paper":"https://pith.science/paper/HOL2QF5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06818&json=true","fetch_graph":"https://pith.science/api/pith-number/HOL2QF5IRBJ35BF372SOFU74TY/graph.json","fetch_events":"https://pith.science/api/pith-number/HOL2QF5IRBJ35BF372SOFU74TY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY/action/storage_attestation","attest_author":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY/action/author_attestation","sign_citation":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY/action/citation_signature","submit_replication":"https://pith.science/pith/HOL2QF5IRBJ35BF372SOFU74TY/action/replication_record"}},"created_at":"2026-05-18T02:26:24.633999+00:00","updated_at":"2026-05-18T02:26:24.633999+00:00"}