{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:46MYNXNH7FHJSKDQP3T56CFT2V","short_pith_number":"pith:46MYNXNH","schema_version":"1.0","canonical_sha256":"e79986dda7f94e9928707ee7df08b3d5511e1f37eb8e06439d6b026399a66039","source":{"kind":"arxiv","id":"1602.02358","version":3},"attestation_state":"computed","paper":{"title":"NED: An Inter-Graph Node Metric Based On Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.DB","authors_text":"George Kollios, Haohan Zhu, Xianrui Meng","submitted_at":"2016-02-07T11:00:03Z","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"},"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":"1602.02358","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-07T11:00:03Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"3ef02fdf7f341cc0b60b42c829743972b4fdfbecc5ca9af3024564dabf8f6d9e","abstract_canon_sha256":"1a72927139ac1414d6724a6a1c6c93ff7731c8cc965b81093e1231ad52a32761"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:38.164569Z","signature_b64":"65sBC5s88HWRlVbCUEJwvp9Nk/CwWwsyxYj1KjNU85Vbwpgb2iW/BnuP/EpS4nRmHjgcWA3zdcNXrZrTDBCTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e79986dda7f94e9928707ee7df08b3d5511e1f37eb8e06439d6b026399a66039","last_reissued_at":"2026-05-18T01:20:38.164038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:38.164038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NED: An Inter-Graph Node Metric Based On Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.DB","authors_text":"George Kollios, Haohan Zhu, Xianrui Meng","submitted_at":"2016-02-07T11:00:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02358","kind":"arxiv","version":3},"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":"1602.02358","created_at":"2026-05-18T01:20:38.164113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02358v3","created_at":"2026-05-18T01:20:38.164113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02358","created_at":"2026-05-18T01:20:38.164113+00:00"},{"alias_kind":"pith_short_12","alias_value":"46MYNXNH7FHJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"46MYNXNH7FHJSKDQ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"46MYNXNH","created_at":"2026-05-18T12:29:58.707656+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/46MYNXNH7FHJSKDQP3T56CFT2V","json":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V.json","graph_json":"https://pith.science/api/pith-number/46MYNXNH7FHJSKDQP3T56CFT2V/graph.json","events_json":"https://pith.science/api/pith-number/46MYNXNH7FHJSKDQP3T56CFT2V/events.json","paper":"https://pith.science/paper/46MYNXNH"},"agent_actions":{"view_html":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V","download_json":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V.json","view_paper":"https://pith.science/paper/46MYNXNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02358&json=true","fetch_graph":"https://pith.science/api/pith-number/46MYNXNH7FHJSKDQP3T56CFT2V/graph.json","fetch_events":"https://pith.science/api/pith-number/46MYNXNH7FHJSKDQP3T56CFT2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V/action/storage_attestation","attest_author":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V/action/author_attestation","sign_citation":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V/action/citation_signature","submit_replication":"https://pith.science/pith/46MYNXNH7FHJSKDQP3T56CFT2V/action/replication_record"}},"created_at":"2026-05-18T01:20:38.164113+00:00","updated_at":"2026-05-18T01:20:38.164113+00:00"}