{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6KN5KHG2FZNGKKMTGRMDJ2LSR2","short_pith_number":"pith:6KN5KHG2","schema_version":"1.0","canonical_sha256":"f29bd51cda2e5a652993345834e9728eb2d42978a165e0c6d3931123fff31332","source":{"kind":"arxiv","id":"2011.09385","version":1},"attestation_state":"computed","paper":{"title":"Spectral properties of the non-backtracking matrix of a graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory Glover, Mark Kempton","submitted_at":"2020-11-18T16:34:51Z","abstract_excerpt":"We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the eigenvalues of the non-backtracking matrix in terms of eigenvalues of the adjacency matrix and use this to upper-bound the spectral radius of the non-backtracking matrix and to give a lower bound on the spectrum. We also investigate properties of a graph that can be determined by the spectrum. Specifically, we prove that the number of components, the number"},"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":"2011.09385","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-18T16:34:51Z","cross_cats_sorted":[],"title_canon_sha256":"f8ade57848e386b771939e4c2e7496b365a0ba583ca7b635a615bd33a47feccc","abstract_canon_sha256":"a7b4a62615916750f9c9c135cf2f4523fb2876345c6c69056e62d114828900b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:43.534606Z","signature_b64":"51Fsjsnyg9x7H+7rBo/wNaJ09NwvHbxvX1xdLziQBubRDou8aZ0e9XDOkkvxB/aaeQIwjR6zD71w592GLOgIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f29bd51cda2e5a652993345834e9728eb2d42978a165e0c6d3931123fff31332","last_reissued_at":"2026-07-05T01:52:43.534237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:43.534237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral properties of the non-backtracking matrix of a graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory Glover, Mark Kempton","submitted_at":"2020-11-18T16:34:51Z","abstract_excerpt":"We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the eigenvalues of the non-backtracking matrix in terms of eigenvalues of the adjacency matrix and use this to upper-bound the spectral radius of the non-backtracking matrix and to give a lower bound on the spectrum. We also investigate properties of a graph that can be determined by the spectrum. Specifically, we prove that the number of components, the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09385","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.09385/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.09385","created_at":"2026-07-05T01:52:43.534293+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.09385v1","created_at":"2026-07-05T01:52:43.534293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09385","created_at":"2026-07-05T01:52:43.534293+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KN5KHG2FZNG","created_at":"2026-07-05T01:52:43.534293+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KN5KHG2FZNGKKMT","created_at":"2026-07-05T01:52:43.534293+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KN5KHG2","created_at":"2026-07-05T01:52:43.534293+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.10650","citing_title":"Subgroups of a free group with every growth rate","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2","json":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2.json","graph_json":"https://pith.science/api/pith-number/6KN5KHG2FZNGKKMTGRMDJ2LSR2/graph.json","events_json":"https://pith.science/api/pith-number/6KN5KHG2FZNGKKMTGRMDJ2LSR2/events.json","paper":"https://pith.science/paper/6KN5KHG2"},"agent_actions":{"view_html":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2","download_json":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2.json","view_paper":"https://pith.science/paper/6KN5KHG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.09385&json=true","fetch_graph":"https://pith.science/api/pith-number/6KN5KHG2FZNGKKMTGRMDJ2LSR2/graph.json","fetch_events":"https://pith.science/api/pith-number/6KN5KHG2FZNGKKMTGRMDJ2LSR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/action/storage_attestation","attest_author":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/action/author_attestation","sign_citation":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/action/citation_signature","submit_replication":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/action/replication_record"}},"created_at":"2026-07-05T01:52:43.534293+00:00","updated_at":"2026-07-05T01:52:43.534293+00:00"}