{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YM3SQPP7P3JCB7BQUHWTHHM2XA","short_pith_number":"pith:YM3SQPP7","schema_version":"1.0","canonical_sha256":"c337283dff7ed220fc30a1ed339d9ab827a62af8ee31e2b23c0d06585d9ba3ea","source":{"kind":"arxiv","id":"1812.05457","version":1},"attestation_state":"computed","paper":{"title":"Graph Comparison via the Non-backtracking Spectrum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO","physics.data-an"],"primary_cat":"cs.SI","authors_text":"Andrew Mellor, Angelica Grusovin","submitted_at":"2018-12-13T14:39:35Z","abstract_excerpt":"The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however often these are not metrics (rendering standard data-mining techniques infeasible), or are computationally infeasible for large graphs. In this work we define a new metric based on the spectrum of the non-backtracking graph operator and show that it can not only be used to compare graphs generated through different mechanisms, but can reliably compare graphs of"},"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":"1812.05457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-13T14:39:35Z","cross_cats_sorted":["nlin.AO","physics.data-an"],"title_canon_sha256":"0608ef897de6609820f729914da469a474455be79486a8ad5f590b77b0879a59","abstract_canon_sha256":"e0338efb22ae4987ccbe42cd260ed1b888157fd5660f910904f054dcf3b09019"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:58.150832Z","signature_b64":"ihZ4IYlQ/GYiuf/uXeuLbQL+lyHkdbJhFSczim7nnqnqMrGVJT6FrvcpNrr8WhOlGYuYO4zEPhPwxv4NVVbCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c337283dff7ed220fc30a1ed339d9ab827a62af8ee31e2b23c0d06585d9ba3ea","last_reissued_at":"2026-05-17T23:44:58.150190Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:58.150190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Comparison via the Non-backtracking Spectrum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO","physics.data-an"],"primary_cat":"cs.SI","authors_text":"Andrew Mellor, Angelica Grusovin","submitted_at":"2018-12-13T14:39:35Z","abstract_excerpt":"The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however often these are not metrics (rendering standard data-mining techniques infeasible), or are computationally infeasible for large graphs. In this work we define a new metric based on the spectrum of the non-backtracking graph operator and show that it can not only be used to compare graphs generated through different mechanisms, but can reliably compare graphs of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05457","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":"1812.05457","created_at":"2026-05-17T23:44:58.150265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05457v1","created_at":"2026-05-17T23:44:58.150265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05457","created_at":"2026-05-17T23:44:58.150265+00:00"},{"alias_kind":"pith_short_12","alias_value":"YM3SQPP7P3JC","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YM3SQPP7P3JCB7BQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YM3SQPP7","created_at":"2026-05-18T12:33:04.347982+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/YM3SQPP7P3JCB7BQUHWTHHM2XA","json":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA.json","graph_json":"https://pith.science/api/pith-number/YM3SQPP7P3JCB7BQUHWTHHM2XA/graph.json","events_json":"https://pith.science/api/pith-number/YM3SQPP7P3JCB7BQUHWTHHM2XA/events.json","paper":"https://pith.science/paper/YM3SQPP7"},"agent_actions":{"view_html":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA","download_json":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA.json","view_paper":"https://pith.science/paper/YM3SQPP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05457&json=true","fetch_graph":"https://pith.science/api/pith-number/YM3SQPP7P3JCB7BQUHWTHHM2XA/graph.json","fetch_events":"https://pith.science/api/pith-number/YM3SQPP7P3JCB7BQUHWTHHM2XA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA/action/storage_attestation","attest_author":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA/action/author_attestation","sign_citation":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA/action/citation_signature","submit_replication":"https://pith.science/pith/YM3SQPP7P3JCB7BQUHWTHHM2XA/action/replication_record"}},"created_at":"2026-05-17T23:44:58.150265+00:00","updated_at":"2026-05-17T23:44:58.150265+00:00"}