{"as_of":"2026-08-13T02:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0c3eac2382b42ebb564d7b967e4c1e7d6b72257145d131f5f4584e2a0c105c08","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:28:47.175522Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.18312/citation-record","integrity":"/paper/2411.18312/integrity","json":"/paper/2411.18312/citation-record.json","paper":"/paper/2411.18312"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.467600Z","title":"More asymmetry yields faster matrix multiplication, 2024","venue":null,"work_id":"4aac56b2-2317-4f19-98dd-081e55c892b5","year":2024},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.075425Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:fed4b52b0f4516987c526f07a23852b2fc3b949fe23c05b5f8cf64383edbafb6","observation_id":"9370cfb6-977b-4321-b083-477f6fc42e63","resolution":{"observed_at":"2026-08-12T11:28:47.470785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.459341Z","title":"Deterministi c combinatorial replacement paths and dis- tance sensitivity oracles","venue":null,"work_id":"362f727e-373f-4287-b29b-c0089ca28914","year":2019},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.079230Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:b14c8ba8287f7fcd2337f6fc1eee30387e4e0959875cc24cde449f4a328dee1d","observation_id":"ce709489-560f-4c00-b47b-fc7933729769","resolution":{"observed_at":"2026-08-12T11:28:47.462513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.451000Z","title":"Bender and Martín Farach-Colton","venue":null,"work_id":"187d217b-867b-41d3-a796-80d9c2129bd6","year":2000},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.082869Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:5235c2a6beecbb8ac6d396b29919e27c4db508a8047d71e6dcd6246d8ac9aba2","observation_id":"b7f47a60-ea54-47c8-bed7-e34746c13143","resolution":{"observed_at":"2026-08-12T11:28:47.454015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.442524Z","title":"Improved distance sen sitivity oracles via random sampling","venue":null,"work_id":"5418441a-eb51-4997-831c-a657a3c8e31b","year":2008},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.086124Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:d8185dd5b6f8bddc648883b982e71e2625e595813e1a67ffc02e8c0bf4a0dec4","observation_id":"b5c39152-af27-4127-a458-b3c34f4f1f02","resolution":{"observed_at":"2026-08-12T11:28:47.445597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.433174Z","title":"A nearly optimal oracl e for avoiding failed vertices and edges","venue":null,"work_id":"5e467fd3-c6f6-46e5-8a01-9c712775df31","year":2009},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.089723Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:fc2a9815488ff0952e58578ac122f178ee5040090b0ca94679b5af83ec2ecbd4","observation_id":"163a9b5c-a046-406f-a917-dc17730419ed","resolution":{"observed_at":"2026-08-12T11:28:47.436442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.10293","last_updated":"2017-03-30T02:47:26Z","snapshot_observed_at":"2026-07-06T05:35:47.750465Z","submitted_at":"2017-03-30T02:47:26Z","title":"Preserving Distances in Very Faulty Graphs","version":1},"cited_work":{"arxiv_id":"1703.10293","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.10293","snapshot_observed_at":"2026-08-12T11:28:47.198192Z","title":"Preserving Distances in Very Faulty Graphs","venue":"cs.DS","work_id":"37d6fb63-8ec9-4775-acfd-899a9e235a63","year":2017},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.094234Z"},"links":{"cited_paper":"/paper/1703.10293","citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:5cbd5293951ce7d8c75e3ea95d51a6b84016bb46a591dda7875a2ff844586cee","observation_id":"077f0001-29fd-4154-b76e-1395f2567727","resolution":{"observed_at":"2026-08-12T11:28:47.204937Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.424935Z","title":"Restoration by path concatenation: fast recovery of MPLS paths","venue":null,"work_id":"728613fc-5bd1-462f-9fe8-52689a113075","year":2001},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.098817Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:77b3adb9180d2fdef1c1eebeadb4a1824c74d44144486252f048e486d5479d51","observation_id":"cfbfb987-90ab-463c-a57b-a46ced62478d","resolution":{"observed_at":"2026-08-12T11:28:47.428078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.415711Z","title":"Near optimal algorithms f or the single source replacement paths prob- lem","venue":null,"work_id":"9265515a-30b1-48c6-ac8d-72aebbf5d00f","year":2019},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.102755Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:c3ae0264a626cb3dca00f45405903dfb39c14d1e99c2d4d25b95a3efd95e86b2","observation_id":"70d5b6d2-7b31-472e-bcad-81a62bae296b","resolution":{"observed_at":"2026-08-12T11:28:47.418975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.406776Z","title":"Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem","venue":null,"work_id":"52b341d7-932f-4398-b149-afe2f7b615db","year":2020},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.106504Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:83c3d0756f99199efd725bb826fd2f967d45677840c1fc2e6bdf58c2ed2fadc4","observation_id":"2adf06c6-ceda-4d3b-b6d9-60db5f30bb8d","resolution":{"observed_at":"2026-08-12T11:28:47.409964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.397089Z","title":"Italiano","venue":null,"work_id":"15bc8d2b-7e76-49c4-9edf-8c2a74f1bc18","year":2004},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.109180Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:3ebe84c5eb943abf8dfd1ae1550615d1b394d8beb9ed2d919b6888f73f767d84","observation_id":"85127382-c28d-4c0d-8fc5-1fb9848f9c8e","resolution":{"observed_at":"2026-08-12T11:28:47.399865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.388373Z","title":"Oracles for distances avoiding a failed node or link","venue":null,"work_id":"49eafca9-d470-42d6-b2f4-10800f75e0ed","year":2008},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.111708Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:28faeedb97c168de202084893b3cdc4f4d9a4f9a66da4c387b09508903bc9d60","observation_id":"b7703172-cac5-4b27-be22-4e66c95c4fa0","resolution":{"observed_at":"2026-08-12T11:28:47.391450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.379998Z","title":"Near Optimal Algorithm for Fa ult Tolerant Distance Oracle and Single Source Replacement Path Problem","venue":null,"work_id":"d4673be3-edd4-488d-bca8-6bffb5074448","year":2022},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.114269Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:74fbc0f9e212c30f539683c4be2ab51c9fbd96d593e49f48f08421a4ab75769e","observation_id":"e5ad75d4-c252-4281-9812-0299261274da","resolution":{"observed_at":"2026-08-12T11:28:47.383054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.371253Z","title":"Nearly optimal fault toleran t distance oracle","venue":null,"work_id":"86b60a78-1ffa-4172-91a4-a2b7cde16105","year":2024},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.116889Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:fbbc73e48647a864a2eb9892c9665ec33fb2390025aca11b71edf097220354aa","observation_id":"7eab8cd2-0a05-4afb-b790-395d6ec1b487","resolution":{"observed_at":"2026-08-12T11:28:47.374357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.358383Z","title":null,"venue":null,"work_id":"4c4b4a80-82d8-4185-8242-54d0a88b9909","year":1959},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.123186Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:785d3f50f7cff2cc98e91fcc84c58441963c7e5d2a49c75ffb81e835ea8a1a35","observation_id":"4457e49e-4f22-40ed-a049-578e3a4e0df6","resolution":{"observed_at":"2026-08-12T11:28:47.361009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.350625Z","title":null,"venue":null,"work_id":"59e13963-8b2e-4a90-8211-16b00c8928a7","year":2023},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.126272Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:888da0ca5820d767da130271eaddb1471b04729e6440fc67a23aa4a78953fecd","observation_id":"3e201c6a-f839-4ddb-b436-937416d6efc1","resolution":{"observed_at":"2026-08-12T11:28:47.353351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.343026Z","title":null,"venue":null,"work_id":"0054109a-23bf-47f3-bee7-364f20a594a9","year":2023},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.128912Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:8c7c51bf1f97d1f82fd989fe09525c40fed58995b025ee2ae9a710a7afc1b00b","observation_id":"026b2f99-b868-438c-bb9c-aba9623e4e62","resolution":{"observed_at":"2026-08-12T11:28:47.345621Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.335301Z","title":"Dual-failure distance and con nectivity oracles","venue":null,"work_id":"181aa9b1-5137-4ace-9325-692b96f4db60","year":2009},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.131566Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:3a5f2b2478595963c450fe769463fcbabcccb269952973e6cc965c0cb58df1fd","observation_id":"25433144-b192-4a96-bdf2-5790249ea066","resolution":{"observed_at":"2026-08-12T11:28:47.338060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.327861Z","title":"Maintaining exact distances un der multiple edge failures","venue":null,"work_id":"90f2c037-e8ea-4a13-9cee-7d23a70c2f85","year":2022},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.134779Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:996b7819862eea52d25af38a472251d694edd500bd3b14dc3270f841a9be8ed1","observation_id":"97a8d912-0868-4005-8fa0-bed877e54514","resolution":{"observed_at":"2026-08-12T11:28:47.330490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.319181Z","title":"Improved distance sensitivi ty oracles via tree partitioning","venue":null,"work_id":"f1b72d3b-27dd-4ac5-adc7-93193895bdc7","year":2017},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.138091Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:e0b1f4d8ff8fc8840a0a2fb988a6e20763134f332ec964a61740e5ab9b6da5ac","observation_id":"d1a314f1-3634-4984-b363-cf296a343911","resolution":{"observed_at":"2026-08-12T11:28:47.323032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.311790Z","title":"Improved algorithm s for the k simple shortest paths and the re- placement paths problems","venue":null,"work_id":"24d0efc2-1363-42b0-9878-9a561b97902d","year":2009},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.140572Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:9fe9017642219099d2799d4b4ed20b226a8183e59f4e2d69556b74e7eb09b44d","observation_id":"0a171f2a-88d3-4a15-9eef-87c590bc5fd1","resolution":{"observed_at":"2026-08-12T11:28:47.314635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.303225Z","title":"Improved distance sensitivity oracles via fast single-source replacement paths","venue":null,"work_id":"5cbdab2a-1f3b-4804-b59c-f556933c7fe5","year":2012},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.144304Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:e48487cf4ddb9cac937c6ca8aee37a6771bffa0d51cfba49cbfc0d44f0ce3b8a","observation_id":"a58cb413-d291-47ce-b0da-4e05175e176e","resolution":{"observed_at":"2026-08-12T11:28:47.306730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.295337Z","title":"Faster replacement paths and distance sensitivity oracles","venue":null,"work_id":"c18d99b5-b44b-4b70-a066-8861fc602560","year":2019},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.146843Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:70505fc9ca8d13f9f86fe998e903123556e5b329501ee46ffeae08590062c691","observation_id":"937fd8ba-c4ea-4348-b8ca-a67c2526148c","resolution":{"observed_at":"2026-08-12T11:28:47.297989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.285632Z","title":"Constructing a Distance Sensiti vity Oracle in O(n2.5794M ) Time","venue":null,"work_id":"a9f15316-b511-49f6-9325-6f790b3188fb","year":2021},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.150041Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:193ce61aaac70ea8880c4a228f301842a759868a0b1c11312109955d59b77e2f","observation_id":"cf72ea55-527e-4eaf-aeb1-52eaed36daef","resolution":{"observed_at":"2026-08-12T11:28:47.288712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.277076Z","title":"Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths","venue":null,"work_id":"f74ef09f-2a6c-49b3-bafd-0c7b72e445d3","year":2021},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.152789Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:15f328a45688f2343c3332f33296618bd686efbce5308dd9f95f2215307fe23f","observation_id":"eeba13f1-e96e-4555-9ede-8d42416317c1","resolution":{"observed_at":"2026-08-12T11:28:47.280465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.267912Z","title":"A faster computation of the most vital edge of a shortest path","venue":null,"work_id":"3f2c61c3-6da3-49a6-a04d-498564421a2d","year":2001},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.155552Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:a7bd28336bfaafb40e1e95e1848fa52cda11e2f627a884a5287aa426ed69ea37","observation_id":"6a2dd451-f4b2-4431-a386-259f6d7cc28e","resolution":{"observed_at":"2026-08-12T11:28:47.271022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.258835Z","title":"Fully-dynamic-to- incremental reductions with known deletion order (e.g","venue":null,"work_id":"b2e582d8-ae80-4f38-b95c-dc4e438a5f95","year":2023},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.158570Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:ad46d7ee3cb884d92632d5c081ca7f23c36d5e83eb9d9d55e1f7b8352a34770e","observation_id":"dc1227d7-f25b-42da-97a2-1b0a6694222e","resolution":{"observed_at":"2026-08-12T11:28:47.262592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.248893Z","title":"Improved distance sensitivity oracles wit h subcubic preprocessing time","venue":null,"work_id":"346cc15f-dd43-43db-8343-531eee79a599","year":2022},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.161070Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:e30901534932da8969f5a3e044737ff3b762123e852b02ccd8706e4755d5062d","observation_id":"60cfcdd1-7d69-4bbb-94ae-9fb225e1caa3","resolution":{"observed_at":"2026-08-12T11:28:47.252464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.238533Z","title":"New bounds for matrix multiplication: from alpha to omega","venue":null,"work_id":"3eec0c59-b456-41fd-b0aa-0daffc82d225","year":2024},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.163790Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:5910aba5b04d0936003b25d1175890677dee368c4f182bbca647e011366b4c3e","observation_id":"ba100144-42b0-44df-989f-f708b600d95a","resolution":{"observed_at":"2026-08-12T11:28:47.241757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.230217Z","title":"Faster all-pairs shortest paths via cir cuit complexity","venue":null,"work_id":"bb44bda5-e04f-493b-a43b-36a999d6ee49","year":null},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.166379Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:baf8b7864a6f7d1b27894b0b908fbd62f8b58f6a77708b247b1af5e5baf8a94a","observation_id":"a25f0947-f4c0-4d8a-bf32-74806e99fa0b","resolution":{"observed_at":"2026-08-12T11:28:47.233235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.220903Z","title":"Williams, E","venue":null,"work_id":"8c2a7411-495e-4777-b973-3a96d8215ab2","year":2022},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.172395Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:b6b507dbe3e97bbacbb8525ed804ec5ebfe99f878117385764e1337cb7c38d26","observation_id":"13d9e1ef-a5eb-460c-9bfe-de26f9f9a2e8","resolution":{"observed_at":"2026-08-12T11:28:47.224227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.211062Z","title":"Ryan Williams","venue":null,"work_id":"f78ae365-d26e-4890-9738-dbd4645fcb4e","year":2018},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.175522Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:6bdd2ff8b5c6d14456565ce3b5284048954575dc117cf5b18daf38af5edc7560","observation_id":"58034eb7-7f9b-4f81-8092-85e2fefc7577","resolution":{"observed_at":"2026-08-12T11:28:47.214504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:28:47.169588Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-12T11:28:47.169588Z"},"links":{"citing_paper":"/paper/2411.18312"},"observation_digest":"sha256:e176c9e4567ad97dfc33b65ce232cb36b1d0d60281171e5bfd4f50157ea8bb03","observation_id":"2083dd11-0135-47bd-ab38-dbfadab1a4a5","resolution":{"observed_at":"2026-08-12T11:28:47.169588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.18312","last_updated":"2024-11-27T13:07:04Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T11:16:53.892084Z","submitted_at":"2024-11-27T13:07:04Z","title":"Undirected 3-Fault Replacement Path in Nearly Cubic Time"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2411.18312."}