{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CCSPYFZKUYCAYDMYUXPMEBPNE6","short_pith_number":"pith:CCSPYFZK","schema_version":"1.0","canonical_sha256":"10a4fc172aa6040c0d98a5dec205ed27b189309dbd8b22a7cef888e274eccd65","source":{"kind":"arxiv","id":"1711.09189","version":1},"attestation_state":"computed","paper":{"title":"A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.SI"],"primary_cat":"cs.DS","authors_text":"Lijun Chang","submitted_at":"2017-11-25T04:43:12Z","abstract_excerpt":"Driven by many applications in graph analytics, the problem of computing $k$-edge connected components ($k$-ECCs) of a graph $G$ for a user-given $k$ has been extensively studied recently. In this paper, we investigate the problem of constructing the hierarchy of edge connectivity-based graph decomposition, which compactly represents the $k$-ECCs of a graph for all possible $k$ values. This is based on the fact that each $k$-ECC is entirely contained in a $(k-1)$-ECC. In contrast to the existing approaches that conduct the computation either in a bottom-up or a top-down manner, we propose a bi"},"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":"1711.09189","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-11-25T04:43:12Z","cross_cats_sorted":["cs.DB","cs.SI"],"title_canon_sha256":"b000a46ce8cd881c7472d960523c5305b2651c905211dbbf98c49eec163693a4","abstract_canon_sha256":"f0b3e73e1e2c691277baa34623f5f528a739fc8c170cb256e900b6fe453741c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:23.980182Z","signature_b64":"fVf4v/v3u1gT8QGx5iw1IDA+Cj/fxhoXNIVgzNtpCiTZXRqYa8CKBJkvkMaojz5JH5zTqLrEt/ptSsPYxEgyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10a4fc172aa6040c0d98a5dec205ed27b189309dbd8b22a7cef888e274eccd65","last_reissued_at":"2026-05-18T00:29:23.979605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:23.979605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.SI"],"primary_cat":"cs.DS","authors_text":"Lijun Chang","submitted_at":"2017-11-25T04:43:12Z","abstract_excerpt":"Driven by many applications in graph analytics, the problem of computing $k$-edge connected components ($k$-ECCs) of a graph $G$ for a user-given $k$ has been extensively studied recently. In this paper, we investigate the problem of constructing the hierarchy of edge connectivity-based graph decomposition, which compactly represents the $k$-ECCs of a graph for all possible $k$ values. This is based on the fact that each $k$-ECC is entirely contained in a $(k-1)$-ECC. In contrast to the existing approaches that conduct the computation either in a bottom-up or a top-down manner, we propose a bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09189","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":"1711.09189","created_at":"2026-05-18T00:29:23.979698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09189v1","created_at":"2026-05-18T00:29:23.979698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09189","created_at":"2026-05-18T00:29:23.979698+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCSPYFZKUYCA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCSPYFZKUYCAYDMY","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCSPYFZK","created_at":"2026-05-18T12:31:10.602751+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/CCSPYFZKUYCAYDMYUXPMEBPNE6","json":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6.json","graph_json":"https://pith.science/api/pith-number/CCSPYFZKUYCAYDMYUXPMEBPNE6/graph.json","events_json":"https://pith.science/api/pith-number/CCSPYFZKUYCAYDMYUXPMEBPNE6/events.json","paper":"https://pith.science/paper/CCSPYFZK"},"agent_actions":{"view_html":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6","download_json":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6.json","view_paper":"https://pith.science/paper/CCSPYFZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09189&json=true","fetch_graph":"https://pith.science/api/pith-number/CCSPYFZKUYCAYDMYUXPMEBPNE6/graph.json","fetch_events":"https://pith.science/api/pith-number/CCSPYFZKUYCAYDMYUXPMEBPNE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/action/storage_attestation","attest_author":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/action/author_attestation","sign_citation":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/action/citation_signature","submit_replication":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/action/replication_record"}},"created_at":"2026-05-18T00:29:23.979698+00:00","updated_at":"2026-05-18T00:29:23.979698+00:00"}