{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6RXV7DLPVLIAQ5JDVJ2P6YYKRL","short_pith_number":"pith:6RXV7DLP","schema_version":"1.0","canonical_sha256":"f46f5f8d6faad0087523aa74ff630a8acb0c3638e06add81c1a0c0d25180a030","source":{"kind":"arxiv","id":"2305.03697","version":2},"attestation_state":"computed","paper":{"title":"Fault-Tolerant ST-Diameter Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Keerti Choudhary, Martin Schirneck, Sarel Cohen, Simon Krogmann, Tobias Friedrich","submitted_at":"2023-05-05T17:20:00Z","abstract_excerpt":"Given two vertex sets $S$ and $T$ in a graph, the $ST$-diameter is the maximum $s$-$t$-distance between vertices $s \\in S$ and $t \\in T$. We study the problem of estimating the $ST$-diameter of graphs that are subject to a small number of transient edge failures. An $f$-edge fault-tolerant $ST$-diameter oracle ($f$-FDO-$ST$) is a data structure that preprocesses a graph $G$, sets $S$, $T$, and a positive integer $f$. When queried with a set $F$ of at most $f$ failing edges, the oracle returns an estimate $\\widehat{D}$ of the $ST$-diameter in $G-F$. The oracle is said to have stretch $\\sigma \\g"},"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":"2305.03697","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-05T17:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"883594b3953b2c99b4d576e2254a312f16a063ed3370a631452c4690e2400414","abstract_canon_sha256":"d3f806ece626e6872071dc374f2b27cbb6d8415eac15e3f3713397860104bed0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:31.724532Z","signature_b64":"MRJyyDpSErHZKbu353DiMoGHOMkE4XPA4u8s05EdCO9IpUB9YKfzzcVjo+1NyOoY2w0xK+vkcW4UOqXvMQdJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46f5f8d6faad0087523aa74ff630a8acb0c3638e06add81c1a0c0d25180a030","last_reissued_at":"2026-05-27T01:05:31.723882Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:31.723882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant ST-Diameter Oracles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o, Keerti Choudhary, Martin Schirneck, Sarel Cohen, Simon Krogmann, Tobias Friedrich","submitted_at":"2023-05-05T17:20:00Z","abstract_excerpt":"Given two vertex sets $S$ and $T$ in a graph, the $ST$-diameter is the maximum $s$-$t$-distance between vertices $s \\in S$ and $t \\in T$. We study the problem of estimating the $ST$-diameter of graphs that are subject to a small number of transient edge failures. An $f$-edge fault-tolerant $ST$-diameter oracle ($f$-FDO-$ST$) is a data structure that preprocesses a graph $G$, sets $S$, $T$, and a positive integer $f$. When queried with a set $F$ of at most $f$ failing edges, the oracle returns an estimate $\\widehat{D}$ of the $ST$-diameter in $G-F$. The oracle is said to have stretch $\\sigma \\g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.03697","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/2305.03697/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":"2305.03697","created_at":"2026-05-27T01:05:31.723942+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.03697v2","created_at":"2026-05-27T01:05:31.723942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.03697","created_at":"2026-05-27T01:05:31.723942+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RXV7DLPVLIA","created_at":"2026-05-27T01:05:31.723942+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RXV7DLPVLIAQ5JD","created_at":"2026-05-27T01:05:31.723942+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RXV7DLP","created_at":"2026-05-27T01:05:31.723942+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/6RXV7DLPVLIAQ5JDVJ2P6YYKRL","json":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL.json","graph_json":"https://pith.science/api/pith-number/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/graph.json","events_json":"https://pith.science/api/pith-number/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/events.json","paper":"https://pith.science/paper/6RXV7DLP"},"agent_actions":{"view_html":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL","download_json":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL.json","view_paper":"https://pith.science/paper/6RXV7DLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.03697&json=true","fetch_graph":"https://pith.science/api/pith-number/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/graph.json","fetch_events":"https://pith.science/api/pith-number/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/action/storage_attestation","attest_author":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/action/author_attestation","sign_citation":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/action/citation_signature","submit_replication":"https://pith.science/pith/6RXV7DLPVLIAQ5JDVJ2P6YYKRL/action/replication_record"}},"created_at":"2026-05-27T01:05:31.723942+00:00","updated_at":"2026-05-27T01:05:31.723942+00:00"}