{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YEKVAXX3WESWE42FI7U23BFRMY","short_pith_number":"pith:YEKVAXX3","canonical_record":{"source":{"id":"1802.03160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-09T08:01:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"34cc0c43ff92846351135073772270fce77b6f8676556f924232c7c912661437","abstract_canon_sha256":"d07bdc96f91f2203dc413403db823c521daa5f1b3c7b3ff3e9199b09562aacb7"},"schema_version":"1.0"},"canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","source":{"kind":"arxiv","id":"1802.03160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03160","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03160v1","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03160","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"YEKVAXX3WESW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YEKVAXX3WESWE42F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YEKVAXX3","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YEKVAXX3WESWE42FI7U23BFRMY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-09T08:01:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"34cc0c43ff92846351135073772270fce77b6f8676556f924232c7c912661437","abstract_canon_sha256":"d07bdc96f91f2203dc413403db823c521daa5f1b3c7b3ff3e9199b09562aacb7"},"schema_version":"1.0"},"canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.435355Z","signature_b64":"doXKPjtX2W2pHP0It6hm9r5eY+PYD/tFmq0NOECuorUUDHoIYTmbl3YW8tvkrgHkEmnw/Cf3hBBF7AKkcjtMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","last_reissued_at":"2026-05-18T00:23:58.434817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.434817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03160","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:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfPXWDYIHnjkf01AFWO2Mz/pcgWBukazwvUFIR6TOcuCrIqpn++rtFGFpLVYADESETEcIOTrQIJRLdd12uiCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:09:41.667785Z"},"content_sha256":"2546c58b5eb6cce61f71518f47a4f7db8c1ad10565179b1a92c0829ab879da71","schema_version":"1.0","event_id":"sha256:2546c58b5eb6cce61f71518f47a4f7db8c1ad10565179b1a92c0829ab879da71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YEKVAXX3WESWE42FI7U23BFRMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Spanner Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Keren Censor-Hillel, Michal Dory","submitted_at":"2018-02-09T08:01:28Z","abstract_excerpt":"We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results.\n  Our main hardness result shows that an $\\alpha$-approximation for the minimum directed $k$-spanner problem for $k \\geq 5$ requires $\\Omega(n /\\sqrt{\\alpha}\\log{n})$ rounds using deterministic algorithms or $\\Omega(\\sqrt{n }/\\sqrt{\\alpha}\\log{n})$ rounds using randomized ones, in the CONGEST model of distributed computing. Combined with the constant-round $O(n^{\\epsilon})$-approximation algorithm in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03160","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:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08YgVIDVfJTqPHu9k4MABV0yIzKu0IQa5c7usGVvWGKspx+YsxZbJosDeMXNyUs4vvVMIhhJLihFSw7KJ8+GDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:09:41.668121Z"},"content_sha256":"e8db8fad93a8d6047226861d049e5babe02a8eb84b1b6931194079473bce7174","schema_version":"1.0","event_id":"sha256:e8db8fad93a8d6047226861d049e5babe02a8eb84b1b6931194079473bce7174"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/bundle.json","state_url":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEKVAXX3WESWE42FI7U23BFRMY/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-29T07:09:41Z","links":{"resolver":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY","bundle":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/bundle.json","state":"https://pith.science/pith/YEKVAXX3WESWE42FI7U23BFRMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEKVAXX3WESWE42FI7U23BFRMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YEKVAXX3WESWE42FI7U23BFRMY","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":"d07bdc96f91f2203dc413403db823c521daa5f1b3c7b3ff3e9199b09562aacb7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-09T08:01:28Z","title_canon_sha256":"34cc0c43ff92846351135073772270fce77b6f8676556f924232c7c912661437"},"schema_version":"1.0","source":{"id":"1802.03160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03160","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03160v1","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03160","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"YEKVAXX3WESW","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YEKVAXX3WESWE42F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YEKVAXX3","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:e8db8fad93a8d6047226861d049e5babe02a8eb84b1b6931194079473bce7174","target":"graph","created_at":"2026-05-18T00:23:58Z","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":"We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results.\n  Our main hardness result shows that an $\\alpha$-approximation for the minimum directed $k$-spanner problem for $k \\geq 5$ requires $\\Omega(n /\\sqrt{\\alpha}\\log{n})$ rounds using deterministic algorithms or $\\Omega(\\sqrt{n }/\\sqrt{\\alpha}\\log{n})$ rounds using randomized ones, in the CONGEST model of distributed computing. Combined with the constant-round $O(n^{\\epsilon})$-approximation algorithm in ","authors_text":"Keren Censor-Hillel, Michal Dory","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-09T08:01:28Z","title":"Distributed Spanner Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03160","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:2546c58b5eb6cce61f71518f47a4f7db8c1ad10565179b1a92c0829ab879da71","target":"record","created_at":"2026-05-18T00:23:58Z","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":"d07bdc96f91f2203dc413403db823c521daa5f1b3c7b3ff3e9199b09562aacb7","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-09T08:01:28Z","title_canon_sha256":"34cc0c43ff92846351135073772270fce77b6f8676556f924232c7c912661437"},"schema_version":"1.0","source":{"id":"1802.03160","kind":"arxiv","version":1}},"canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c115505efbb12562734547e9ad84b166029383f0c4fd609a18347e49ddfb8ecc","first_computed_at":"2026-05-18T00:23:58.434817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:58.434817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"doXKPjtX2W2pHP0It6hm9r5eY+PYD/tFmq0NOECuorUUDHoIYTmbl3YW8tvkrgHkEmnw/Cf3hBBF7AKkcjtMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:58.435355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2546c58b5eb6cce61f71518f47a4f7db8c1ad10565179b1a92c0829ab879da71","sha256:e8db8fad93a8d6047226861d049e5babe02a8eb84b1b6931194079473bce7174"],"state_sha256":"39541cfa6692a32ccbd852c3555de9bd599e12a5cb94187f9ea278f9fb789311"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAmnG9+HvX6UtscPXGCWf2z48itWKmLyTDjadAe7hBKPTeCbPL734D8r0gaWhEJokPOPded9A9owivfokmSuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:09:41.669963Z","bundle_sha256":"347c298930655b6e6e1bbe29ad0c759a0b570f0ada55f54d011096cc61182bf3"}}