{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LWW7TQNLXIR5YIQLYWZINBISVP","short_pith_number":"pith:LWW7TQNL","schema_version":"1.0","canonical_sha256":"5dadf9c1abba23dc220bc5b2868512abcab364e0deedf49b351101d14b9d9120","source":{"kind":"arxiv","id":"1102.2950","version":1},"attestation_state":"computed","paper":{"title":"Kron Reduction of Graphs with Applications to Electrical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SY","math-ph","math.MP","math.OC"],"primary_cat":"math.CO","authors_text":"Florian Dorfler, Francesco Bullo","submitted_at":"2011-02-15T02:40:53Z","abstract_excerpt":"Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simul"},"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":"1102.2950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T02:40:53Z","cross_cats_sorted":["cs.DM","cs.SY","math-ph","math.MP","math.OC"],"title_canon_sha256":"b87f7cf4c9bea54f2eb3c386b0ff1aba957b5dd584b0c4bdf36b2fc18ada99ef","abstract_canon_sha256":"f6314daf85b7605b59d60eec456e01ab627f58a8c8f2b8626d5849d79fc7ab39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:38.667775Z","signature_b64":"zc7CU03jRgX0FYtygBTRorIQxoV3dkBB3LrlGtGilO8fbvq1sutx4HSl+H6irundsECgK+zBfxGtMT4KIrcVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dadf9c1abba23dc220bc5b2868512abcab364e0deedf49b351101d14b9d9120","last_reissued_at":"2026-05-18T04:28:38.667130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:38.667130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kron Reduction of Graphs with Applications to Electrical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SY","math-ph","math.MP","math.OC"],"primary_cat":"math.CO","authors_text":"Florian Dorfler, Francesco Bullo","submitted_at":"2011-02-15T02:40:53Z","abstract_excerpt":"Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2950","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":"1102.2950","created_at":"2026-05-18T04:28:38.667232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2950v1","created_at":"2026-05-18T04:28:38.667232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2950","created_at":"2026-05-18T04:28:38.667232+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWW7TQNLXIR5","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWW7TQNLXIR5YIQL","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWW7TQNL","created_at":"2026-05-18T12:26:34.985390+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/LWW7TQNLXIR5YIQLYWZINBISVP","json":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP.json","graph_json":"https://pith.science/api/pith-number/LWW7TQNLXIR5YIQLYWZINBISVP/graph.json","events_json":"https://pith.science/api/pith-number/LWW7TQNLXIR5YIQLYWZINBISVP/events.json","paper":"https://pith.science/paper/LWW7TQNL"},"agent_actions":{"view_html":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP","download_json":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP.json","view_paper":"https://pith.science/paper/LWW7TQNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2950&json=true","fetch_graph":"https://pith.science/api/pith-number/LWW7TQNLXIR5YIQLYWZINBISVP/graph.json","fetch_events":"https://pith.science/api/pith-number/LWW7TQNLXIR5YIQLYWZINBISVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP/action/storage_attestation","attest_author":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP/action/author_attestation","sign_citation":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP/action/citation_signature","submit_replication":"https://pith.science/pith/LWW7TQNLXIR5YIQLYWZINBISVP/action/replication_record"}},"created_at":"2026-05-18T04:28:38.667232+00:00","updated_at":"2026-05-18T04:28:38.667232+00:00"}