{"as_of":"2026-08-11T07:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf9a7cd2a2286d73ccb0414bcbf1847542b7e493425065c7f11384c6a1790e0e","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T18:37:42.159809Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2502.10348/citation-record","integrity":"/paper/2502.10348/integrity","json":"/paper/2502.10348/citation-record.json","paper":"/paper/2502.10348"},"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-07T18:37:42.858200Z","title":"More asymmetry yields faster matrix multiplication","venue":null,"work_id":"a1a3aa1a-345a-4232-9d9c-6e657f784a24","year":2025},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.951182Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:8787f794332bb35083925dfb5521197ee9e399afb499fb2fabc1764c3ac79b48","observation_id":"cb049fc6-c2c9-4b72-ba7d-63f610bed205","resolution":{"observed_at":"2026-08-07T18:37:42.862680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.845207Z","title":"Algorithms and hardness for diameter in dynamic graphs","venue":null,"work_id":"3aab6935-091d-45fa-a4c0-08a7ac5bcd42","year":2019},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.956360Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:601ae842a5f4e4316c403f02756de68de29007180eb17e46ac7defb9e7ca7cea","observation_id":"1276b567-8ea1-48a1-b33d-589167ec22b6","resolution":{"observed_at":"2026-08-07T18:37:42.849583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.831696Z","title":"Italiano, Alberto Marchetti - Spaccamela, and Umberto Nanni","venue":null,"work_id":"1276c786-09c6-41cb-a453-8b9973d25c0f","year":1992},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.960534Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:d1750dd56e84ef7abf2268cfab1cdfbdd59c15c04dbb6cca45a45504991682b2","observation_id":"ec30af73-b0b5-42f0-9744-bdef8f32f9fc","resolution":{"observed_at":"2026-08-07T18:37:42.836077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.820005Z","title":"Popular conjectures imply strong lower bounds for dynamic problems","venue":null,"work_id":"5084b0ce-80fa-4016-a6ff-337ea3584a70","year":2014},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.965260Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:c64241a6c77a046360b8a4ef0ce8bd684c068cdd3d1e1c23cdcc22d60e6a55a5","observation_id":"5d491e7f-23fa-4a29-8195-c1dd98419768","resolution":{"observed_at":"2026-08-07T18:37:42.823989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.808437Z","title":"Fully dynamic shortest path reporting against an adaptive adversary","venue":null,"work_id":"2421c8e7-97bf-414a-a274-7e92db17bf52","year":2024},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.970642Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:868d02b42616599750936f6608f763f2b3325d272188a42aa496d390d5f742c9","observation_id":"d4c5a24b-e6d9-4a5e-8494-5c3c45863e44","resolution":{"observed_at":"2026-08-07T18:37:42.812758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.796039Z","title":"Consequences of faster alignment of sequences","venue":null,"work_id":"66e24052-fbed-4d2a-91a6-e86aa47365e8","year":2014},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.975297Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:32e14bb3892c705e67c142c9f63fdaf3aac584889fab4ac0b1cc4b3abd56ce64","observation_id":"fcc9ca1a-e911-4468-a05e-1c2e90b434a9","resolution":{"observed_at":"2026-08-07T18:37:42.799939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.784352Z","title":"Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time","venue":null,"work_id":"e8e09702-b78c-480a-8c2a-b213a8711b4b","year":2009},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.979588Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:81746b3c3ce30220e8250fcee3757298e9f7ae85f1953627e10cf8998ba328b3","observation_id":"b460d8fb-4256-49cf-a12e-388a100de1ec","resolution":{"observed_at":"2026-08-07T18:37:42.788246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.772844Z","title":"Maintaining shortest paths under deletions in weighted directed graphs","venue":null,"work_id":"97d70540-8a84-4230-b2e0-955ca5137711","year":2016},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.984221Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:51ebcadcdf1368bd7f6401f667663ebb73a67269715519a25b95aad27af1fd44","observation_id":"cf4e3ffb-f493-4d16-8ef0-8d3450edea35","resolution":{"observed_at":"2026-08-07T18:37:42.777177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.761327Z","title":"Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing","venue":null,"work_id":"3fddac12-5d4b-41c6-be1b-46c05ab4f454","year":2020},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.988398Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:1bc770b5d92a0965c0fb4b6dacac5a317f66da36bdc87b170f1aa154289fe99e","observation_id":"3d59751d-77e8-4dd7-b6a4-fa5040d50b7f","resolution":{"observed_at":"2026-08-07T18:37:42.765492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.748341Z","title":"Deterministic decremental SSSP and approximate min-cost flow in almost-linear time","venue":null,"work_id":"8ddf5c6f-e60a-4369-afdc-38985cc6f2f8","year":2021},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.992089Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:6c01775cdff33473fbe17a287cfd7bee9cd93ffa67345e05ec5d3ef6c4747dc9","observation_id":"1ac120f0-8449-4761-b8db-154822a6430e","resolution":{"observed_at":"2026-08-07T18:37:42.752883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.731908Z","title":"Near-optimal decremental SSSP in dense weighted digraphs","venue":null,"work_id":"68f50e69-8a68-4674-a4e0-ef091a8953d5","year":2020},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.995966Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:918715f1ad9e592a52e8938d80f1360d617d69e3a79384cc06d1fe1324466c7a","observation_id":"dc2fd602-78b9-43b8-88ee-5783bd3bdd80","resolution":{"observed_at":"2026-08-07T18:37:42.736884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.718078Z","title":null,"venue":null,"work_id":"70ae4e7a-5e32-40d0-bdbb-565b1dc0890e","year":2004},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:41.999680Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:9672d698b648fb5b9932c1d6fc0248643d117d441ee7eaf9287db86cfd06b9e2","observation_id":"de2d31de-a140-4036-84da-6071545f3c6e","resolution":{"observed_at":"2026-08-07T18:37:42.722384Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.705780Z","title":"Improving viterbi is hard: Better runtimes imply faster clique algorithms","venue":null,"work_id":"1eb9f3fe-5c80-4df8-9342-b57ae9cab1bf","year":2017},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.004715Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:71c4a41de2a51ed6ae755068396ea63bb43e6c738c5c66535b4c46a072f8d437","observation_id":"cce67aae-e20e-49c2-a83b-1603be626eea","resolution":{"observed_at":"2026-08-07T18:37:42.709968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.690536Z","title":"Near-optimal approximate decremental all pairs shortest paths","venue":null,"work_id":"6325080e-8c1f-4e14-b5c5-587d59140551","year":2018},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.008521Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:45c29dcc0bce624aba89bab691ea70717d95701a56dfec9d794d21d3d036b8e3","observation_id":"4dac278b-e4d9-4869-90a5-df9afba346b5","resolution":{"observed_at":"2026-08-07T18:37:42.696411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.677852Z","title":"Liu, Simon Meierhans, and Maximilian Probst Gutenberg","venue":null,"work_id":"d71e938d-5fe4-4e39-b484-14b91a20e51b","year":2024},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.012196Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:681fada8b7abb5ed45aabaae2959c9fd5e5b979d6de3e6629b130d8db1b88264","observation_id":"cdd9bbdb-9db8-46d2-a2e6-fe9cb002e7b6","resolution":{"observed_at":"2026-08-07T18:37:42.682124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.665640Z","title":"Incremental single source shortest paths in sparse digraphs","venue":null,"work_id":"b20a0b28-9c96-4333-9bfd-0102291f4739","year":2021},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.016272Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:181272ae6da3b714765d31048ba65bb0c35c7e5e343466f25d0acc38eed2c988","observation_id":"ff4449ec-7803-42bd-b006-ddbf60bd301d","resolution":{"observed_at":"2026-08-07T18:37:42.669958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.653062Z","title":"Faster deterministic worst-case fully dynamic all-pairs shortest paths via decremental hop-restricted shortest paths","venue":null,"work_id":"3472fd63-4f55-4964-b4c1-76c62b758708","year":2023},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.020576Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:f0ba704bb1b49c645ee256a90f388e42837715c9990101198a8a0a4f8a2222ca","observation_id":"59bdbe3a-490e-422a-b683-02993605d72a","resolution":{"observed_at":"2026-08-07T18:37:42.657511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.640406Z","title":"New tradeoffs for decremental approximate all-pairs shortest paths","venue":null,"work_id":"ee52e495-d04c-4308-ae7a-f3f29bcb1eed","year":2024},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.024381Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:93e27e037f56856c2d0247d3ff74a7cee08f4256003e96e324c4036e06f460bb","observation_id":"2a460280-eb3c-4e35-b9a7-18486ace9da6","resolution":{"observed_at":"2026-08-07T18:37:42.644936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.627499Z","title":"Italiano","venue":null,"work_id":"a65921a3-c3ba-4587-8f3f-821358d50639","year":2004},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.028331Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:b97e911f0997c9f767e2fee6302b9abe711e574ee55fb4736a332d376dc41723","observation_id":"00ada52d-1493-41a1-ae4d-2cc5c0e1d263","resolution":{"observed_at":"2026-08-07T18:37:42.631688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.614862Z","title":"Bounded-leg distance and reachability oracles","venue":null,"work_id":"49587237-6f1b-4ed7-a8f6-618e5a0445b8","year":2008},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.033309Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:89abbb891d217fc08e21951daead23e5ce63be8c1c48c4bdada2f7ad41b7c45d","observation_id":"9e5d352f-5ec0-42a9-8fbf-aa4349ecc56a","resolution":{"observed_at":"2026-08-07T18:37:42.619174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.600389Z","title":"Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time","venue":null,"work_id":"b1d1611c-61f5-44ba-83b8-2d49ebee6316","year":2018},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.038521Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:3098b8afe597fbd8e3d73a2b9906688b99fb362b88dcb115256bc2f4babb7f33","observation_id":"7f57c86f-5483-4d56-90c4-0e195f30d8d6","resolution":{"observed_at":"2026-08-07T18:37:42.606037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.585668Z","title":"Driscoll, Neil Sarnak, Daniel Dominic Sleator, and Robert Endre Tarjan","venue":null,"work_id":"d40f4d21-8b9b-45fc-84e0-a690e3b8754a","year":1989},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.044167Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:b0a24ac75dd1a05cd1f9dce6cafee2583e4a391c74e6c21229045b33ba3e9c50","observation_id":"e2b8a1a4-2f75-47c0-9b1a-b08da80f808f","resolution":{"observed_at":"2026-08-07T18:37:42.590917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.572007Z","title":"An on-line edge-deletion problem","venue":null,"work_id":"f148f812-0f73-401e-a521-3cd27f6f5c5a","year":1981},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.048961Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:ce17be23b734e6e1ac955d53f6cb0e7f03f0572cf3bf96f13c41867b6ac01d1d","observation_id":"f267d42a-6871-446d-95d9-5adc50cb4504","resolution":{"observed_at":"2026-08-07T18:37:42.576546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.553791Z","title":"Bootstrapping dynamic distance oracles","venue":null,"work_id":"c65cb73a-1804-4948-aab9-56c4d886f55d","year":2023},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.053522Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:833dd71c9e7be90697b323cb092fca55d548e7d9dfdd5b05ff6ac2d55d0ef7e8","observation_id":"2919eb38-efe0-4fa7-8ae9-e3f60f1dc567","resolution":{"observed_at":"2026-08-07T18:37:42.559538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.536364Z","title":"Deterministic incremental APSP with polylogarithmic update time and stretch","venue":null,"work_id":"7333d040-7aef-4b40-a0d0-6bda2f7487ed","year":2023},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.058314Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:2b70183f02a7c2a221b135ceda7dcbe6d71aa135113274338acd545f6d405abb","observation_id":"374f82ff-932d-4d0b-bf1a-9e2693f14f97","resolution":{"observed_at":"2026-08-07T18:37:42.543073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.518559Z","title":"New algorithms and hardness for incremental single-source shortest paths in directed graphs","venue":null,"work_id":"14615af2-789b-48b8-b3e5-befb744d7097","year":2020},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.063059Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:014d21dab69bd164c781690b63e7adec7846f57e1589c1903e40131e0c04c6a6","observation_id":"f61ad043-3c9a-425d-89d9-876c94c30f4b","resolution":{"observed_at":"2026-08-07T18:37:42.523674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.501861Z","title":"Fully dynamic biconnectivity and transitive closure","venue":null,"work_id":"b524d3cc-70c8-49e6-9dd0-5f56ea4fc053","year":1995},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.067792Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:3efb3bd5224532d8cd1af40290629e0e345b419e3f26fcf7cbcb647423e77873","observation_id":"548bde8a-f9c0-4d6e-a54f-5db3aa3d093e","resolution":{"observed_at":"2026-08-07T18:37:42.508134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.484757Z","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","venue":null,"work_id":"6f9c7780-f445-4286-b8d2-dd66131fc4a0","year":2014},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.073145Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:43038addfb8e72d44895637e782032276e5389cd44d91e45095f2fa7ef97407a","observation_id":"e046ee53-8625-428a-92a0-f54e4aaeb4e2","resolution":{"observed_at":"2026-08-07T18:37:42.491012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.466922Z","title":"Improved algorithms for decremental single-source reachability on directed graphs","venue":null,"work_id":"62e6ca87-85a6-41a3-bc40-957366481e09","year":2015},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.078113Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:1788deeb2f2ebc45bcb690d15b69ccff2f7f397c24f14c2fd517c2eeec1cf8a5","observation_id":"30e6429f-4c6c-4073-8339-9445a7d0246f","resolution":{"observed_at":"2026-08-07T18:37:42.472921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.450147Z","title":"Dynamic deterministic constant-approximate distance oracles with n\\( ^ \\( \\) \\) worst-case update time","venue":null,"work_id":"f9385c51-dfa3-4535-915f-c3bd95818c24","year":2024},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.082785Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:762ec42dcdf83bb8cfa85337161128f5a7bcaebfb0d918c2ee4428de49b032bd","observation_id":"b2a9f80f-3642-4664-ae8d-368e85c9c07d","resolution":{"observed_at":"2026-08-07T18:37:42.456090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.430933Z","title":"Italiano","venue":null,"work_id":"062ad936-666b-4ad8-b7ab-3552a3f2205e","year":1986},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.087100Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:712a35f6e121ce6561c5a8c0de1ca46d024daadaf659b1f2238f621ce3cd60dd","observation_id":"58a6756b-72af-48da-be01-0527196f3c3b","resolution":{"observed_at":"2026-08-07T18:37:42.437315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.412556Z","title":"Tight dynamic problem lower bounds from generalized BMM and omv","venue":null,"work_id":"01417f7f-436f-4ea9-8d43-50c825b7b873","year":2022},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.091619Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:4854d659560da2a8ef5847a0d941fee82ca5557676c19746733c3caf9270420e","observation_id":"1d51903c-c2fe-445e-a013-abaed30fe335","resolution":{"observed_at":"2026-08-07T18:37:42.417982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.393493Z","title":"Reliable hubs for partially-dynamic all-pairs shortest paths in directed graphs","venue":null,"work_id":"a5386b5b-5b63-4ad1-84f1-cb73cdb9bf51","year":2019},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.097081Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:95cb2212051e0ae32d2ed2604b9dd8d1bd9e00235b889e2d7c3da539889acbf2","observation_id":"d6bebc74-0295-4338-8884-fcd6b25a0586","resolution":{"observed_at":"2026-08-07T18:37:42.401049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.376605Z","title":"Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs","venue":null,"work_id":"bdcd7d4c-eb60-4db3-bc47-d09897521a87","year":2020},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.102560Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:27a15aafc6482966f6032079e0376cb61e43801f6bb77dcc181024d99aeb35fd","observation_id":"a3ff9043-61a1-4fdc-abd3-6b335c3a2052","resolution":{"observed_at":"2026-08-07T18:37:42.382428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.358424Z","title":"Incremental SSSP for sparse digraphs beyond the hopset barrier","venue":null,"work_id":"35b02254-5258-4622-bf0b-2f20e01b5a6a","year":2022},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.107670Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:6c7fc7ab58830e313aebe904890f0e1591969ef2efafd6488cedd5184f000542","observation_id":"1813467d-0ac0-4e21-bd3d-7c1cfc16662c","resolution":{"observed_at":"2026-08-07T18:37:42.364668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.341908Z","title":"A dynamic shortest paths toolbox: Low-congestion vertex sparsifiers and their applications","venue":null,"work_id":"c6ecb2aa-3c35-49d1-ac7a-49fec394c44a","year":2024},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.112587Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:ec18d35b3c40f37adc31b5ca740a47cfebda76a968639b0aba0b772db18c7ef5","observation_id":"0face4a8-f4b8-44c6-ad97-97be2bcf746d","resolution":{"observed_at":"2026-08-07T18:37:42.347313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.327712Z","title":"Ryan Williams","venue":null,"work_id":"da2a9537-0b8d-43f5-8e2c-71a1fc8f4031","year":2018},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.117235Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:0a2180cecc8ac40d4650d099e6ea2ebbd229c3ba87c4d6f373008d0bda4f7157","observation_id":"c2b24f47-29ee-42ac-9830-870b199f63af","resolution":{"observed_at":"2026-08-07T18:37:42.332722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.312828Z","title":"Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms","venue":null,"work_id":"ef2d7464-2d6a-454f-b75e-3ae495aa60cf","year":2010},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.122081Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:ac21b26b426df47c9b7a0f38686ebc1df605c394d78fec79a691174c3873016a","observation_id":"1d71a9ce-a188-4ee3-9fad-9080488bab92","resolution":{"observed_at":"2026-08-07T18:37:42.318007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.297118Z","title":"Fully dynamic all-pairs shortest paths: Likely optimal worst-case update time","venue":null,"work_id":"c7446ff5-e6b1-4834-b82a-ca06fe6711d7","year":2024},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.126748Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:a97ecf8afefe4e3031d6a1c9964c22959153d6fc4b1a4c7c2a739ccff704c26c","observation_id":"8ae3ed51-6c21-4c7c-936e-36961d8ef966","resolution":{"observed_at":"2026-08-07T18:37:42.302041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08125","last_updated":"2025-02-12T05:06:23Z","snapshot_observed_at":"2026-08-08T10:18:15.644082Z","submitted_at":"2025-02-12T05:06:23Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","version":1},"cited_work":{"arxiv_id":"2502.08125","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08125","snapshot_observed_at":"2026-08-07T18:37:42.198411Z","title":"Incremental Approximate Single-Source Shortest Paths with Predictions","venue":"cs.DS","work_id":"bc11841b-591a-4086-a21b-a8ee404a7bbb","year":2025},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.131811Z"},"links":{"cited_paper":"/paper/2502.08125","citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:eb0c43dc0d2c506c7c0afbe3560046d969c7941b519621088e65ca221305adb6","observation_id":"4073fbfc-0a0a-4f76-9d71-cacfe8a7eac3","resolution":{"observed_at":"2026-08-07T18:37:42.206393Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.280734Z","title":"On bounded leg shortest paths problems","venue":null,"work_id":"0132166e-b650-45f5-8676-6f5dde2928ae","year":2011},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.136930Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:922df66e23eb27907a17c8f83acd6dfe296ce6113e60504860bc03fbd271fe05","observation_id":"f6a9d94e-11f2-4a64-9e19-dbdaffe48abb","resolution":{"observed_at":"2026-08-07T18:37:42.285872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.266788Z","title":"On dynamic shortest paths problems","venue":null,"work_id":"2c828bd4-6474-4eba-85f6-2da408ecc06e","year":2011},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.144368Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:61303b4f885a74f09c634dcd7e2e5d77c32b050e9b175fda7891fe31f2a2648b","observation_id":"79a504db-10e4-46e0-897d-23f08748f01a","resolution":{"observed_at":"2026-08-07T18:37:42.271629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.248672Z","title":"Combining all pairs shortest paths and all pairs bottleneck paths problems","venue":null,"work_id":"0347a10a-6cc7-43c7-8585-418d3dfba5ea","year":2014},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.149174Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:fc4cfcda968e17e7db4f58c5e9cd999f73970f3f50ad5c41b158600e6e029f97","observation_id":"7ee300e0-8cb1-4829-8f6f-e8fb6afea5fd","resolution":{"observed_at":"2026-08-07T18:37:42.255752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.230472Z","title":"Fine-grained optimality of partially dynamic shortest paths and more","venue":null,"work_id":"1456e4c6-6efb-490e-8232-be9886372cf2","year":2025},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.154249Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:214f5c7297d24c051992bb5cebe3fd128d820cefd3ce3cebb4e225d316f20be0","observation_id":"8c7f4e2d-ebfa-459a-815d-2d4e9345aa53","resolution":{"observed_at":"2026-08-07T18:37:42.235255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-07T18:37:42.216841Z","title":"Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time","venue":null,"work_id":"50f17d4a-3fe6-42aa-9108-fb0746923764","year":2019},"citing_paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T18:37:42.159809Z"},"links":{"citing_paper":"/paper/2502.10348"},"observation_digest":"sha256:e0dbffa5dbfd44c618db2ab3335fb8d09eed88164ec0c98a8d5e990ffc84094d","observation_id":"e6a41bd7-1f7c-44ec-8dd0-b25f171e0e4a","resolution":{"observed_at":"2026-08-07T18:37:42.221739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.10348","last_updated":"2025-02-14T18:20:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T18:21:09.152770Z","submitted_at":"2025-02-14T18:20:45Z","title":"On Incremental Approximate Shortest Paths in Directed Graphs"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":43},"total_outbound_references":45},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2502.10348."}