{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CCSPYFZKUYCAYDMYUXPMEBPNE6","short_pith_number":"pith:CCSPYFZK","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"},"canonical_sha256":"10a4fc172aa6040c0d98a5dec205ed27b189309dbd8b22a7cef888e274eccd65","source":{"kind":"arxiv","id":"1711.09189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09189","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09189v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09189","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"CCSPYFZKUYCA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CCSPYFZKUYCAYDMY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CCSPYFZK","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CCSPYFZKUYCAYDMYUXPMEBPNE6","target":"record","payload":{"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"},"canonical_sha256":"10a4fc172aa6040c0d98a5dec205ed27b189309dbd8b22a7cef888e274eccd65","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"},"source_kind":"arxiv","source_id":"1711.09189","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REVDZ/GpQTDKIwryoxwmpLcjbYr2u4kg/hxUE8Xuokgoz5V/aCcZf+zm7Dl7KrglXktjE5vB2o/Oqqru2z4iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:22:55.731511Z"},"content_sha256":"aa6a4cb01a80fe712a0bab9cdaa1f97d6fdfebabb6f48d5458b32732352fe9b0","schema_version":"1.0","event_id":"sha256:aa6a4cb01a80fe712a0bab9cdaa1f97d6fdfebabb6f48d5458b32732352fe9b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CCSPYFZKUYCAYDMYUXPMEBPNE6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkcsO+3IdCbWqj0nrzNk/vm0s6q5XrDg5FlFAuoOyGZd/eXGHh/GnjKMdqhB96BdLHUxLmJ367Bt8kRhBqarBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:22:55.731859Z"},"content_sha256":"6a7444f09b31c76cee19b4a95b90bc9855f660a1eee49a09c408158aeea5b0f7","schema_version":"1.0","event_id":"sha256:6a7444f09b31c76cee19b4a95b90bc9855f660a1eee49a09c408158aeea5b0f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/bundle.json","state_url":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T13:22:55Z","links":{"resolver":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6","bundle":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/bundle.json","state":"https://pith.science/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCSPYFZKUYCAYDMYUXPMEBPNE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CCSPYFZKUYCAYDMYUXPMEBPNE6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f0b3e73e1e2c691277baa34623f5f528a739fc8c170cb256e900b6fe453741c9","cross_cats_sorted":["cs.DB","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-11-25T04:43:12Z","title_canon_sha256":"b000a46ce8cd881c7472d960523c5305b2651c905211dbbf98c49eec163693a4"},"schema_version":"1.0","source":{"id":"1711.09189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09189","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09189v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09189","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"CCSPYFZKUYCA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CCSPYFZKUYCAYDMY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CCSPYFZK","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6a7444f09b31c76cee19b4a95b90bc9855f660a1eee49a09c408158aeea5b0f7","target":"graph","created_at":"2026-05-18T00:29:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Lijun Chang","cross_cats":["cs.DB","cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-11-25T04:43:12Z","title":"A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09189","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aa6a4cb01a80fe712a0bab9cdaa1f97d6fdfebabb6f48d5458b32732352fe9b0","target":"record","created_at":"2026-05-18T00:29:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f0b3e73e1e2c691277baa34623f5f528a739fc8c170cb256e900b6fe453741c9","cross_cats_sorted":["cs.DB","cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-11-25T04:43:12Z","title_canon_sha256":"b000a46ce8cd881c7472d960523c5305b2651c905211dbbf98c49eec163693a4"},"schema_version":"1.0","source":{"id":"1711.09189","kind":"arxiv","version":1}},"canonical_sha256":"10a4fc172aa6040c0d98a5dec205ed27b189309dbd8b22a7cef888e274eccd65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10a4fc172aa6040c0d98a5dec205ed27b189309dbd8b22a7cef888e274eccd65","first_computed_at":"2026-05-18T00:29:23.979605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:23.979605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVf4v/v3u1gT8QGx5iw1IDA+Cj/fxhoXNIVgzNtpCiTZXRqYa8CKBJkvkMaojz5JH5zTqLrEt/ptSsPYxEgyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:23.980182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa6a4cb01a80fe712a0bab9cdaa1f97d6fdfebabb6f48d5458b32732352fe9b0","sha256:6a7444f09b31c76cee19b4a95b90bc9855f660a1eee49a09c408158aeea5b0f7"],"state_sha256":"778c0f9aa199322950d59e68b74a782db41da176397c8ad0019c0ccb9f0ee983"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNDHcsamkqg2Hrrt0GZPTTIIbFaRvhYja8hcQEO/MH8M89vo1fBdTBDB/c03YMlENYcQRGug/m4nT8/zFG+iAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:22:55.733724Z","bundle_sha256":"757f84a3bb12f1be1f2b70f3be5dcd770bdae6515987711f0ca44f6133f8c5d8"}}