{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NYGO66QFSMLGHQSIELWE7PBRQD","short_pith_number":"pith:NYGO66QF","schema_version":"1.0","canonical_sha256":"6e0cef7a05931663c24822ec4fbc3180fe3ab8f38cb7ca1af2abe6aa25a47038","source":{"kind":"arxiv","id":"2109.08042","version":2},"attestation_state":"computed","paper":{"title":"Vertex Fault-Tolerant Emulators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Greg Bodwin, Michael Dinitz, Yasamin Nazari","submitted_at":"2021-09-16T15:12:25Z","abstract_excerpt":"A $k$-spanner of a graph $G$ is a sparse subgraph that preserves its shortest path distances up to a multiplicative stretch factor of $k$, and a $k$-emulator is similar but not required to be a subgraph of $G$. A classic theorem by Thorup and Zwick [JACM '05] shows that, despite the extra flexibility available to emulators, the size/stretch tradeoffs for spanners and emulators are equivalent. Our main result is that this equivalence in tradeoffs no longer holds in the commonly-studied setting of graphs with vertex failures. That is: we introduce a natural definition of vertex fault-tolerant em"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2109.08042","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-16T15:12:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ad039aadca4edaf6f9229838d6717c487bd8d2d68d5265f77d3f4ac2ba1dbd93","abstract_canon_sha256":"1b09e982a10726502096363a9dc238a93c319a33cf060ce8e1adfc382df58ecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:23.497940Z","signature_b64":"jPF9L871WhT0gWA/j201OM7+UJUeY9J+TlRNKS62EJ3DB0PU9d/oBFICLN5gpv1YtLKnAC7Ciknwx2eg9Eq3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e0cef7a05931663c24822ec4fbc3180fe3ab8f38cb7ca1af2abe6aa25a47038","last_reissued_at":"2026-07-05T03:33:23.497530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:23.497530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex Fault-Tolerant Emulators","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Greg Bodwin, Michael Dinitz, Yasamin Nazari","submitted_at":"2021-09-16T15:12:25Z","abstract_excerpt":"A $k$-spanner of a graph $G$ is a sparse subgraph that preserves its shortest path distances up to a multiplicative stretch factor of $k$, and a $k$-emulator is similar but not required to be a subgraph of $G$. A classic theorem by Thorup and Zwick [JACM '05] shows that, despite the extra flexibility available to emulators, the size/stretch tradeoffs for spanners and emulators are equivalent. Our main result is that this equivalence in tradeoffs no longer holds in the commonly-studied setting of graphs with vertex failures. That is: we introduce a natural definition of vertex fault-tolerant em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.08042","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.08042/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.08042","created_at":"2026-07-05T03:33:23.497594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.08042v2","created_at":"2026-07-05T03:33:23.497594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.08042","created_at":"2026-07-05T03:33:23.497594+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYGO66QFSMLG","created_at":"2026-07-05T03:33:23.497594+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYGO66QFSMLGHQSI","created_at":"2026-07-05T03:33:23.497594+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYGO66QF","created_at":"2026-07-05T03:33:23.497594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD","json":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD.json","graph_json":"https://pith.science/api/pith-number/NYGO66QFSMLGHQSIELWE7PBRQD/graph.json","events_json":"https://pith.science/api/pith-number/NYGO66QFSMLGHQSIELWE7PBRQD/events.json","paper":"https://pith.science/paper/NYGO66QF"},"agent_actions":{"view_html":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD","download_json":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD.json","view_paper":"https://pith.science/paper/NYGO66QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.08042&json=true","fetch_graph":"https://pith.science/api/pith-number/NYGO66QFSMLGHQSIELWE7PBRQD/graph.json","fetch_events":"https://pith.science/api/pith-number/NYGO66QFSMLGHQSIELWE7PBRQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD/action/storage_attestation","attest_author":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD/action/author_attestation","sign_citation":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD/action/citation_signature","submit_replication":"https://pith.science/pith/NYGO66QFSMLGHQSIELWE7PBRQD/action/replication_record"}},"created_at":"2026-07-05T03:33:23.497594+00:00","updated_at":"2026-07-05T03:33:23.497594+00:00"}