{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WCIP57R3IEAAX5ZOK4ENJCAAL2","short_pith_number":"pith:WCIP57R3","schema_version":"1.0","canonical_sha256":"b090fefe3b41000bf72e5708d488005eb3c412a810f80676c62af059bfc75936","source":{"kind":"arxiv","id":"1805.05404","version":1},"attestation_state":"computed","paper":{"title":"Congested Clique Algorithms for Graph Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eylon Yogev, Merav Parter","submitted_at":"2018-05-14T19:48:13Z","abstract_excerpt":"Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling schemes and routing to solving linear systems and spectral sparsification. A $k$-spanner maintains pairwise distances up to multiplicative factor of $k$. It is a folklore that for every $n$-vertex graph $G$, one can construct a $(2k-1)$ spanner with $O(n^{1+1/k})$ edges. In a distributed setting, such spanners can be constructed in the standard CONGEST model u"},"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":"1805.05404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T19:48:13Z","cross_cats_sorted":[],"title_canon_sha256":"155027d052d33c0dedd2c224926725f49cb633c45d46afa71ccd641179a690af","abstract_canon_sha256":"78f0d6f29a2bf9442f624bd34c3af5ef3a061d18cf8940ddfcbf42db4686ba8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:02.448712Z","signature_b64":"QszvcmvWoaOroNjdKrVbAlpZd5RFBJRrbyf+U1cVTmIctndlYZ2l/YJ7JN68K4deskVLtq8knxMKG8txcFu0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b090fefe3b41000bf72e5708d488005eb3c412a810f80676c62af059bfc75936","last_reissued_at":"2026-05-18T00:16:02.448173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:02.448173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Congested Clique Algorithms for Graph Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eylon Yogev, Merav Parter","submitted_at":"2018-05-14T19:48:13Z","abstract_excerpt":"Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling schemes and routing to solving linear systems and spectral sparsification. A $k$-spanner maintains pairwise distances up to multiplicative factor of $k$. It is a folklore that for every $n$-vertex graph $G$, one can construct a $(2k-1)$ spanner with $O(n^{1+1/k})$ edges. In a distributed setting, such spanners can be constructed in the standard CONGEST model u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05404","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":"1805.05404","created_at":"2026-05-18T00:16:02.448273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05404v1","created_at":"2026-05-18T00:16:02.448273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05404","created_at":"2026-05-18T00:16:02.448273+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCIP57R3IEAA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCIP57R3IEAAX5ZO","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCIP57R3","created_at":"2026-05-18T12:32:59.047623+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/WCIP57R3IEAAX5ZOK4ENJCAAL2","json":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2.json","graph_json":"https://pith.science/api/pith-number/WCIP57R3IEAAX5ZOK4ENJCAAL2/graph.json","events_json":"https://pith.science/api/pith-number/WCIP57R3IEAAX5ZOK4ENJCAAL2/events.json","paper":"https://pith.science/paper/WCIP57R3"},"agent_actions":{"view_html":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2","download_json":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2.json","view_paper":"https://pith.science/paper/WCIP57R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05404&json=true","fetch_graph":"https://pith.science/api/pith-number/WCIP57R3IEAAX5ZOK4ENJCAAL2/graph.json","fetch_events":"https://pith.science/api/pith-number/WCIP57R3IEAAX5ZOK4ENJCAAL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/action/storage_attestation","attest_author":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/action/author_attestation","sign_citation":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/action/citation_signature","submit_replication":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/action/replication_record"}},"created_at":"2026-05-18T00:16:02.448273+00:00","updated_at":"2026-05-18T00:16:02.448273+00:00"}