{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3FB7ZI2VUV5QVISZY5H6ZLHW5I","short_pith_number":"pith:3FB7ZI2V","schema_version":"1.0","canonical_sha256":"d943fca355a57b0aa259c74fecacf6ea3749bda7be0e7e50de93dc6f5cd4a7f5","source":{"kind":"arxiv","id":"1307.3626","version":1},"attestation_state":"computed","paper":{"title":"Learning an Integrated Distance Metric for Comparing Structure of Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ali Movaghar, Jafar Habibi, Sadegh Aliakbary, Sadegh Motallebi","submitted_at":"2013-07-13T07:53:19Z","abstract_excerpt":"Graph comparison plays a major role in many network applications. We often need a similarity metric for comparing networks according to their structural properties. Various network features - such as degree distribution and clustering coefficient - provide measurements for comparing networks from different points of view, but a global and integrated distance metric is still missing. In this paper, we employ distance metric learning algorithms in order to construct an integrated distance metric for comparing structural properties of complex networks. According to natural witnesses of network si"},"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":"1307.3626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-07-13T07:53:19Z","cross_cats_sorted":["cs.AI","physics.soc-ph"],"title_canon_sha256":"da71f335eb67dba75777787dc32b88926796158b3eca9f53360fa5ac4721cb4b","abstract_canon_sha256":"c9e3b9d8f1b321e6e8af4831123c3ce967be6a7d750839752d3289214221141b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:28.354658Z","signature_b64":"n/deavjMmNFBOMQdAyEK3Jj99tJlXRFw01tH7CbH55tIADa+SlX5E8lOXiVCC47sbk3Zymx4E5MaB6mmzz66AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d943fca355a57b0aa259c74fecacf6ea3749bda7be0e7e50de93dc6f5cd4a7f5","last_reissued_at":"2026-05-18T03:18:28.353926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:28.353926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning an Integrated Distance Metric for Comparing Structure of Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ali Movaghar, Jafar Habibi, Sadegh Aliakbary, Sadegh Motallebi","submitted_at":"2013-07-13T07:53:19Z","abstract_excerpt":"Graph comparison plays a major role in many network applications. We often need a similarity metric for comparing networks according to their structural properties. Various network features - such as degree distribution and clustering coefficient - provide measurements for comparing networks from different points of view, but a global and integrated distance metric is still missing. In this paper, we employ distance metric learning algorithms in order to construct an integrated distance metric for comparing structural properties of complex networks. According to natural witnesses of network si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3626","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":"1307.3626","created_at":"2026-05-18T03:18:28.354035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3626v1","created_at":"2026-05-18T03:18:28.354035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3626","created_at":"2026-05-18T03:18:28.354035+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FB7ZI2VUV5Q","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FB7ZI2VUV5QVISZ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FB7ZI2V","created_at":"2026-05-18T12:27:32.513160+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/3FB7ZI2VUV5QVISZY5H6ZLHW5I","json":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I.json","graph_json":"https://pith.science/api/pith-number/3FB7ZI2VUV5QVISZY5H6ZLHW5I/graph.json","events_json":"https://pith.science/api/pith-number/3FB7ZI2VUV5QVISZY5H6ZLHW5I/events.json","paper":"https://pith.science/paper/3FB7ZI2V"},"agent_actions":{"view_html":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I","download_json":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I.json","view_paper":"https://pith.science/paper/3FB7ZI2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3626&json=true","fetch_graph":"https://pith.science/api/pith-number/3FB7ZI2VUV5QVISZY5H6ZLHW5I/graph.json","fetch_events":"https://pith.science/api/pith-number/3FB7ZI2VUV5QVISZY5H6ZLHW5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I/action/storage_attestation","attest_author":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I/action/author_attestation","sign_citation":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I/action/citation_signature","submit_replication":"https://pith.science/pith/3FB7ZI2VUV5QVISZY5H6ZLHW5I/action/replication_record"}},"created_at":"2026-05-18T03:18:28.354035+00:00","updated_at":"2026-05-18T03:18:28.354035+00:00"}