{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LSHMZTBQLPOXFVX5OIBIGPHHHI","short_pith_number":"pith:LSHMZTBQ","schema_version":"1.0","canonical_sha256":"5c8ecccc305bdd72d6fd7202833ce73a2a30a8594a9199704644227e089bf472","source":{"kind":"arxiv","id":"1311.1695","version":1},"attestation_state":"computed","paper":{"title":"Computing the smallest eigenpairs of the graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Enrico Bozzo, Luca Bergamaschi, Massimo Franceschet","submitted_at":"2013-11-07T14:37:27Z","abstract_excerpt":"The graph Laplacian, a typical representation of a network, is an important matrix that can tell us much about the network structure. In particular its eigenpairs (eigenvalues and eigenvectors) incubate precious topological information about the network at hand, including connectivity, partitioning, node distance and centrality. Real networks might be very large in number of nodes (actors); luckily, most real networks are sparse, meaning that the number of edges (binary connections among actors) are few with respect to the maximum number of possible edges. In this paper we experimentally compa"},"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":"1311.1695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-07T14:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"fd1608327ccd7543124676653f3b653357c92de788151d1d09ad6017e9a2f440","abstract_canon_sha256":"507f713054e90ab8e3426221a9b2f3a14136a5f5b8c883cae5325d987b9204cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:43.583445Z","signature_b64":"TWkwzbSQNq9ambK4QQHhubFXNEMCNDzPFLOfDNJxKrkvyBSrhIjMq/tVFvV9qVbTWqGDWJMZ/Q5Wbfd6hnvHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8ecccc305bdd72d6fd7202833ce73a2a30a8594a9199704644227e089bf472","last_reissued_at":"2026-05-18T03:07:43.582858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:43.582858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the smallest eigenpairs of the graph Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Enrico Bozzo, Luca Bergamaschi, Massimo Franceschet","submitted_at":"2013-11-07T14:37:27Z","abstract_excerpt":"The graph Laplacian, a typical representation of a network, is an important matrix that can tell us much about the network structure. In particular its eigenpairs (eigenvalues and eigenvectors) incubate precious topological information about the network at hand, including connectivity, partitioning, node distance and centrality. Real networks might be very large in number of nodes (actors); luckily, most real networks are sparse, meaning that the number of edges (binary connections among actors) are few with respect to the maximum number of possible edges. In this paper we experimentally compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1695","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":"1311.1695","created_at":"2026-05-18T03:07:43.582923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1695v1","created_at":"2026-05-18T03:07:43.582923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1695","created_at":"2026-05-18T03:07:43.582923+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSHMZTBQLPOX","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSHMZTBQLPOXFVX5","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSHMZTBQ","created_at":"2026-05-18T12:27:51.066281+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/LSHMZTBQLPOXFVX5OIBIGPHHHI","json":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI.json","graph_json":"https://pith.science/api/pith-number/LSHMZTBQLPOXFVX5OIBIGPHHHI/graph.json","events_json":"https://pith.science/api/pith-number/LSHMZTBQLPOXFVX5OIBIGPHHHI/events.json","paper":"https://pith.science/paper/LSHMZTBQ"},"agent_actions":{"view_html":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI","download_json":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI.json","view_paper":"https://pith.science/paper/LSHMZTBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1695&json=true","fetch_graph":"https://pith.science/api/pith-number/LSHMZTBQLPOXFVX5OIBIGPHHHI/graph.json","fetch_events":"https://pith.science/api/pith-number/LSHMZTBQLPOXFVX5OIBIGPHHHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI/action/storage_attestation","attest_author":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI/action/author_attestation","sign_citation":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI/action/citation_signature","submit_replication":"https://pith.science/pith/LSHMZTBQLPOXFVX5OIBIGPHHHI/action/replication_record"}},"created_at":"2026-05-18T03:07:43.582923+00:00","updated_at":"2026-05-18T03:07:43.582923+00:00"}