{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ILHPDHGHRFF2RD7A5DVLMASDZP","short_pith_number":"pith:ILHPDHGH","schema_version":"1.0","canonical_sha256":"42cef19cc7894ba88fe0e8eab60243cbc407a6b6149593204d1c0675c0b21f28","source":{"kind":"arxiv","id":"0910.3466","version":3},"attestation_state":"computed","paper":{"title":"Unboundedness of adjacency matrices of locally finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.SP"],"primary_cat":"math.FA","authors_text":"Sylvain Golenia","submitted_at":"2009-10-19T14:47:06Z","abstract_excerpt":"Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We also consider the case of weighted graphs. We discuss the question of self-adjoint extensions and prove an optimal criterium."},"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":"0910.3466","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2009-10-19T14:47:06Z","cross_cats_sorted":["math-ph","math.MP","math.SP"],"title_canon_sha256":"bb501d1f78e8769d310f4f26189447144f25cbc5185a8491a5525c2910270759","abstract_canon_sha256":"71eca891b943bbe678fbb91b8fadab95e8a277515ab2ada9d7d990290c162e85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:14.435252Z","signature_b64":"mdPnDPyEnGHRotCosZsef/4B6W86kn8qqjycmtyLcgAZuISzHqYIFY9w4sBcG1TYuqcrAAgTpchW2NRj7hOqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42cef19cc7894ba88fe0e8eab60243cbc407a6b6149593204d1c0675c0b21f28","last_reissued_at":"2026-05-18T02:11:14.434330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:14.434330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unboundedness of adjacency matrices of locally finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.SP"],"primary_cat":"math.FA","authors_text":"Sylvain Golenia","submitted_at":"2009-10-19T14:47:06Z","abstract_excerpt":"Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We also consider the case of weighted graphs. We discuss the question of self-adjoint extensions and prove an optimal criterium."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3466","kind":"arxiv","version":3},"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":"0910.3466","created_at":"2026-05-18T02:11:14.434490+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.3466v3","created_at":"2026-05-18T02:11:14.434490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3466","created_at":"2026-05-18T02:11:14.434490+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILHPDHGHRFF2","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILHPDHGHRFF2RD7A","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILHPDHGH","created_at":"2026-05-18T12:26:00.592388+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/ILHPDHGHRFF2RD7A5DVLMASDZP","json":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP.json","graph_json":"https://pith.science/api/pith-number/ILHPDHGHRFF2RD7A5DVLMASDZP/graph.json","events_json":"https://pith.science/api/pith-number/ILHPDHGHRFF2RD7A5DVLMASDZP/events.json","paper":"https://pith.science/paper/ILHPDHGH"},"agent_actions":{"view_html":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP","download_json":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP.json","view_paper":"https://pith.science/paper/ILHPDHGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.3466&json=true","fetch_graph":"https://pith.science/api/pith-number/ILHPDHGHRFF2RD7A5DVLMASDZP/graph.json","fetch_events":"https://pith.science/api/pith-number/ILHPDHGHRFF2RD7A5DVLMASDZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP/action/storage_attestation","attest_author":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP/action/author_attestation","sign_citation":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP/action/citation_signature","submit_replication":"https://pith.science/pith/ILHPDHGHRFF2RD7A5DVLMASDZP/action/replication_record"}},"created_at":"2026-05-18T02:11:14.434490+00:00","updated_at":"2026-05-18T02:11:14.434490+00:00"}