{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IWV3BC7LDUMHMJIP63MMONMHQ4","short_pith_number":"pith:IWV3BC7L","canonical_record":{"source":{"id":"1708.01011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T06:00:18Z","cross_cats_sorted":[],"title_canon_sha256":"06abfb1a60697880876ee3b87a50bcad2d3b8d0070ad59b41999ae0449f57f16","abstract_canon_sha256":"ca9acc30c03466608c034a247d70d7c4e77ba32f7415cced7bacce5ae87ecbe0"},"schema_version":"1.0"},"canonical_sha256":"45abb08beb1d1876250ff6d8c735878700d2d6af3f9da08fbccbcb9ca1c027db","source":{"kind":"arxiv","id":"1708.01011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01011","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01011v2","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01011","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"IWV3BC7LDUMH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWV3BC7LDUMHMJIP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWV3BC7L","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IWV3BC7LDUMHMJIP63MMONMHQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T06:00:18Z","cross_cats_sorted":[],"title_canon_sha256":"06abfb1a60697880876ee3b87a50bcad2d3b8d0070ad59b41999ae0449f57f16","abstract_canon_sha256":"ca9acc30c03466608c034a247d70d7c4e77ba32f7415cced7bacce5ae87ecbe0"},"schema_version":"1.0"},"canonical_sha256":"45abb08beb1d1876250ff6d8c735878700d2d6af3f9da08fbccbcb9ca1c027db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:08.328738Z","signature_b64":"8Nj6KYpC+naAsVkk+coiHOMcisl2+z2hwJjdQxGJZdVYEjRqWMkdpmSZ91KqWl5p5GTNf3YT+WawIxvw0rXyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45abb08beb1d1876250ff6d8c735878700d2d6af3f9da08fbccbcb9ca1c027db","last_reissued_at":"2026-05-18T00:38:08.328331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:08.328331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01011","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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AIePocdg5030tT1eDzlplT5Nc4ALaBijuttWG5f2i8vIe6Hsgqn7WFhIbP2nJ31XWA89u1yEGp5FrcrBWNT8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:48:55.381890Z"},"content_sha256":"da45ab12c6539dfd916366b4b865e13f3e1bd8a758d842eabf1d88a4462a1e18","schema_version":"1.0","event_id":"sha256:da45ab12c6539dfd916366b4b865e13f3e1bd8a758d842eabf1d88a4462a1e18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IWV3BC7LDUMHMJIP63MMONMHQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Deterministic Distributed Construction of Spanners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Merav Parter, Ofer Grossman","submitted_at":"2017-08-03T06:00:18Z","abstract_excerpt":"Graph spanners are fundamental graph structures with a wide range of applications in distributed networks. We consider a standard synchronous message passing model where in each round $O(\\log n)$ bits can be transmitted over every edge (the CONGEST model).\n  The state of the art of deterministic distributed spanner constructions suffers from large messages. The only exception is the work of Derbel et al. '10, which computes an optimal-sized $(2k-1)$-spanner but uses $O(n^{1-1/k})$ rounds.\n  In this paper, we significantly improve this bound. We present a deterministic distributed algorithm tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01011","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:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IG4g0f6R6v0LAMXE9x3R5m3nTqGakG8ktllexnqoVgybSnIU974+1UHpz1oKt+9Pl299Ovif7vsbIXE5UwdxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:48:55.382500Z"},"content_sha256":"27dc42fa6c80082f298161c4726e4d1a76f08e54564812b09e3c768835589733","schema_version":"1.0","event_id":"sha256:27dc42fa6c80082f298161c4726e4d1a76f08e54564812b09e3c768835589733"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWV3BC7LDUMHMJIP63MMONMHQ4/bundle.json","state_url":"https://pith.science/pith/IWV3BC7LDUMHMJIP63MMONMHQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWV3BC7LDUMHMJIP63MMONMHQ4/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-27T16:48:55Z","links":{"resolver":"https://pith.science/pith/IWV3BC7LDUMHMJIP63MMONMHQ4","bundle":"https://pith.science/pith/IWV3BC7LDUMHMJIP63MMONMHQ4/bundle.json","state":"https://pith.science/pith/IWV3BC7LDUMHMJIP63MMONMHQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWV3BC7LDUMHMJIP63MMONMHQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IWV3BC7LDUMHMJIP63MMONMHQ4","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":"ca9acc30c03466608c034a247d70d7c4e77ba32f7415cced7bacce5ae87ecbe0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T06:00:18Z","title_canon_sha256":"06abfb1a60697880876ee3b87a50bcad2d3b8d0070ad59b41999ae0449f57f16"},"schema_version":"1.0","source":{"id":"1708.01011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01011","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01011v2","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01011","created_at":"2026-05-18T00:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"IWV3BC7LDUMH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IWV3BC7LDUMHMJIP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IWV3BC7L","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:27dc42fa6c80082f298161c4726e4d1a76f08e54564812b09e3c768835589733","target":"graph","created_at":"2026-05-18T00:38:08Z","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 fundamental graph structures with a wide range of applications in distributed networks. We consider a standard synchronous message passing model where in each round $O(\\log n)$ bits can be transmitted over every edge (the CONGEST model).\n  The state of the art of deterministic distributed spanner constructions suffers from large messages. The only exception is the work of Derbel et al. '10, which computes an optimal-sized $(2k-1)$-spanner but uses $O(n^{1-1/k})$ rounds.\n  In this paper, we significantly improve this bound. We present a deterministic distributed algorithm tha","authors_text":"Merav Parter, Ofer Grossman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T06:00:18Z","title":"Improved Deterministic Distributed Construction of Spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01011","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:da45ab12c6539dfd916366b4b865e13f3e1bd8a758d842eabf1d88a4462a1e18","target":"record","created_at":"2026-05-18T00:38:08Z","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":"ca9acc30c03466608c034a247d70d7c4e77ba32f7415cced7bacce5ae87ecbe0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T06:00:18Z","title_canon_sha256":"06abfb1a60697880876ee3b87a50bcad2d3b8d0070ad59b41999ae0449f57f16"},"schema_version":"1.0","source":{"id":"1708.01011","kind":"arxiv","version":2}},"canonical_sha256":"45abb08beb1d1876250ff6d8c735878700d2d6af3f9da08fbccbcb9ca1c027db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45abb08beb1d1876250ff6d8c735878700d2d6af3f9da08fbccbcb9ca1c027db","first_computed_at":"2026-05-18T00:38:08.328331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:08.328331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Nj6KYpC+naAsVkk+coiHOMcisl2+z2hwJjdQxGJZdVYEjRqWMkdpmSZ91KqWl5p5GTNf3YT+WawIxvw0rXyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:08.328738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da45ab12c6539dfd916366b4b865e13f3e1bd8a758d842eabf1d88a4462a1e18","sha256:27dc42fa6c80082f298161c4726e4d1a76f08e54564812b09e3c768835589733"],"state_sha256":"28bdf36c9eb68b06d63841735ea23e6ee3b2208922a3a6c39deb735f219de70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7ctZBH+aKpgkfFLG/OP7Qw4aomY2Neia9R7hJBbzXkBbyK0zDRJHcMTgw4RsOJcztO+pK9h0CTCyBMvd1C+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:48:55.386056Z","bundle_sha256":"d2278d492e266602844bf4bd9b469791752681008fd3180ab3e32276870b8623"}}