{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2JBRVEDXGKO2P7XQX3EGNWYQEV","short_pith_number":"pith:2JBRVEDX","canonical_record":{"source":{"id":"1808.03885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T03:37:51Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"1e29ecb41b9e0c6f1739654ea2c0d19b89adaf836f935ce194a371a9cf9c5d2b","abstract_canon_sha256":"03b7d86e660adbfc5c8d666377b2979a6bded6d2fedb847bbe0c7ce58d4d5e42"},"schema_version":"1.0"},"canonical_sha256":"d2431a9077329da7fef0bec866db10255176bba69f1079d42b20358cc5980bb9","source":{"kind":"arxiv","id":"1808.03885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03885","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03885v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03885","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"2JBRVEDXGKO2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2JBRVEDXGKO2P7XQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2JBRVEDX","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2JBRVEDXGKO2P7XQX3EGNWYQEV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T03:37:51Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"1e29ecb41b9e0c6f1739654ea2c0d19b89adaf836f935ce194a371a9cf9c5d2b","abstract_canon_sha256":"03b7d86e660adbfc5c8d666377b2979a6bded6d2fedb847bbe0c7ce58d4d5e42"},"schema_version":"1.0"},"canonical_sha256":"d2431a9077329da7fef0bec866db10255176bba69f1079d42b20358cc5980bb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.448245Z","signature_b64":"NpnEaeVO4vkjTami3RcwtTdgpgzMpPrfV3JRZHrg1HkB3Ap9MF3djz7OuQ2SSX2dWG8fxF3GQAJiaVNQHxYXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2431a9077329da7fef0bec866db10255176bba69f1079d42b20358cc5980bb9","last_reissued_at":"2026-05-18T00:08:19.447673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.447673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03885","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-05-18T00:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28X0CZ0BfOmy4ZNx04LSiZqLHaQ0/MRrowziZkOCU0yuYv0Hph4yrUiYpy4Ej6aaGhLxtb8mMN207ZNCGFLcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:23:23.393903Z"},"content_sha256":"0fabcba74dd0b741d4e09400d3945aca212e6c159222c568f05237846b8b8cba","schema_version":"1.0","event_id":"sha256:0fabcba74dd0b741d4e09400d3945aca212e6c159222c568f05237846b8b8cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2JBRVEDXGKO2P7XQX3EGNWYQEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximately uniformly locally finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.CO","authors_text":"Vladimir Manuilov","submitted_at":"2018-08-12T03:37:51Z","abstract_excerpt":"Let $\\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\\Gamma$. If $\\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard basis) has no more than $d+1$ non-zero entries in each row and in each column. We consider the class of locally finite graphs, for which the Laplacian can be approximated by matrices of this type with arbitrary $d$. We provide examples of locally finite graphs which are or are not in this class, and show that the graphs from this class share certain regularity pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03885","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"},"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-05-18T00:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioPAqnHJMCbOWthSFsnBPpIMqJ89dFMvwuOGmf8yvny2CW58Mi/PWjfMoJNNmxYWPxcmRg22IzbWg/soOLADAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:23:23.394245Z"},"content_sha256":"c54b566f048ce74aa1b39cd557699059dd52d58b54cfa21150e67e56fee87cee","schema_version":"1.0","event_id":"sha256:c54b566f048ce74aa1b39cd557699059dd52d58b54cfa21150e67e56fee87cee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV/bundle.json","state_url":"https://pith.science/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV/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-06-29T03:23:23Z","links":{"resolver":"https://pith.science/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV","bundle":"https://pith.science/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV/bundle.json","state":"https://pith.science/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JBRVEDXGKO2P7XQX3EGNWYQEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2JBRVEDXGKO2P7XQX3EGNWYQEV","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":"03b7d86e660adbfc5c8d666377b2979a6bded6d2fedb847bbe0c7ce58d4d5e42","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T03:37:51Z","title_canon_sha256":"1e29ecb41b9e0c6f1739654ea2c0d19b89adaf836f935ce194a371a9cf9c5d2b"},"schema_version":"1.0","source":{"id":"1808.03885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03885","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03885v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03885","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"2JBRVEDXGKO2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2JBRVEDXGKO2P7XQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2JBRVEDX","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:c54b566f048ce74aa1b39cd557699059dd52d58b54cfa21150e67e56fee87cee","target":"graph","created_at":"2026-05-18T00:08:19Z","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"},"paper":{"abstract_excerpt":"Let $\\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\\Gamma$. If $\\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard basis) has no more than $d+1$ non-zero entries in each row and in each column. We consider the class of locally finite graphs, for which the Laplacian can be approximated by matrices of this type with arbitrary $d$. We provide examples of locally finite graphs which are or are not in this class, and show that the graphs from this class share certain regularity pr","authors_text":"Vladimir Manuilov","cross_cats":["math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T03:37:51Z","title":"Approximately uniformly locally finite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03885","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:0fabcba74dd0b741d4e09400d3945aca212e6c159222c568f05237846b8b8cba","target":"record","created_at":"2026-05-18T00:08:19Z","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":"03b7d86e660adbfc5c8d666377b2979a6bded6d2fedb847bbe0c7ce58d4d5e42","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-12T03:37:51Z","title_canon_sha256":"1e29ecb41b9e0c6f1739654ea2c0d19b89adaf836f935ce194a371a9cf9c5d2b"},"schema_version":"1.0","source":{"id":"1808.03885","kind":"arxiv","version":1}},"canonical_sha256":"d2431a9077329da7fef0bec866db10255176bba69f1079d42b20358cc5980bb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2431a9077329da7fef0bec866db10255176bba69f1079d42b20358cc5980bb9","first_computed_at":"2026-05-18T00:08:19.447673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.447673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NpnEaeVO4vkjTami3RcwtTdgpgzMpPrfV3JRZHrg1HkB3Ap9MF3djz7OuQ2SSX2dWG8fxF3GQAJiaVNQHxYXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.448245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fabcba74dd0b741d4e09400d3945aca212e6c159222c568f05237846b8b8cba","sha256:c54b566f048ce74aa1b39cd557699059dd52d58b54cfa21150e67e56fee87cee"],"state_sha256":"017c01cc6625a6553e51ce0186442bc1e217a24c26cd33d3a8cf87f5edfd1935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEjBBY1ndHNb66RnFP2awvJBMlkJjhRWy/T1ML3ut/85fOkbwCl0AERq1GGUHm/adfz9qMJzm5aZMxwp6mrkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:23:23.396150Z","bundle_sha256":"1a68ae77f69a669b515680b6ee69114c40ab56cc6f859105a5a37f773e1d834b"}}