{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VZAC6R7EVPUW3DATKM5CBXUVVG","short_pith_number":"pith:VZAC6R7E","canonical_record":{"source":{"id":"1506.03265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-10T11:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"ae2b931611818c6a942ef4d1ed24ae84704d2625cea1dacb001bf240140ceb28","abstract_canon_sha256":"53b4bea76da44fba50609c0384eee3cf68614d29a905dd5f2793b248715cdae4"},"schema_version":"1.0"},"canonical_sha256":"ae402f47e4abe96d8c13533a20de95a9b86a39c0c47dd495dc4a58ffa8d31245","source":{"kind":"arxiv","id":"1506.03265","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03265","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03265v3","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03265","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"VZAC6R7EVPUW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VZAC6R7EVPUW3DAT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VZAC6R7E","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VZAC6R7EVPUW3DATKM5CBXUVVG","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03265","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-10T11:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"ae2b931611818c6a942ef4d1ed24ae84704d2625cea1dacb001bf240140ceb28","abstract_canon_sha256":"53b4bea76da44fba50609c0384eee3cf68614d29a905dd5f2793b248715cdae4"},"schema_version":"1.0"},"canonical_sha256":"ae402f47e4abe96d8c13533a20de95a9b86a39c0c47dd495dc4a58ffa8d31245","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:31.540550Z","signature_b64":"sRp8nKUYsCC0hoISt1oCSFEcmeaT/Fz75Javbac6V2Jz5riLcPGT/4hAB1rsDBD+lEgKG12ebQL0XPw8QczeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae402f47e4abe96d8c13533a20de95a9b86a39c0c47dd495dc4a58ffa8d31245","last_reissued_at":"2026-05-18T01:27:31.539925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:31.539925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03265","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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaFLkuw09PSGR++Q0g0KzKjMX0l4OC326nIkKuyqWOpkk+pPUWaTMWq6QVz2PIJWk+dGgZ+Iso3pVL6dKifmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:13:11.311769Z"},"content_sha256":"0d3ccd1f69a119d28200bd25566be0512d0bdb073e105161c47f1ba8dd05bde4","schema_version":"1.0","event_id":"sha256:0d3ccd1f69a119d28200bd25566be0512d0bdb073e105161c47f1ba8dd05bde4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VZAC6R7EVPUW3DATKM5CBXUVVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrea Pietracaprina, Eli Upfal, Geppino Pucci, Matteo Ceccarello","submitted_at":"2015-06-10T11:43:41Z","abstract_excerpt":"We present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the algorithm is a weighted graph decomposition strategy generating disjoint clusters of bounded weighted radius. Theoretically, our algorithm uses linear space and yields a polylogarithmic approximation guarantee; moreover, for important practical classes of graphs, it runs in a number of rounds asymptotically smaller than those required by the natural approximation provided by the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03265","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-18T01:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6lyqRJWnElLSwXohlmAFU4SeZghdBymJJqMZtF2CBdQW3PNoLo0BADgjfr/26aYL5kVYU3uPMFUUL7NEQuDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:13:11.312464Z"},"content_sha256":"19d90cedf6cac92d98ec4a928deea9dc63f0c772c5539902d375615f1956dd0c","schema_version":"1.0","event_id":"sha256:19d90cedf6cac92d98ec4a928deea9dc63f0c772c5539902d375615f1956dd0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/bundle.json","state_url":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/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-27T20:13:11Z","links":{"resolver":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG","bundle":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/bundle.json","state":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VZAC6R7EVPUW3DATKM5CBXUVVG","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":"53b4bea76da44fba50609c0384eee3cf68614d29a905dd5f2793b248715cdae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-10T11:43:41Z","title_canon_sha256":"ae2b931611818c6a942ef4d1ed24ae84704d2625cea1dacb001bf240140ceb28"},"schema_version":"1.0","source":{"id":"1506.03265","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03265","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03265v3","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03265","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"VZAC6R7EVPUW","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VZAC6R7EVPUW3DAT","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VZAC6R7E","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:19d90cedf6cac92d98ec4a928deea9dc63f0c772c5539902d375615f1956dd0c","target":"graph","created_at":"2026-05-18T01:27:31Z","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 present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the algorithm is a weighted graph decomposition strategy generating disjoint clusters of bounded weighted radius. Theoretically, our algorithm uses linear space and yields a polylogarithmic approximation guarantee; moreover, for important practical classes of graphs, it runs in a number of rounds asymptotically smaller than those required by the natural approximation provided by the ","authors_text":"Andrea Pietracaprina, Eli Upfal, Geppino Pucci, Matteo Ceccarello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-10T11:43:41Z","title":"A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03265","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:0d3ccd1f69a119d28200bd25566be0512d0bdb073e105161c47f1ba8dd05bde4","target":"record","created_at":"2026-05-18T01:27:31Z","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":"53b4bea76da44fba50609c0384eee3cf68614d29a905dd5f2793b248715cdae4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-10T11:43:41Z","title_canon_sha256":"ae2b931611818c6a942ef4d1ed24ae84704d2625cea1dacb001bf240140ceb28"},"schema_version":"1.0","source":{"id":"1506.03265","kind":"arxiv","version":3}},"canonical_sha256":"ae402f47e4abe96d8c13533a20de95a9b86a39c0c47dd495dc4a58ffa8d31245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae402f47e4abe96d8c13533a20de95a9b86a39c0c47dd495dc4a58ffa8d31245","first_computed_at":"2026-05-18T01:27:31.539925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:31.539925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRp8nKUYsCC0hoISt1oCSFEcmeaT/Fz75Javbac6V2Jz5riLcPGT/4hAB1rsDBD+lEgKG12ebQL0XPw8QczeCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:31.540550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03265","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d3ccd1f69a119d28200bd25566be0512d0bdb073e105161c47f1ba8dd05bde4","sha256:19d90cedf6cac92d98ec4a928deea9dc63f0c772c5539902d375615f1956dd0c"],"state_sha256":"dc8ff8b950f58c86f2a168812e9940df26229364950bd2d4e733896c5b54d6d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3IvbDDtc8KEeXGGg4uPTxpGLgPKxP2fUjfbikHs5id8fHY93Ms2L7iFszgHt+yX6EiXYPBJ8Ssl1uTxuz+cBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:13:11.315981Z","bundle_sha256":"3b860ca3a6883bb0ad823a5206371a6ffd90e565a25e3a37e300f9763b0e9a54"}}