{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WCIP57R3IEAAX5ZOK4ENJCAAL2","short_pith_number":"pith:WCIP57R3","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"},"canonical_sha256":"b090fefe3b41000bf72e5708d488005eb3c412a810f80676c62af059bfc75936","source":{"kind":"arxiv","id":"1805.05404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05404","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05404v1","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05404","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"WCIP57R3IEAA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCIP57R3IEAAX5ZO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCIP57R3","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WCIP57R3IEAAX5ZOK4ENJCAAL2","target":"record","payload":{"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"},"canonical_sha256":"b090fefe3b41000bf72e5708d488005eb3c412a810f80676c62af059bfc75936","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"},"source_kind":"arxiv","source_id":"1805.05404","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:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgiwGHwn2BbWWU5J0l4E3Y9RkHOZeqBcjiGtorj1RFmYsJG0mku1r+rfpCZdTBFFpzgzMdXxiy5VJdEOD1uNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:26:06.995077Z"},"content_sha256":"baaa0a9e633fa4f4b21c09d54a994c8e7a18f5e9deaaa5fe4590146e2a134299","schema_version":"1.0","event_id":"sha256:baaa0a9e633fa4f4b21c09d54a994c8e7a18f5e9deaaa5fe4590146e2a134299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WCIP57R3IEAAX5ZOK4ENJCAAL2","target":"graph","payload":{"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"},"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:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zmfM4+JeDztfk4XbBqjoHxV4qrIU/xrfVidwdAQvrBVvG2pefv6rMq/P1vpQeLxry2ZTgidFHpbSLHKya5RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:26:06.995440Z"},"content_sha256":"631b4c1fd9681ab02533dbeec0309087b036e4dda8cec86c2de0b34f477a31d8","schema_version":"1.0","event_id":"sha256:631b4c1fd9681ab02533dbeec0309087b036e4dda8cec86c2de0b34f477a31d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/bundle.json","state_url":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/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-28T03:26:06Z","links":{"resolver":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2","bundle":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/bundle.json","state":"https://pith.science/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCIP57R3IEAAX5ZOK4ENJCAAL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WCIP57R3IEAAX5ZOK4ENJCAAL2","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":"78f0d6f29a2bf9442f624bd34c3af5ef3a061d18cf8940ddfcbf42db4686ba8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T19:48:13Z","title_canon_sha256":"155027d052d33c0dedd2c224926725f49cb633c45d46afa71ccd641179a690af"},"schema_version":"1.0","source":{"id":"1805.05404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05404","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05404v1","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05404","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"WCIP57R3IEAA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WCIP57R3IEAAX5ZO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WCIP57R3","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:631b4c1fd9681ab02533dbeec0309087b036e4dda8cec86c2de0b34f477a31d8","target":"graph","created_at":"2026-05-18T00:16:02Z","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":"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","authors_text":"Eylon Yogev, Merav Parter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T19:48:13Z","title":"Congested Clique Algorithms for Graph Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05404","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:baaa0a9e633fa4f4b21c09d54a994c8e7a18f5e9deaaa5fe4590146e2a134299","target":"record","created_at":"2026-05-18T00:16:02Z","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":"78f0d6f29a2bf9442f624bd34c3af5ef3a061d18cf8940ddfcbf42db4686ba8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T19:48:13Z","title_canon_sha256":"155027d052d33c0dedd2c224926725f49cb633c45d46afa71ccd641179a690af"},"schema_version":"1.0","source":{"id":"1805.05404","kind":"arxiv","version":1}},"canonical_sha256":"b090fefe3b41000bf72e5708d488005eb3c412a810f80676c62af059bfc75936","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b090fefe3b41000bf72e5708d488005eb3c412a810f80676c62af059bfc75936","first_computed_at":"2026-05-18T00:16:02.448173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:02.448173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QszvcmvWoaOroNjdKrVbAlpZd5RFBJRrbyf+U1cVTmIctndlYZ2l/YJ7JN68K4deskVLtq8knxMKG8txcFu0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:02.448712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baaa0a9e633fa4f4b21c09d54a994c8e7a18f5e9deaaa5fe4590146e2a134299","sha256:631b4c1fd9681ab02533dbeec0309087b036e4dda8cec86c2de0b34f477a31d8"],"state_sha256":"c1b12bf90cca92ce1171fafdf2d065008ee18d8823e4414e29cb56321a80a233"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJfyGgiUKSQeVS64Gj2W/Tgxu8OLmlTV1bU2aWRTemkv4wX23Rna9/PMXOnn4juf1vU3lyNUY5tuAjRG+YZSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:26:06.997500Z","bundle_sha256":"5e2a879fbe8dc74963794c32ebbed6296c69d4e0d8fd8eee8bb5e0f45814aa98"}}