{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:25W76VJOEFX2S6JYUSLT4UBHOT","short_pith_number":"pith:25W76VJO","schema_version":"1.0","canonical_sha256":"d76dff552e216fa97938a4973e502774e475989fe8ef13a06181f548b84b0cc9","source":{"kind":"arxiv","id":"1206.5726","version":1},"attestation_state":"computed","paper":{"title":"L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Alberto Palomares, Carlos Carrascosa, Francisco Pedroche, Miguel Rebollo","submitted_at":"2012-06-25T16:13:59Z","abstract_excerpt":"In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering of the vertices such that the adjacency matrix A is block diagonal with k blocks. This also holds for the (unnormalized) Laplacian matrix L= D-A, with D a diagonal matrix with the degrees of the nodes. In this paper we propose to use the Reverse Cuthill-McKee (RCM) algorithm to obtain a block diagonal form of L that reveals the number of connected components of the graph. We present some theoretical results about the "},"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":"1206.5726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-25T16:13:59Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"4647fb17a2ac93c83dd7ccfb943a6d549fdbf25f82aa2ca350d1edb1e6b8b185","abstract_canon_sha256":"2de386269baa22e630975911e4490dc916526460f36c9e37ec26710dfd28aac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.776098Z","signature_b64":"BmkLxLzs29LyWURlGMFKzM1GK1/KjRko2DZQN7DhiQpDp9X1/tmsvNHTTSYqUO5Nj/RZvTan85cSNXJAAuOoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d76dff552e216fa97938a4973e502774e475989fe8ef13a06181f548b84b0cc9","last_reissued_at":"2026-05-18T02:21:08.775669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.775669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L-RCM: a method to detect connected components in undirected graphs by using the Laplacian matrix and the RCM algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DM","authors_text":"Alberto Palomares, Carlos Carrascosa, Francisco Pedroche, Miguel Rebollo","submitted_at":"2012-06-25T16:13:59Z","abstract_excerpt":"In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering of the vertices such that the adjacency matrix A is block diagonal with k blocks. This also holds for the (unnormalized) Laplacian matrix L= D-A, with D a diagonal matrix with the degrees of the nodes. In this paper we propose to use the Reverse Cuthill-McKee (RCM) algorithm to obtain a block diagonal form of L that reveals the number of connected components of the graph. We present some theoretical results about the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5726","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":"1206.5726","created_at":"2026-05-18T02:21:08.775742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5726v1","created_at":"2026-05-18T02:21:08.775742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5726","created_at":"2026-05-18T02:21:08.775742+00:00"},{"alias_kind":"pith_short_12","alias_value":"25W76VJOEFX2","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"25W76VJOEFX2S6JY","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"25W76VJO","created_at":"2026-05-18T12:26:50.516681+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/25W76VJOEFX2S6JYUSLT4UBHOT","json":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT.json","graph_json":"https://pith.science/api/pith-number/25W76VJOEFX2S6JYUSLT4UBHOT/graph.json","events_json":"https://pith.science/api/pith-number/25W76VJOEFX2S6JYUSLT4UBHOT/events.json","paper":"https://pith.science/paper/25W76VJO"},"agent_actions":{"view_html":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT","download_json":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT.json","view_paper":"https://pith.science/paper/25W76VJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5726&json=true","fetch_graph":"https://pith.science/api/pith-number/25W76VJOEFX2S6JYUSLT4UBHOT/graph.json","fetch_events":"https://pith.science/api/pith-number/25W76VJOEFX2S6JYUSLT4UBHOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT/action/storage_attestation","attest_author":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT/action/author_attestation","sign_citation":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT/action/citation_signature","submit_replication":"https://pith.science/pith/25W76VJOEFX2S6JYUSLT4UBHOT/action/replication_record"}},"created_at":"2026-05-18T02:21:08.775742+00:00","updated_at":"2026-05-18T02:21:08.775742+00:00"}