{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z57DH2LGZVRQMRUV2KKANVT65E","short_pith_number":"pith:Z57DH2LG","schema_version":"1.0","canonical_sha256":"cf7e33e966cd63064695d29406d67ee902991c32b61ae7d4d8cc4f55aa81e158","source":{"kind":"arxiv","id":"1412.5854","version":1},"attestation_state":"computed","paper":{"title":"A short remark on the surjectivity of the combinatorial Laplacian on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Thomas Kalmes","submitted_at":"2014-12-18T13:39:42Z","abstract_excerpt":"Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by Ceccherini-Silberstein, Coornaert, and Dodziuk. In fact, we show that every linear operator on $\\mathbb{K}^V$ which has finite hopping range and satisfies the pointwise maximum principle is surjective."},"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":"1412.5854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-12-18T13:39:42Z","cross_cats_sorted":[],"title_canon_sha256":"3742b28e970518b397779ef81601ef62611bd0a1f6b4c559b63e61a18571f05c","abstract_canon_sha256":"3d9ad920d109802773d03e2ac81f1eede1f159fb5cb7fb66f305cbb5ec5be2cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:53.852607Z","signature_b64":"P10RXoNWwe9NQvimhKa8sDLX8KnCK8ivo3bKUdKhzZfJvhW9HcpSNKnSTcl0uLTiPrWeTZRj0qZfgjQgEPIvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf7e33e966cd63064695d29406d67ee902991c32b61ae7d4d8cc4f55aa81e158","last_reissued_at":"2026-05-18T00:13:53.851696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:53.851696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short remark on the surjectivity of the combinatorial Laplacian on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Thomas Kalmes","submitted_at":"2014-12-18T13:39:42Z","abstract_excerpt":"Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by Ceccherini-Silberstein, Coornaert, and Dodziuk. In fact, we show that every linear operator on $\\mathbb{K}^V$ which has finite hopping range and satisfies the pointwise maximum principle is surjective."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5854","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":"1412.5854","created_at":"2026-05-18T00:13:53.851852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5854v1","created_at":"2026-05-18T00:13:53.851852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5854","created_at":"2026-05-18T00:13:53.851852+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z57DH2LGZVRQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z57DH2LGZVRQMRUV","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z57DH2LG","created_at":"2026-05-18T12:28:59.999130+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/Z57DH2LGZVRQMRUV2KKANVT65E","json":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E.json","graph_json":"https://pith.science/api/pith-number/Z57DH2LGZVRQMRUV2KKANVT65E/graph.json","events_json":"https://pith.science/api/pith-number/Z57DH2LGZVRQMRUV2KKANVT65E/events.json","paper":"https://pith.science/paper/Z57DH2LG"},"agent_actions":{"view_html":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E","download_json":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E.json","view_paper":"https://pith.science/paper/Z57DH2LG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5854&json=true","fetch_graph":"https://pith.science/api/pith-number/Z57DH2LGZVRQMRUV2KKANVT65E/graph.json","fetch_events":"https://pith.science/api/pith-number/Z57DH2LGZVRQMRUV2KKANVT65E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E/action/storage_attestation","attest_author":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E/action/author_attestation","sign_citation":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E/action/citation_signature","submit_replication":"https://pith.science/pith/Z57DH2LGZVRQMRUV2KKANVT65E/action/replication_record"}},"created_at":"2026-05-18T00:13:53.851852+00:00","updated_at":"2026-05-18T00:13:53.851852+00:00"}