{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:66VWL4EZIMILETEST4BBMLE6TP","short_pith_number":"pith:66VWL4EZ","schema_version":"1.0","canonical_sha256":"f7ab65f0994310b24c929f02162c9e9bd83c3b9697e2562bd0198544306c6a93","source":{"kind":"arxiv","id":"2501.10745","version":3},"attestation_state":"computed","paper":{"title":"Changing the ranking in eigenvector centrality of a weighted graph by small perturbations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.DS","math.OC"],"primary_cat":"math.NA","authors_text":"Michele Benzi, Nicola Guglielmi","submitted_at":"2025-01-18T12:11:01Z","abstract_excerpt":"In this article, we consider eigenvector centrality for the nodes of a graph and study the robustness (and stability) of this popular centrality measure. For a given weighted graph {\\mathcal G} (both directed and undirected), we consider the associated weighted adjacency matrix A, which by definition is a non-negative matrix. The eigenvector centralities of the nodes of {\\mathcal G} are the entries of the Perron eigenvector of A, which is the (positive) eigenvector associated with the eigenvalue with largest modulus. They provide a ranking of the nodes according to the corresponding centraliti"},"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":"2501.10745","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-01-18T12:11:01Z","cross_cats_sorted":["cs.NA","math.DS","math.OC"],"title_canon_sha256":"8835267c6eea903e1f2eacb845f1229433f9a1f679418a0c07334647e3e1667e","abstract_canon_sha256":"116726a47e9faea1a441b88168a17b320314df5469481b1e6ade87dde88db560"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:58.869574Z","signature_b64":"A7+d4UcowHhGDNr5gEJXEeaS6QK8hRivaPxQglsylsh8Xs6aOdJbB3xd6GE5XfWp55Ii/XtatNEZOo4rwHg+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7ab65f0994310b24c929f02162c9e9bd83c3b9697e2562bd0198544306c6a93","last_reissued_at":"2026-07-05T11:52:58.869106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:58.869106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Changing the ranking in eigenvector centrality of a weighted graph by small perturbations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA","math.DS","math.OC"],"primary_cat":"math.NA","authors_text":"Michele Benzi, Nicola Guglielmi","submitted_at":"2025-01-18T12:11:01Z","abstract_excerpt":"In this article, we consider eigenvector centrality for the nodes of a graph and study the robustness (and stability) of this popular centrality measure. For a given weighted graph {\\mathcal G} (both directed and undirected), we consider the associated weighted adjacency matrix A, which by definition is a non-negative matrix. The eigenvector centralities of the nodes of {\\mathcal G} are the entries of the Perron eigenvector of A, which is the (positive) eigenvector associated with the eigenvalue with largest modulus. They provide a ranking of the nodes according to the corresponding centraliti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10745","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.10745/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.10745","created_at":"2026-07-05T11:52:58.869164+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10745v3","created_at":"2026-07-05T11:52:58.869164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10745","created_at":"2026-07-05T11:52:58.869164+00:00"},{"alias_kind":"pith_short_12","alias_value":"66VWL4EZIMIL","created_at":"2026-07-05T11:52:58.869164+00:00"},{"alias_kind":"pith_short_16","alias_value":"66VWL4EZIMILETES","created_at":"2026-07-05T11:52:58.869164+00:00"},{"alias_kind":"pith_short_8","alias_value":"66VWL4EZ","created_at":"2026-07-05T11:52:58.869164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21506","citing_title":"The Derivative of Kemeny's Constant as a Centrality Measure in Undirected Graphs","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP","json":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP.json","graph_json":"https://pith.science/api/pith-number/66VWL4EZIMILETEST4BBMLE6TP/graph.json","events_json":"https://pith.science/api/pith-number/66VWL4EZIMILETEST4BBMLE6TP/events.json","paper":"https://pith.science/paper/66VWL4EZ"},"agent_actions":{"view_html":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP","download_json":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP.json","view_paper":"https://pith.science/paper/66VWL4EZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10745&json=true","fetch_graph":"https://pith.science/api/pith-number/66VWL4EZIMILETEST4BBMLE6TP/graph.json","fetch_events":"https://pith.science/api/pith-number/66VWL4EZIMILETEST4BBMLE6TP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP/action/storage_attestation","attest_author":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP/action/author_attestation","sign_citation":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP/action/citation_signature","submit_replication":"https://pith.science/pith/66VWL4EZIMILETEST4BBMLE6TP/action/replication_record"}},"created_at":"2026-07-05T11:52:58.869164+00:00","updated_at":"2026-07-05T11:52:58.869164+00:00"}