{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:C5DVPJTTTVIRAVFP5SC5C546HV","short_pith_number":"pith:C5DVPJTT","canonical_record":{"source":{"id":"1407.3144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-11T13:12:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eddad356262a618f971345a2a66c8948693b56435b93b23785aa3277f3479dbc","abstract_canon_sha256":"2a41d01d7bec1fd0f032f700924c237db122bc92ebdfa06591052199455283be"},"schema_version":"1.0"},"canonical_sha256":"174757a6739d511054afec85d1779e3d5266e2ae705bd72c214ec4eb7e9d931b","source":{"kind":"arxiv","id":"1407.3144","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3144","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3144v3","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3144","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"C5DVPJTTTVIR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C5DVPJTTTVIRAVFP","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C5DVPJTT","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:C5DVPJTTTVIRAVFP5SC5C546HV","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-11T13:12:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"eddad356262a618f971345a2a66c8948693b56435b93b23785aa3277f3479dbc","abstract_canon_sha256":"2a41d01d7bec1fd0f032f700924c237db122bc92ebdfa06591052199455283be"},"schema_version":"1.0"},"canonical_sha256":"174757a6739d511054afec85d1779e3d5266e2ae705bd72c214ec4eb7e9d931b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:51.068499Z","signature_b64":"rdp5rRFGgtTmCRg5ywAuj4sjxLb+uylRTG1vDZOigXfooYxoGXBxNX4IQb/zIXJbUdqdofEvTy14cry6NUbTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"174757a6739d511054afec85d1779e3d5266e2ae705bd72c214ec4eb7e9d931b","last_reissued_at":"2026-05-18T02:27:51.068115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:51.068115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3144","source_version":3,"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-18T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyaqji1OwQBX/qfs2VZAT+MVklHD2jzi73NR8716VqxOkX4XoLMALettpNCwOCp7o3GP8EuKeifYWmu/HOLqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:15:19.540555Z"},"content_sha256":"dfd40c35fc676f4af7325606ae555d9f487903d0c480ff673eaad1c5b9e8a0a7","schema_version":"1.0","event_id":"sha256:dfd40c35fc676f4af7325606ae555d9f487903d0c480ff673eaad1c5b9e8a0a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:C5DVPJTTTVIRAVFP5SC5C546HV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrea Pietracaprina, Eli Upfal, Geppino Pucci, Matteo Ceccarello","submitted_at":"2014-07-11T13:12:19Z","abstract_excerpt":"We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect to similar previous decompositions, our strategy exercises a tighter control on both the number of clusters and their maximum radius.\n  We present two important applications of our parallel graph decomposition: (1) $k$-center clustering approximation; and (2) diameter approximation. In both cases, we obtain algorithms which feature a polylogarithmic approximation factor and are am"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3144","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":""},"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-18T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9ZzXDeKh2CpXPPYIEzmSZVkVyNDbE74doV8vZ3C7iMot8WpLOS973/8+VzHljHZhjur0Q3Q0oOiAU8hgrEVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:15:19.541063Z"},"content_sha256":"a0d1e03fbd7659dcc3985c73145bb996cf98f8c5d756811138320ea7aab49ccc","schema_version":"1.0","event_id":"sha256:a0d1e03fbd7659dcc3985c73145bb996cf98f8c5d756811138320ea7aab49ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5DVPJTTTVIRAVFP5SC5C546HV/bundle.json","state_url":"https://pith.science/pith/C5DVPJTTTVIRAVFP5SC5C546HV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5DVPJTTTVIRAVFP5SC5C546HV/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-05-27T23:15:19Z","links":{"resolver":"https://pith.science/pith/C5DVPJTTTVIRAVFP5SC5C546HV","bundle":"https://pith.science/pith/C5DVPJTTTVIRAVFP5SC5C546HV/bundle.json","state":"https://pith.science/pith/C5DVPJTTTVIRAVFP5SC5C546HV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5DVPJTTTVIRAVFP5SC5C546HV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:C5DVPJTTTVIRAVFP5SC5C546HV","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":"2a41d01d7bec1fd0f032f700924c237db122bc92ebdfa06591052199455283be","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-11T13:12:19Z","title_canon_sha256":"eddad356262a618f971345a2a66c8948693b56435b93b23785aa3277f3479dbc"},"schema_version":"1.0","source":{"id":"1407.3144","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3144","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3144v3","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3144","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"C5DVPJTTTVIR","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"C5DVPJTTTVIRAVFP","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"C5DVPJTT","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:a0d1e03fbd7659dcc3985c73145bb996cf98f8c5d756811138320ea7aab49ccc","target":"graph","created_at":"2026-05-18T02:27:51Z","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":"We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect to similar previous decompositions, our strategy exercises a tighter control on both the number of clusters and their maximum radius.\n  We present two important applications of our parallel graph decomposition: (1) $k$-center clustering approximation; and (2) diameter approximation. In both cases, we obtain algorithms which feature a polylogarithmic approximation factor and are am","authors_text":"Andrea Pietracaprina, Eli Upfal, Geppino Pucci, Matteo Ceccarello","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-11T13:12:19Z","title":"Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3144","kind":"arxiv","version":3},"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:dfd40c35fc676f4af7325606ae555d9f487903d0c480ff673eaad1c5b9e8a0a7","target":"record","created_at":"2026-05-18T02:27:51Z","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":"2a41d01d7bec1fd0f032f700924c237db122bc92ebdfa06591052199455283be","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-11T13:12:19Z","title_canon_sha256":"eddad356262a618f971345a2a66c8948693b56435b93b23785aa3277f3479dbc"},"schema_version":"1.0","source":{"id":"1407.3144","kind":"arxiv","version":3}},"canonical_sha256":"174757a6739d511054afec85d1779e3d5266e2ae705bd72c214ec4eb7e9d931b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"174757a6739d511054afec85d1779e3d5266e2ae705bd72c214ec4eb7e9d931b","first_computed_at":"2026-05-18T02:27:51.068115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:51.068115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rdp5rRFGgtTmCRg5ywAuj4sjxLb+uylRTG1vDZOigXfooYxoGXBxNX4IQb/zIXJbUdqdofEvTy14cry6NUbTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:51.068499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3144","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfd40c35fc676f4af7325606ae555d9f487903d0c480ff673eaad1c5b9e8a0a7","sha256:a0d1e03fbd7659dcc3985c73145bb996cf98f8c5d756811138320ea7aab49ccc"],"state_sha256":"570db759700edd98dc7e182d2ecb069a08db54c45984ce81d141446717476ba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LVDfi2HDZao7ivL8rV4fkdaqunSIhmijECxkJkNt/wwnTxcaPdmFAh2iruro7Lyz3lnAxXQoRlMFP0O56H0oDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:15:19.543446Z","bundle_sha256":"7fb2ebc918609b82d7878078870b64cfc7b0ea3ba036752a249a6e966ce721b4"}}