{"as_of":"2026-08-16T22:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:628d3d093efaf0fae30fe669afd149af412609f9abd789d354fe1c2e221e29a2","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T19:16:12.195488Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2501.10632/citation-record","integrity":"/paper/2501.10632/integrity","json":"/paper/2501.10632/citation-record.json","paper":"/paper/2501.10632"},"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-10T19:16:12.468852Z","title":"Italiano, Veronika Loitzenbauer, and Nikos Parotsidis","venue":null,"work_id":"43a9a19b-616a-4391-bbf4-e2c9169a7129","year":2017},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.113637Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:fe6eb013dbe563054be081087ddfaaa805f77d4a3f8ff5a8dc2bd895cd58baf0","observation_id":"cd2e1d51-6bb5-40e7-9465-1e84bb409304","resolution":{"observed_at":"2026-08-10T19:16:12.472722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03908","last_updated":"2024-05-06T23:52:20Z","snapshot_observed_at":"2026-08-16T13:54:52.452168Z","submitted_at":"2024-05-06T23:52:20Z","title":"Deterministic Expander Routing: Faster and More Versatile","version":1},"cited_work":{"arxiv_id":"2405.03908","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.03908","snapshot_observed_at":"2026-08-10T19:16:12.243687Z","title":"Deterministic Expander Routing: Faster and More Versatile","venue":"cs.DC","work_id":"69e649a8-a64d-4e66-ae9d-254f1512e935","year":2024},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.118736Z"},"links":{"cited_paper":"/paper/2405.03908","citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:7b7f3e309169a33bc5eeea85b1330f6fb7672b0a39d926728ed895184df323f4","observation_id":"f8f77105-74fa-402f-9df3-87bf4a6108ce","resolution":{"observed_at":"2026-08-10T19:16:12.250332Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.455847Z","title":"Maximum flow and minimum-cost flow in almost-linear time","venue":null,"work_id":"61e724a4-54e4-4f23-be07-058353159a96","year":2022},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.123354Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:75b52dc753b2eeb8302daabb6cb0e5a4ae9dc14ed8b0058779f7997e89dd4bad","observation_id":"373abb1d-be52-492a-8ae9-08bbac858ac0","resolution":{"observed_at":"2026-08-10T19:16:12.460562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.442627Z","title":"Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs","venue":null,"work_id":"dd82842b-27be-4e3f-abdf-2ac39fb927d0","year":2011},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.127343Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:89a802df9c14eda57f79eac6cb75187f144d3d725e2a15442f4f07b3e8791a3d","observation_id":"923a9786-249e-4f62-bc9a-7d05bbce5d5d","resolution":{"observed_at":"2026-08-10T19:16:12.446934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13451","last_updated":"2025-01-06T11:18:07Z","snapshot_observed_at":"2026-08-16T13:08:27.575151Z","submitted_at":"2024-10-17T11:25:44Z","title":"Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13451","snapshot_observed_at":"2026-08-10T19:16:12.133454Z","title":"Parallel and distributed expander decomposition: Simple, fast, and near-optimal","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.133454Z"},"links":{"cited_paper":"/paper/2410.13451","citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:b85fcc733a35867a49d2bc6119a7b2190b09e926a574bd4d8bb7bf9bfa434055","observation_id":"70d4fd31-4bab-45f5-9ccf-7f179832c52d","resolution":{"observed_at":"2026-08-10T19:16:12.133454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:16:12.430759Z","title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","venue":null,"work_id":"ec5aec2f-6f2f-4cb5-861c-876eefa0f294","year":1970},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.138093Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:492f3b2cc42b3f31b3537ac7a4992e685ddf49e306f30b71a39af1e078552aaf","observation_id":"bedfb775-7500-4a18-b6e3-3a7eff93acaf","resolution":{"observed_at":"2026-08-10T19:16:12.434814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.418928Z","title":"Two-commodity flow is equivalent to linear programming under nearly-linear time reductions","venue":null,"work_id":"752a5668-262f-42b5-bf18-b35ea301f25a","year":2022},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.142327Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:387b1f9789f478b8b9d247448f41e28fa30333b2c6bf7ca063e0a6b22e6b739f","observation_id":"1f48b395-58cb-4905-ae63-599457e5bbb0","resolution":{"observed_at":"2026-08-10T19:16:12.423299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.407546Z","title":"Maximal flow through a network","venue":null,"work_id":"8e2c85bd-bf06-48fe-82ff-82fb4c24190f","year":1956},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.146337Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:48a6aca781141d5b5241b5ec88daea53960e71c4c33127f396f7f5a663a37185","observation_id":"f32c7b49-0d13-481a-9d44-0214d49f57c1","resolution":{"observed_at":"2026-08-10T19:16:12.411344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.396597Z","title":"Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms","venue":null,"work_id":"adbb75ee-3d7c-4f46-891c-703ce35ef032","year":2020},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.150074Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:dea0f378fc35cc1be8403b88445e4d4423aec3290b0a764dc52e180377cb3605","observation_id":"0e53532f-885e-4af7-ae0d-789c8c04a188","resolution":{"observed_at":"2026-08-10T19:16:12.400442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.153961Z","title":"Goldberg and Satish Rao","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.153961Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:9b08e08c62cd225ca420c2d99b24654e736ec737f0b7ce9003ef2e9f944378dd","observation_id":"bc6f97d7-fc0b-4f37-973c-fe4a6274f312","resolution":{"observed_at":"2026-08-10T19:16:12.153961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:16:12.378398Z","title":"Low-step multi-commodity flow emulators","venue":null,"work_id":"3348764b-cea5-4782-9d74-5854d37f0aec","year":2024},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.157670Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:c248d7996eb010b6e0dfa02c55472e151e6290a740733e03b0e41fa221c45ca6","observation_id":"519c7a44-174d-49f4-a34d-42101fee4835","resolution":{"observed_at":"2026-08-10T19:16:12.382423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.366406Z","title":"Dynamic deterministic constant-approximate distance oracles with n^ worst-case update time","venue":null,"work_id":"d786d8e0-b00e-4cd8-ab92-b91ab97c343a","year":2024},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.161397Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:7861c4ab15fc25ee1e44fce5aa44ca08d21937143b7dac10684b7632b8c731bf","observation_id":"1a2b5ebe-a445-4bf0-ace0-dc5b4f47ee6f","resolution":{"observed_at":"2026-08-10T19:16:12.370750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.354304Z","title":"Local flow partitioning for faster edge connectivity","venue":null,"work_id":"8c0c02d2-3da0-411b-ba69-9ad44745bbd3","year":2017},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.165457Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:54b002bd98d4ad2c8d8c640ee7561cca7cec0f955b87e8cab580fb019c2bc2d9","observation_id":"efa390f0-ea8e-484f-b585-57a63b4405bb","resolution":{"observed_at":"2026-08-10T19:16:12.358444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.341471Z","title":"Liu and Aaron Sidford","venue":null,"work_id":"24a97e77-dcee-4392-b5ac-f71b0e4edd23","year":2020},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.169538Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:f50e84a5d4198f6e8ec996a92a1885c7853ff54c524b19f7db67eb82a7172e79","observation_id":"97d8e93e-b7da-46a8-89b0-dc5db2485deb","resolution":{"observed_at":"2026-08-10T19:16:12.345968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.328517Z","title":"Breaking quadratic time for small vertex connectivity and an approximation scheme","venue":null,"work_id":"7993d0d1-f65a-4dfe-a53b-e7aea49a9f02","year":2019},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.172924Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:6f3c248205db98c71fe4b10a4698f2d8698f3b7f77268fea77d71dddd7c510de","observation_id":"b4ac4de7-5b00-4e25-be57-521ef5da23dc","resolution":{"observed_at":"2026-08-10T19:16:12.332949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.316479Z","title":"Flow-based algorithms for local graph clustering","venue":null,"work_id":"e1bc9f80-83b5-4222-8695-1430251c9012","year":2014},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.176391Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:7c93fc92050852f0587d7bf41c880897666b32dafc565763dfc46e5baaf36869","observation_id":"4fa6f60e-231f-45c9-b3b7-85f3ead3a61e","resolution":{"observed_at":"2026-08-10T19:16:12.320373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.305227Z","title":"Nearly maximum flows in nearly linear time","venue":null,"work_id":"c6b3dcdc-afbf-4ba6-8bb0-af036a85eaa5","year":2013},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.179947Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:98dad2db075733c1e3a25145bd7e8b477aace0fe2e8d7b62865ace400e6a6792","observation_id":"4a6f798e-0f5b-494c-b848-cbd7abfe68b2","resolution":{"observed_at":"2026-08-10T19:16:12.309096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.292449Z","title":"Area-convexity, l_ regularization, and undirected multicommodity flow","venue":null,"work_id":"e4f04f98-34d6-4069-826e-d8338e2122d1","year":2017},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.183730Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:c5f6d1803f85a78793155650922a8b1596a792335336f70a96005dbd7bb1b0bc","observation_id":"7602f123-7a27-4967-bf95-9a3d6fe49dfb","resolution":{"observed_at":"2026-08-10T19:16:12.296700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.280229Z","title":"Expander decomposition and pruning: Faster, stronger, and simpler","venue":null,"work_id":"e49e0590-73e3-46c9-8c88-087b375691bb","year":2019},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.187216Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:4b0023696613065c4bcb2b6917e6cccd28c64e6ca3a672e448b52358cb58ab4e","observation_id":"3bb341dc-439c-4f28-b8c4-c3ac11a4a3d8","resolution":{"observed_at":"2026-08-10T19:16:12.284605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-10T19:16:12.190872Z","title":"A deterministic almost-linear time algorithm for minimum-cost flow","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.190872Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:dece49b9d8566f89a2dea9d041ff5470e346367f2662b120c759f7850d73e7f5","observation_id":"db86bcfb-4859-4ff3-882e-674ee6b5a238","resolution":{"observed_at":"2026-08-10T19:16:12.190872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T19:16:12.259496Z","title":"Faster high accuracy multi-commodity flow from single-commodity techniques","venue":null,"work_id":"167816dd-f463-45a6-b9f0-8f4aa7089a9a","year":2023},"citing_paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T19:16:12.195488Z"},"links":{"citing_paper":"/paper/2501.10632"},"observation_digest":"sha256:889eaad3452dc7d661c9945245ba75cf1a1984e45b0c298fc21d1b720ff33c4e","observation_id":"2d186f25-edaa-473b-8002-e28e8500718f","resolution":{"observed_at":"2026-08-10T19:16:12.263845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.10632","last_updated":"2025-02-07T04:55:07Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T18:59:13.930970Z","submitted_at":"2025-01-18T02:21:24Z","title":"Local Sherman's Algorithm for Multi-commodity Flow"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":21},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2501.10632."}