{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KJHLXR5OOITK2XCW2MGLDYU2QI","short_pith_number":"pith:KJHLXR5O","canonical_record":{"source":{"id":"1712.09008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-25T05:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"83922d1638758cdcf85c3321b568cc67c15a63e8cd58ab7387fefeeed20c3fe5","abstract_canon_sha256":"77b6f1ff8ddd3a7006ee3ee3571b600f1aab446a54cfb7c907717e55b326b0c3"},"schema_version":"1.0"},"canonical_sha256":"524ebbc7ae7226ad5c56d30cb1e29a821696c80a63eef85db83b786cc27d2813","source":{"kind":"arxiv","id":"1712.09008","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09008","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09008v2","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09008","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"KJHLXR5OOITK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KJHLXR5OOITK2XCW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KJHLXR5O","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KJHLXR5OOITK2XCW2MGLDYU2QI","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-25T05:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"83922d1638758cdcf85c3321b568cc67c15a63e8cd58ab7387fefeeed20c3fe5","abstract_canon_sha256":"77b6f1ff8ddd3a7006ee3ee3571b600f1aab446a54cfb7c907717e55b326b0c3"},"schema_version":"1.0"},"canonical_sha256":"524ebbc7ae7226ad5c56d30cb1e29a821696c80a63eef85db83b786cc27d2813","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:09.899968Z","signature_b64":"lIiWlfNIdaSHvwZ036n/6ROOWnuy2F5S+OWy9ttFMZ7womAeGS6y66L2jd3iBc9VDxj4IC8PKEkKYCX2pEr9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"524ebbc7ae7226ad5c56d30cb1e29a821696c80a63eef85db83b786cc27d2813","last_reissued_at":"2026-05-18T00:15:09.899357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:09.899357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09008","source_version":2,"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:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xf7dbh9nuqA8Dut1WI4CBRm+xLuAnjJo+zKNrTOh65J7San0dDRil2WsFg3JH5V8yZON2msHkfVbMDQUWjIFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:00:56.229508Z"},"content_sha256":"a1b2e74218a2003bc5cd98d4696bb57b8814dbd3a7c09b5d8463e0bf5078c7dd","schema_version":"1.0","event_id":"sha256:a1b2e74218a2003bc5cd98d4696bb57b8814dbd3a7c09b5d8463e0bf5078c7dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KJHLXR5OOITK2XCW2MGLDYU2QI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrent Meta-Structure for Robust Similarity Measure in Heterogeneous Information Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Heli Sun, Jianbin Huang, Yizhou Sun, Yu Zhou","submitted_at":"2017-12-25T05:07:01Z","abstract_excerpt":"Similarity measure as a fundamental task in heterogeneous information network analysis has been applied to many areas, e.g., product recommendation, clustering and Web search. Most of the existing metrics depend on the meta-path or meta-structure specified by users in advance. These metrics are thus sensitive to the pre-specified meta-path or meta-structure. In this paper, a novel similarity measure in heterogeneous information networks, called Recurrent Meta-Structure-based Similarity (RMSS), is proposed. The recurrent meta-structure as a schematic structure in heterogeneous information netwo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09008","kind":"arxiv","version":2},"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:15:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrKnQOo+DoCXkLaDTLrSBvF/GoNKVp2ksMdG+QbpxhRJuhPRmMBE8VM957+ZrrWua0U7h+6aiD2Omv8jmSIfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:00:56.229862Z"},"content_sha256":"8e579c8746e560cff54fb099ca1aac39478e1ab2e23ea030560f7ad528e5ccbe","schema_version":"1.0","event_id":"sha256:8e579c8746e560cff54fb099ca1aac39478e1ab2e23ea030560f7ad528e5ccbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJHLXR5OOITK2XCW2MGLDYU2QI/bundle.json","state_url":"https://pith.science/pith/KJHLXR5OOITK2XCW2MGLDYU2QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJHLXR5OOITK2XCW2MGLDYU2QI/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-11T09:00:56Z","links":{"resolver":"https://pith.science/pith/KJHLXR5OOITK2XCW2MGLDYU2QI","bundle":"https://pith.science/pith/KJHLXR5OOITK2XCW2MGLDYU2QI/bundle.json","state":"https://pith.science/pith/KJHLXR5OOITK2XCW2MGLDYU2QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJHLXR5OOITK2XCW2MGLDYU2QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KJHLXR5OOITK2XCW2MGLDYU2QI","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":"77b6f1ff8ddd3a7006ee3ee3571b600f1aab446a54cfb7c907717e55b326b0c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-25T05:07:01Z","title_canon_sha256":"83922d1638758cdcf85c3321b568cc67c15a63e8cd58ab7387fefeeed20c3fe5"},"schema_version":"1.0","source":{"id":"1712.09008","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09008","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09008v2","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09008","created_at":"2026-05-18T00:15:09Z"},{"alias_kind":"pith_short_12","alias_value":"KJHLXR5OOITK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KJHLXR5OOITK2XCW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KJHLXR5O","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:8e579c8746e560cff54fb099ca1aac39478e1ab2e23ea030560f7ad528e5ccbe","target":"graph","created_at":"2026-05-18T00:15:09Z","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":"Similarity measure as a fundamental task in heterogeneous information network analysis has been applied to many areas, e.g., product recommendation, clustering and Web search. Most of the existing metrics depend on the meta-path or meta-structure specified by users in advance. These metrics are thus sensitive to the pre-specified meta-path or meta-structure. In this paper, a novel similarity measure in heterogeneous information networks, called Recurrent Meta-Structure-based Similarity (RMSS), is proposed. The recurrent meta-structure as a schematic structure in heterogeneous information netwo","authors_text":"Heli Sun, Jianbin Huang, Yizhou Sun, Yu Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-25T05:07:01Z","title":"Recurrent Meta-Structure for Robust Similarity Measure in Heterogeneous Information Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09008","kind":"arxiv","version":2},"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:a1b2e74218a2003bc5cd98d4696bb57b8814dbd3a7c09b5d8463e0bf5078c7dd","target":"record","created_at":"2026-05-18T00:15:09Z","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":"77b6f1ff8ddd3a7006ee3ee3571b600f1aab446a54cfb7c907717e55b326b0c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-12-25T05:07:01Z","title_canon_sha256":"83922d1638758cdcf85c3321b568cc67c15a63e8cd58ab7387fefeeed20c3fe5"},"schema_version":"1.0","source":{"id":"1712.09008","kind":"arxiv","version":2}},"canonical_sha256":"524ebbc7ae7226ad5c56d30cb1e29a821696c80a63eef85db83b786cc27d2813","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"524ebbc7ae7226ad5c56d30cb1e29a821696c80a63eef85db83b786cc27d2813","first_computed_at":"2026-05-18T00:15:09.899357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:09.899357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lIiWlfNIdaSHvwZ036n/6ROOWnuy2F5S+OWy9ttFMZ7womAeGS6y66L2jd3iBc9VDxj4IC8PKEkKYCX2pEr9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:09.899968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09008","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1b2e74218a2003bc5cd98d4696bb57b8814dbd3a7c09b5d8463e0bf5078c7dd","sha256:8e579c8746e560cff54fb099ca1aac39478e1ab2e23ea030560f7ad528e5ccbe"],"state_sha256":"1188300cf2c725c5dbdf375967389d5628686b1694af97f93308a6d272388361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62VqCgaHqRC90Ys050SdkchlgZc5c2/aPBPobxWlGK6fAqPwlZmrwAXnjQ5cwgGn9oi0RSCh7N4qsyYvxdTeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:00:56.231817Z","bundle_sha256":"2c09b30249aa11f9e1f59faad39efc2f7b503a5868a9fd519c2eb341cc96bcca"}}