{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DKF2VIGRDFKQ7MVI3ZVOZGPY65","short_pith_number":"pith:DKF2VIGR","canonical_record":{"source":{"id":"1607.08337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T07:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"f499aace7f374e4023b66e620e8ad513708ea76fdcedb77603c67b9d5f3b38c5","abstract_canon_sha256":"8aeaeaa20ffb09e62b27df3ed38c6e43c6fdd4798da71ab475892627f1c2a24c"},"schema_version":"1.0"},"canonical_sha256":"1a8baaa0d119550fb2a8de6aec99f8f770a9e3592b25b61cf6c326896ab4dd20","source":{"kind":"arxiv","id":"1607.08337","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08337","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08337v2","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08337","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"DKF2VIGRDFKQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKF2VIGRDFKQ7MVI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKF2VIGR","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DKF2VIGRDFKQ7MVI3ZVOZGPY65","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T07:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"f499aace7f374e4023b66e620e8ad513708ea76fdcedb77603c67b9d5f3b38c5","abstract_canon_sha256":"8aeaeaa20ffb09e62b27df3ed38c6e43c6fdd4798da71ab475892627f1c2a24c"},"schema_version":"1.0"},"canonical_sha256":"1a8baaa0d119550fb2a8de6aec99f8f770a9e3592b25b61cf6c326896ab4dd20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:25.398170Z","signature_b64":"5JzXvkesKBfKoeVp5SSOSS4p7BC0aYUx5bixjha8GI2U8XEQ+XpLDuXPgrwDbqgOhVNXGX/OZCx9gMgm9JmODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a8baaa0d119550fb2a8de6aec99f8f770a9e3592b25b61cf6c326896ab4dd20","last_reissued_at":"2026-05-18T00:51:25.397684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:25.397684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08337","source_version":2,"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOXdJb5rDAT0Vw/6am7Q5wSjQiTJ62wQifi6/ciWdn9Yk/g7TsafCcHy/tGqcp7sPXc1u0dztShi/dV6l7VGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:11:00.172307Z"},"content_sha256":"c57c8a6931ec4f6b027b9b33f83600009269f3f5b62d46de88c853fde83fcf8e","schema_version":"1.0","event_id":"sha256:c57c8a6931ec4f6b027b9b33f83600009269f3f5b62d46de88c853fde83fcf8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DKF2VIGRDFKQ7MVI3ZVOZGPY65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Constructing Very Sparse Spanners and Emulators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Elkin, Ofer Neiman","submitted_at":"2016-07-28T07:47:52Z","abstract_excerpt":"Miller et al. \\cite{MPVX15} devised a distributed\\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \\cite{MPVX15}.} algorithm in the CONGEST model, that given a parameter $k = 1,2,\\ldots$, constructs an $O(k)$-spanner of an input unweighted $n$-vertex graph with $O(n^{1+1/k})$ expected edges in $O(k)$ rounds of communication. In this paper we improve the result of \\cite{MPVX15}, by showing a $k$-round distributed algorithm in the same model, that constructs a $(2k-1)$-spanner with $O(n^{1+1/k}/\\epsilon)$ edges, with probability $1- \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08337","kind":"arxiv","version":2},"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:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+y9qWjpTJyjZq6vstM2Azn/xDXL6DqOS1I/7/XIByNQQf4uMRtjFOLyW9Av426LcPb7JH8Eu7+8D7SrpXaPOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:11:00.172662Z"},"content_sha256":"90ace14ca6c21877ec25b46ff26e1509119d5245e1163bee453bd8f8a683d809","schema_version":"1.0","event_id":"sha256:90ace14ca6c21877ec25b46ff26e1509119d5245e1163bee453bd8f8a683d809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65/bundle.json","state_url":"https://pith.science/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65/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-06-25T05:11:00Z","links":{"resolver":"https://pith.science/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65","bundle":"https://pith.science/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65/bundle.json","state":"https://pith.science/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKF2VIGRDFKQ7MVI3ZVOZGPY65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DKF2VIGRDFKQ7MVI3ZVOZGPY65","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":"8aeaeaa20ffb09e62b27df3ed38c6e43c6fdd4798da71ab475892627f1c2a24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T07:47:52Z","title_canon_sha256":"f499aace7f374e4023b66e620e8ad513708ea76fdcedb77603c67b9d5f3b38c5"},"schema_version":"1.0","source":{"id":"1607.08337","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08337","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08337v2","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08337","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"DKF2VIGRDFKQ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DKF2VIGRDFKQ7MVI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DKF2VIGR","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:90ace14ca6c21877ec25b46ff26e1509119d5245e1163bee453bd8f8a683d809","target":"graph","created_at":"2026-05-18T00:51:25Z","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":"Miller et al. \\cite{MPVX15} devised a distributed\\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \\cite{MPVX15}.} algorithm in the CONGEST model, that given a parameter $k = 1,2,\\ldots$, constructs an $O(k)$-spanner of an input unweighted $n$-vertex graph with $O(n^{1+1/k})$ expected edges in $O(k)$ rounds of communication. In this paper we improve the result of \\cite{MPVX15}, by showing a $k$-round distributed algorithm in the same model, that constructs a $(2k-1)$-spanner with $O(n^{1+1/k}/\\epsilon)$ edges, with probability $1- \\","authors_text":"Michael Elkin, Ofer Neiman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T07:47:52Z","title":"Efficient Algorithms for Constructing Very Sparse Spanners and Emulators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08337","kind":"arxiv","version":2},"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:c57c8a6931ec4f6b027b9b33f83600009269f3f5b62d46de88c853fde83fcf8e","target":"record","created_at":"2026-05-18T00:51:25Z","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":"8aeaeaa20ffb09e62b27df3ed38c6e43c6fdd4798da71ab475892627f1c2a24c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-28T07:47:52Z","title_canon_sha256":"f499aace7f374e4023b66e620e8ad513708ea76fdcedb77603c67b9d5f3b38c5"},"schema_version":"1.0","source":{"id":"1607.08337","kind":"arxiv","version":2}},"canonical_sha256":"1a8baaa0d119550fb2a8de6aec99f8f770a9e3592b25b61cf6c326896ab4dd20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a8baaa0d119550fb2a8de6aec99f8f770a9e3592b25b61cf6c326896ab4dd20","first_computed_at":"2026-05-18T00:51:25.397684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:25.397684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5JzXvkesKBfKoeVp5SSOSS4p7BC0aYUx5bixjha8GI2U8XEQ+XpLDuXPgrwDbqgOhVNXGX/OZCx9gMgm9JmODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:25.398170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08337","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c57c8a6931ec4f6b027b9b33f83600009269f3f5b62d46de88c853fde83fcf8e","sha256:90ace14ca6c21877ec25b46ff26e1509119d5245e1163bee453bd8f8a683d809"],"state_sha256":"15618bd28416d5a12332f8e611aa28a9fb8735014106195a10774c385426e20a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbEjOfpJf0PcuLTCQd/kjcN1Jndg0fMX8BH99MkkBlUYZFoUFw68TRZ0ziPZ6YzwZP6ljnCJTmvMSS++lX1HBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:11:00.174551Z","bundle_sha256":"81ae57121505c3df7a2d0751bd83404676704ca15131b6edcf0d88567d26a6d7"}}