{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XKFAAW5JLJ4XYQ7RVDCJGXYWSM","short_pith_number":"pith:XKFAAW5J","canonical_record":{"source":{"id":"1710.03164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-09T16:03:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0ffed2bc3a9ff0aace1c807306370c9e729beb474756205a0983accae990b7b","abstract_canon_sha256":"b59249103ad6dbcd05e3af6d5af7ca941dea9b476fd1948833ac5f80ce1da765"},"schema_version":"1.0"},"canonical_sha256":"ba8a005ba95a797c43f1a8c4935f169320063415b2fc71e42fb57dbb62899b8e","source":{"kind":"arxiv","id":"1710.03164","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03164","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03164v1","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03164","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"XKFAAW5JLJ4X","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XKFAAW5JLJ4XYQ7R","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XKFAAW5J","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XKFAAW5JLJ4XYQ7RVDCJGXYWSM","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-09T16:03:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0ffed2bc3a9ff0aace1c807306370c9e729beb474756205a0983accae990b7b","abstract_canon_sha256":"b59249103ad6dbcd05e3af6d5af7ca941dea9b476fd1948833ac5f80ce1da765"},"schema_version":"1.0"},"canonical_sha256":"ba8a005ba95a797c43f1a8c4935f169320063415b2fc71e42fb57dbb62899b8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:26.890873Z","signature_b64":"pWIoJCx/bu3fcKwGEG69XXrIhmbXlIkNbqdjZIPijepK7+sl0dtjCHrxUDGsTUObHZvCNQe5J0Yxwj4AkWcHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba8a005ba95a797c43f1a8c4935f169320063415b2fc71e42fb57dbb62899b8e","last_reissued_at":"2026-05-18T00:33:26.890238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:26.890238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03164","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:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQEzQ38G0sArg5ik43ROCiwlnHdKcqnCQdilBGvRHblCSKXkSoAG0mQb3BPsy/11pkS45StuXMFkhAuP367eAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:26:18.490765Z"},"content_sha256":"b6fa698579860496393f080d6f4912c8cf2358cf1c9a055d328e13c25bccee51","schema_version":"1.0","event_id":"sha256:b6fa698579860496393f080d6f4912c8cf2358cf1c9a055d328e13c25bccee51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XKFAAW5JLJ4XYQ7RVDCJGXYWSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Vertex Fault Tolerant Spanners (for fixed stretch)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Greg Bodwin, Merav Parter, Michael Dinitz, Virginia Vassilevska Williams","submitted_at":"2017-10-09T16:03:49Z","abstract_excerpt":"A $k$-spanner of a graph $G$ is a sparse subgraph $H$ whose shortest path distances match those of $G$ up to a multiplicative error $k$. In this paper we study spanners that are resistant to faults. A subgraph $H \\subseteq G$ is an $f$ vertex fault tolerant (VFT) $k$-spanner if $H \\setminus F$ is a $k$-spanner of $G \\setminus F$ for any small set $F$ of $f$ vertices that might \"fail.\" One of the main questions in the area is: what is the minimum size of an $f$ fault tolerant $k$-spanner that holds for all $n$ node graphs (as a function of $f$, $k$ and $n$)? This question was first studied in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03164","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:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TV+pHOWqohPhMA4cvX1bDjJC0jcNWwCbdhrG06An9NYP3PChN3JexqmQPdlT7FNyJRtBYiIXuRza7N2zf/lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:26:18.491112Z"},"content_sha256":"49fb77822971e98bbca259526e914e53ab486532aa771f8eb565291a9e5ebe3b","schema_version":"1.0","event_id":"sha256:49fb77822971e98bbca259526e914e53ab486532aa771f8eb565291a9e5ebe3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM/bundle.json","state_url":"https://pith.science/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM/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-28T01:26:18Z","links":{"resolver":"https://pith.science/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM","bundle":"https://pith.science/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM/bundle.json","state":"https://pith.science/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKFAAW5JLJ4XYQ7RVDCJGXYWSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XKFAAW5JLJ4XYQ7RVDCJGXYWSM","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":"b59249103ad6dbcd05e3af6d5af7ca941dea9b476fd1948833ac5f80ce1da765","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-09T16:03:49Z","title_canon_sha256":"a0ffed2bc3a9ff0aace1c807306370c9e729beb474756205a0983accae990b7b"},"schema_version":"1.0","source":{"id":"1710.03164","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03164","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03164v1","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03164","created_at":"2026-05-18T00:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"XKFAAW5JLJ4X","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XKFAAW5JLJ4XYQ7R","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XKFAAW5J","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:49fb77822971e98bbca259526e914e53ab486532aa771f8eb565291a9e5ebe3b","target":"graph","created_at":"2026-05-18T00:33:26Z","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":"A $k$-spanner of a graph $G$ is a sparse subgraph $H$ whose shortest path distances match those of $G$ up to a multiplicative error $k$. In this paper we study spanners that are resistant to faults. A subgraph $H \\subseteq G$ is an $f$ vertex fault tolerant (VFT) $k$-spanner if $H \\setminus F$ is a $k$-spanner of $G \\setminus F$ for any small set $F$ of $f$ vertices that might \"fail.\" One of the main questions in the area is: what is the minimum size of an $f$ fault tolerant $k$-spanner that holds for all $n$ node graphs (as a function of $f$, $k$ and $n$)? This question was first studied in t","authors_text":"Greg Bodwin, Merav Parter, Michael Dinitz, Virginia Vassilevska Williams","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-09T16:03:49Z","title":"Optimal Vertex Fault Tolerant Spanners (for fixed stretch)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03164","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:b6fa698579860496393f080d6f4912c8cf2358cf1c9a055d328e13c25bccee51","target":"record","created_at":"2026-05-18T00:33:26Z","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":"b59249103ad6dbcd05e3af6d5af7ca941dea9b476fd1948833ac5f80ce1da765","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-09T16:03:49Z","title_canon_sha256":"a0ffed2bc3a9ff0aace1c807306370c9e729beb474756205a0983accae990b7b"},"schema_version":"1.0","source":{"id":"1710.03164","kind":"arxiv","version":1}},"canonical_sha256":"ba8a005ba95a797c43f1a8c4935f169320063415b2fc71e42fb57dbb62899b8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba8a005ba95a797c43f1a8c4935f169320063415b2fc71e42fb57dbb62899b8e","first_computed_at":"2026-05-18T00:33:26.890238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:26.890238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pWIoJCx/bu3fcKwGEG69XXrIhmbXlIkNbqdjZIPijepK7+sl0dtjCHrxUDGsTUObHZvCNQe5J0Yxwj4AkWcHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:26.890873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03164","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6fa698579860496393f080d6f4912c8cf2358cf1c9a055d328e13c25bccee51","sha256:49fb77822971e98bbca259526e914e53ab486532aa771f8eb565291a9e5ebe3b"],"state_sha256":"be49f11e37bfc7bf6e96b6312ae408606955abe2b475b52c6de8525960355196"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oROoOueIAvZ5L0Wi8bZ/UlP/AkubMMOTolzoA+Q57BjvIxkf9Ei5TuTEuzTlL8V0O6NqHtSWIwQL9/8goxcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:26:18.493062Z","bundle_sha256":"62c8ea050aecd8971e0af93ccb720437fcf166bd3dbb1c78f5c7076663745ee0"}}