{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:46MYNXNH7FHJSKDQP3T56CFT2V","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":"1a72927139ac1414d6724a6a1c6c93ff7731c8cc965b81093e1231ad52a32761","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-07T11:00:03Z","title_canon_sha256":"3ef02fdf7f341cc0b60b42c829743972b4fdfbecc5ca9af3024564dabf8f6d9e"},"schema_version":"1.0","source":{"id":"1602.02358","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02358","created_at":"2026-05-18T01:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02358v3","created_at":"2026-05-18T01:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02358","created_at":"2026-05-18T01:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"46MYNXNH7FHJ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"46MYNXNH7FHJSKDQ","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"46MYNXNH","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:32a06b767e30f66446dfd7814b880483b08eda08d44c39541f16ede3f0cf8aea","target":"graph","created_at":"2026-05-18T01:20:38Z","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":"Node similarity is a fundamental problem in graph analytics. However, node similarity between nodes in different graphs (inter-graph nodes) has not received a lot of attention yet. The inter-graph node similarity is important in learning a new graph based on the knowledge of an existing graph (transfer learning on graphs) and has applications in biological, communication, and social networks. In this paper, we propose a novel distance function for measuring inter-graph node similarity with edit distance, called NED. In NED, two nodes are compared according to their local neighborhood structure","authors_text":"George Kollios, Haohan Zhu, Xianrui Meng","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-07T11:00:03Z","title":"NED: An Inter-Graph Node Metric Based On Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02358","kind":"arxiv","version":3},"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:521d867c16077aeef96565a55ac3797ca10205ca3ef3976a79a25ebe074d3497","target":"record","created_at":"2026-05-18T01:20:38Z","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":"1a72927139ac1414d6724a6a1c6c93ff7731c8cc965b81093e1231ad52a32761","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-07T11:00:03Z","title_canon_sha256":"3ef02fdf7f341cc0b60b42c829743972b4fdfbecc5ca9af3024564dabf8f6d9e"},"schema_version":"1.0","source":{"id":"1602.02358","kind":"arxiv","version":3}},"canonical_sha256":"e79986dda7f94e9928707ee7df08b3d5511e1f37eb8e06439d6b026399a66039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e79986dda7f94e9928707ee7df08b3d5511e1f37eb8e06439d6b026399a66039","first_computed_at":"2026-05-18T01:20:38.164038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:38.164038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"65sBC5s88HWRlVbCUEJwvp9Nk/CwWwsyxYj1KjNU85Vbwpgb2iW/BnuP/EpS4nRmHjgcWA3zdcNXrZrTDBCTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:38.164569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02358","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:521d867c16077aeef96565a55ac3797ca10205ca3ef3976a79a25ebe074d3497","sha256:32a06b767e30f66446dfd7814b880483b08eda08d44c39541f16ede3f0cf8aea"],"state_sha256":"0b217e4f202dcec78bdced4e69a4906e1b272a50f85f975a62b2ff360bcc2489"}