{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6KN5KHG2FZNGKKMTGRMDJ2LSR2","short_pith_number":"pith:6KN5KHG2","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"},"canonical_sha256":"f29bd51cda2e5a652993345834e9728eb2d42978a165e0c6d3931123fff31332","source":{"kind":"arxiv","id":"2011.09385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09385","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09385v1","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09385","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"6KN5KHG2FZNG","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_16","alias_value":"6KN5KHG2FZNGKKMT","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_8","alias_value":"6KN5KHG2","created_at":"2026-07-05T01:52:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6KN5KHG2FZNGKKMTGRMDJ2LSR2","target":"record","payload":{"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"},"canonical_sha256":"f29bd51cda2e5a652993345834e9728eb2d42978a165e0c6d3931123fff31332","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"},"source_kind":"arxiv","source_id":"2011.09385","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5X6t6hIfAkIiNRkA5mTwtbKLi+buNjM1PsZVYXXWnnfh4FUZs9tqkmEJdpqxV4xxpm3GFB6UvrdRSPF7lVpLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:02:34.219831Z"},"content_sha256":"7764a0ecf80ed5811c809fde4bc48ca4c2e3943e0844ea46e7b6d051645dc1b5","schema_version":"1.0","event_id":"sha256:7764a0ecf80ed5811c809fde4bc48ca4c2e3943e0844ea46e7b6d051645dc1b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6KN5KHG2FZNGKKMTGRMDJ2LSR2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMEGZBSjG5WZK+9PO1IZaHpmrFwzuz4dNj5EWfxPVN3+VLMYloEtoeQDfb8tSOctrtsqXwgUr5R3sg2FoTjqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:02:34.220832Z"},"content_sha256":"6b681a980a865b4274d2c6ce417af88bc9de3c04a04c1b8374080157061bb310","schema_version":"1.0","event_id":"sha256:6b681a980a865b4274d2c6ce417af88bc9de3c04a04c1b8374080157061bb310"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/bundle.json","state_url":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T08:02:34Z","links":{"resolver":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2","bundle":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/bundle.json","state":"https://pith.science/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KN5KHG2FZNGKKMTGRMDJ2LSR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6KN5KHG2FZNGKKMTGRMDJ2LSR2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a7b4a62615916750f9c9c135cf2f4523fb2876345c6c69056e62d114828900b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-18T16:34:51Z","title_canon_sha256":"f8ade57848e386b771939e4c2e7496b365a0ba583ca7b635a615bd33a47feccc"},"schema_version":"1.0","source":{"id":"2011.09385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09385","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09385v1","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09385","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"6KN5KHG2FZNG","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_16","alias_value":"6KN5KHG2FZNGKKMT","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_8","alias_value":"6KN5KHG2","created_at":"2026-07-05T01:52:43Z"}],"graph_snapshots":[{"event_id":"sha256:6b681a980a865b4274d2c6ce417af88bc9de3c04a04c1b8374080157061bb310","target":"graph","created_at":"2026-07-05T01:52:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.09385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cory Glover, Mark Kempton","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-18T16:34:51Z","title":"Spectral properties of the non-backtracking matrix of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09385","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7764a0ecf80ed5811c809fde4bc48ca4c2e3943e0844ea46e7b6d051645dc1b5","target":"record","created_at":"2026-07-05T01:52:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a7b4a62615916750f9c9c135cf2f4523fb2876345c6c69056e62d114828900b5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-18T16:34:51Z","title_canon_sha256":"f8ade57848e386b771939e4c2e7496b365a0ba583ca7b635a615bd33a47feccc"},"schema_version":"1.0","source":{"id":"2011.09385","kind":"arxiv","version":1}},"canonical_sha256":"f29bd51cda2e5a652993345834e9728eb2d42978a165e0c6d3931123fff31332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f29bd51cda2e5a652993345834e9728eb2d42978a165e0c6d3931123fff31332","first_computed_at":"2026-07-05T01:52:43.534237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:43.534237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51Fsjsnyg9x7H+7rBo/wNaJ09NwvHbxvX1xdLziQBubRDou8aZ0e9XDOkkvxB/aaeQIwjR6zD71w592GLOgIDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:43.534606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.09385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7764a0ecf80ed5811c809fde4bc48ca4c2e3943e0844ea46e7b6d051645dc1b5","sha256:6b681a980a865b4274d2c6ce417af88bc9de3c04a04c1b8374080157061bb310"],"state_sha256":"dd4fa0e892f077d8cfc1d3cae6f750cc1c9028e42c7c02ea487906a017b7be6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNQzcqXAnbTn47ILGCq3MUcl4oceIVKiwoONJ7QSK1w4mOEwGL4rNOh0J9ntU640Q/N2qTmhQ1jdgdK9rYGrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:02:34.225003Z","bundle_sha256":"1fb907564eb0d3a9d33a743ba05131a0c01ae65bbf0d67303678600be372a6ca"}}