{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VZAC6R7EVPUW3DATKM5CBXUVVG","short_pith_number":"pith:VZAC6R7E","schema_version":"1.0","canonical_sha256":"ae402f47e4abe96d8c13533a20de95a9b86a39c0c47dd495dc4a58ffa8d31245","source":{"kind":"arxiv","id":"1506.03265","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.03265","created_at":"2026-05-18T01:27:31.540008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03265v3","created_at":"2026-05-18T01:27:31.540008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03265","created_at":"2026-05-18T01:27:31.540008+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZAC6R7EVPUW","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZAC6R7EVPUW3DAT","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZAC6R7E","created_at":"2026-05-18T12:29:47.479230+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/VZAC6R7EVPUW3DATKM5CBXUVVG","json":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG.json","graph_json":"https://pith.science/api/pith-number/VZAC6R7EVPUW3DATKM5CBXUVVG/graph.json","events_json":"https://pith.science/api/pith-number/VZAC6R7EVPUW3DATKM5CBXUVVG/events.json","paper":"https://pith.science/paper/VZAC6R7E"},"agent_actions":{"view_html":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG","download_json":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG.json","view_paper":"https://pith.science/paper/VZAC6R7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03265&json=true","fetch_graph":"https://pith.science/api/pith-number/VZAC6R7EVPUW3DATKM5CBXUVVG/graph.json","fetch_events":"https://pith.science/api/pith-number/VZAC6R7EVPUW3DATKM5CBXUVVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/action/storage_attestation","attest_author":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/action/author_attestation","sign_citation":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/action/citation_signature","submit_replication":"https://pith.science/pith/VZAC6R7EVPUW3DATKM5CBXUVVG/action/replication_record"}},"created_at":"2026-05-18T01:27:31.540008+00:00","updated_at":"2026-05-18T01:27:31.540008+00:00"}