{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XG5VODU252RTOFPN4UJPKAUXPX","short_pith_number":"pith:XG5VODU2","schema_version":"1.0","canonical_sha256":"b9bb570e9aeea33715ede512f502977df6039ed736c6ddc73e8864cc738e8c9f","source":{"kind":"arxiv","id":"1703.06231","version":1},"attestation_state":"computed","paper":{"title":"Network Comparison: Embeddings and Interiors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alejandro Ribeiro, Weiyu Huang","submitted_at":"2017-03-18T01:43:17Z","abstract_excerpt":"This paper presents methods to compare networks where relationships between pairs of nodes in a given network are defined. We define such network distance by searching for the optimal method to embed one network into another network, prove that such distance is a valid metric in the space of networks modulo permutation isomorphisms, and examine its relationship with other network metrics. The network distance defined can be approximated via multi-dimensional scaling, however, the lack of structure in networks results in poor approximations. To alleviate such problem, we consider methods to def"},"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":"1703.06231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-18T01:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"031c12f4071f5c5732f2a79f58d128d3fd2bf387865f2ff53bf8a6ffbdaf1cad","abstract_canon_sha256":"f49ba03dfed78951bd004423e24281575e1a2eb48f0deb1bb7156dd1e1c31648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:45.873470Z","signature_b64":"BzZcK+mxzHmXcSPowswNCo4uI0LVosN1CXseptOGbBKkyIxwL+BkOW2CGPzrTAZ12U65UpLX8AQdEVMZJ6MHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9bb570e9aeea33715ede512f502977df6039ed736c6ddc73e8864cc738e8c9f","last_reissued_at":"2026-05-18T00:23:45.873022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:45.873022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Comparison: Embeddings and Interiors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alejandro Ribeiro, Weiyu Huang","submitted_at":"2017-03-18T01:43:17Z","abstract_excerpt":"This paper presents methods to compare networks where relationships between pairs of nodes in a given network are defined. We define such network distance by searching for the optimal method to embed one network into another network, prove that such distance is a valid metric in the space of networks modulo permutation isomorphisms, and examine its relationship with other network metrics. The network distance defined can be approximated via multi-dimensional scaling, however, the lack of structure in networks results in poor approximations. To alleviate such problem, we consider methods to def"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06231","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":"1703.06231","created_at":"2026-05-18T00:23:45.873089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06231v1","created_at":"2026-05-18T00:23:45.873089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06231","created_at":"2026-05-18T00:23:45.873089+00:00"},{"alias_kind":"pith_short_12","alias_value":"XG5VODU252RT","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XG5VODU252RTOFPN","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XG5VODU2","created_at":"2026-05-18T12:31:53.515858+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/XG5VODU252RTOFPN4UJPKAUXPX","json":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX.json","graph_json":"https://pith.science/api/pith-number/XG5VODU252RTOFPN4UJPKAUXPX/graph.json","events_json":"https://pith.science/api/pith-number/XG5VODU252RTOFPN4UJPKAUXPX/events.json","paper":"https://pith.science/paper/XG5VODU2"},"agent_actions":{"view_html":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX","download_json":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX.json","view_paper":"https://pith.science/paper/XG5VODU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06231&json=true","fetch_graph":"https://pith.science/api/pith-number/XG5VODU252RTOFPN4UJPKAUXPX/graph.json","fetch_events":"https://pith.science/api/pith-number/XG5VODU252RTOFPN4UJPKAUXPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX/action/storage_attestation","attest_author":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX/action/author_attestation","sign_citation":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX/action/citation_signature","submit_replication":"https://pith.science/pith/XG5VODU252RTOFPN4UJPKAUXPX/action/replication_record"}},"created_at":"2026-05-18T00:23:45.873089+00:00","updated_at":"2026-05-18T00:23:45.873089+00:00"}