{"as_of":"2026-08-19T03:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a1c461df94160cb927472af775cdb04e36c64646ec91c0c0cca156acb66fa5e","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:29:34.802178Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:19:01.890154Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T04:19:07.164880Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"cited_work":{"arxiv_id":"2506.20017","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.20017","snapshot_observed_at":"2026-08-14T04:19:07.164880Z","title":"All-Pairs Shortest Paths with Few Weights per Node","venue":"cs.DS","work_id":"fd29e3bf-fc85-4601-aa5e-1049b1524b62","year":2025},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-19T01:22:14.174611Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":193,"source":"pdf_text","source_observed_at":"2026-08-14T04:19:01.890154Z"},"links":{"cited_paper":"/paper/2506.20017","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:12e47a0a6599d43f87178632c5b97107648300c5ae42ec6e166ff8bd5d5bbc07","observation_id":"310735e1-3b04-4d62-8942-8428409cc848","resolution":{"observed_at":"2026-08-14T04:19:07.194910Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.20017/citation-record","integrity":"/paper/2506.20017/integrity","json":"/paper/2506.20017/citation-record.json","paper":"/paper/2506.20017"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.16349","last_updated":"2024-10-20T04:13:13Z","snapshot_observed_at":"2026-08-18T06:46:21.822351Z","submitted_at":"2024-04-25T05:59:44Z","title":"More Asymmetry Yields Faster Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16349","snapshot_observed_at":"2026-08-15T18:29:34.541186Z","title":"More asymmetry yields faster matrix multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.541186Z"},"links":{"cited_paper":"/paper/2404.16349","citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:7236e59b5ac9fc5eb13c43771c979ed90c62e52299a16b9fff8a9ecf63921002","observation_id":"d137e09d-2433-4c90-9318-4ce7cd7a033a","resolution":{"observed_at":"2026-08-15T18:29:34.541186Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.547025Z","title":"On the exponent of the all pairs shortest path problem","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.547025Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:8b348de536c74ad92b60a1df4200d883ae00f9833284799eb1286b09448b5882","observation_id":"13d6efdd-c9cd-4e6c-921a-88740e241ec6","resolution":{"observed_at":"2026-08-15T18:29:34.547025Z","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":"10.1145/3563393","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.183487Z","title":"Subcubic equivalences between graph centrality problems, apsp, and diameter","venue":null,"work_id":"3a3db162-7046-4849-b801-cda4925907c2","year":2023},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.551787Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:b87b3d7b0461f9663f3b5e7a7cd31a1f7bf8222e8215e1a3dab55f5206e86905","observation_id":"9d2bed86-e8b3-46f4-b0da-21713cd50c68","resolution":{"observed_at":"2026-08-15T18:29:35.188055Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:36.607566Z","title":"New algorithms and lower bounds for all-pairs max-flow in undirected graphs","venue":null,"work_id":"92bdab3f-5609-44e7-b0e5-f3b1991fe173","year":2021},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.557002Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:2d563b4b27b8d2aa75316e79e34f2bef9c248379baac30601799b9a1aa06baff","observation_id":"23b24c0d-e70b-4210-a417-f5c1e3a2685d","resolution":{"observed_at":"2026-08-15T18:29:36.612290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.561536Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.561536Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:dc8d85de439f1cf4f54e8d83d896a0689d66e8f20996563483af92ee1494539d","observation_id":"db17d869-cf2a-4825-96bf-445160f62c47","resolution":{"observed_at":"2026-08-15T18:29:34.561536Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.565990Z","title":"Popular conjectures imply strong lower bounds for dynamic problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.565990Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:252d4fbcefd9d865234fbd23230161c27ca60595effc6ccaee3ad3f6bfc9860e","observation_id":"6990d705-5c34-47a4-ab28-c5f6e53cef50","resolution":{"observed_at":"2026-08-15T18:29:34.565990Z","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":"10.1137/15m1050987","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.161754Z","title":"Matching triangles and basing hardness on an extremely popular conjecture","venue":null,"work_id":"c61c372d-459c-44ae-a6a1-55a928213580","year":2018},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.570933Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:b6731b49598ecee061151cbbf9005d3340180b993aa85454e165a30dc16533ad","observation_id":"7f2e7fe3-1250-4d0a-8816-84b6d15a5d44","resolution":{"observed_at":"2026-08-15T18:29:35.166011Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.576469Z","title":"Negative-weight single-source shortest paths in near-linear time: Now faster! In 64th IEEE Annual Symposium on Foundations of Computer Science ( FOCS 2023) , pages 515--538","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.576469Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:6fb4dd738680fc4e54484a194b1de1c6285d7faf20af13d6cd39086a9b79d586","observation_id":"539f8d44-e2db-433e-a40b-b56420058a52","resolution":{"observed_at":"2026-08-15T18:29:34.576469Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.580586Z","title":"Sparse nonnegative convolution is equivalent to dense nonnegative convolution","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.580586Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:bfdb904aed6ea8f763a55f8845cc368aef758f35759a6cb15a2ec464983d4715","observation_id":"f46e259a-ee26-4563-851d-0f894dc48a86","resolution":{"observed_at":"2026-08-15T18:29:34.580586Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.584839Z","title":"Deterministic and las vegas algorithms for sparse nonnegative convolution","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.584839Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:dc22c844c897c8dd4b4b2ab70c23d7a745c6652fc4ab685b5bcdbe2291896a6b","observation_id":"038fc88b-193e-4650-9aae-5d3369fb3d2f","resolution":{"observed_at":"2026-08-15T18:29:34.584839Z","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":"10.1145/3381878","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.138263Z","title":"Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)","venue":null,"work_id":"26f16e63-cece-4577-8ad9-f7f1ff8c791a","year":2020},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.589387Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:86e20710bbeda938d05085aa58cbe63f9b587af5920f39f6efe3954ea7d40b55","observation_id":"b1acd6b4-21f8-4eaf-9c2c-aa64b742edbf","resolution":{"observed_at":"2026-08-15T18:29:35.143715Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2016.48","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.124380Z","title":"Truly sub-cubic algorithms for language edit distance and rna-folding via fast bounded-difference min-plus product","venue":null,"work_id":"fdf3ac50-ec39-4bea-aa4e-5cd52a882aa6","year":2016},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.593955Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:44a890850edf3de32015185a4768c7d250733bf004590d29e5a3e5e95616fab5","observation_id":"a455573e-524c-4e4e-820d-1c3ecf60ed0e","resolution":{"observed_at":"2026-08-15T18:29:35.129094Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.598557Z","title":"Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.598557Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:38cfc6918d3d3f8c00529a32bdab90cc7cd1d6ad96755433985db0e6f265f865","observation_id":"c2f991e0-4fd1-4666-81d7-bc13648e78a8","resolution":{"observed_at":"2026-08-15T18:29:34.598557Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.608082Z","title":"The complexity of partial derivatives","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.608082Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:dc4e2d4029c5a80ad6c02f7e67076b21f63bd5a98fdd676939aee2716549c962","observation_id":"186f68b4-63ec-4efa-a641-511f68dd35dd","resolution":{"observed_at":"2026-08-15T18:29:34.608082Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.612412Z","title":"A statistical theorem of set addition","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.612412Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:1aad4a0ae837536dc47aa2afff057fe5cb9433820e641b5ed532cf82d7c1d3a3","observation_id":"db0e7856-5f45-4354-8225-e2fb52de4dd3","resolution":{"observed_at":"2026-08-15T18:29:34.612412Z","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-15T18:29:36.593235Z","title":"Improving viterbi is hard: Better runtimes imply faster clique algorithms","venue":null,"work_id":"a862ffba-5213-4150-80d2-64ead2e788a2","year":2017},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.616056Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:3653e5d49954c214bdd2875686e10081f613e7f4a9049c118b83bca396e66b6b","observation_id":"165dfc43-1eb6-4789-b1f3-5cd5c39c6de3","resolution":{"observed_at":"2026-08-15T18:29:36.598098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.619777Z","title":"Faster algorithms for bounded-difference min-plus product","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.619777Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:1dddf606643e9efb9cb85d64afbeb7fdca3f88b5f93938a1ebe6bce22484a107","observation_id":"659b6284-f8a2-4a78-bbec-cab3656f51d8","resolution":{"observed_at":"2026-08-15T18:29:34.619777Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.624207Z","title":"Faster min-plus product for monotone instances","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.624207Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:ce7a18626bc8c9667419b8e39d199b9c315886ae188869453b9af38b8869b0a3","observation_id":"c4da47fd-9b06-43d9-a688-0259ff7c652a","resolution":{"observed_at":"2026-08-15T18:29:34.624207Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.628841Z","title":"Verifying candidate matches in sparse and wildcard matching","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.628841Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:93efa01c1308e7908086fc29719d5b954402a6e4355401650876a26e5400dc93","observation_id":"b65b296e-ebb9-4102-b269-3b27dc3b3f7b","resolution":{"observed_at":"2026-08-15T18:29:34.628841Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.633575Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.633575Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:5992658e63933367f6b437ea4e55a33b67bf9a93857c7c70dfc6fdcd20dc3b14","observation_id":"23fdab1e-7086-4d70-af65-7be70bc70963","resolution":{"observed_at":"2026-08-15T18:29:34.633575Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.638312Z","title":"A greedy heuristic for the set-covering problem","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.638312Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:c555acd4c4baea3fc1eb6e69881f7df19e88bf03b8e2e3989b1c055425a13c20","observation_id":"848eecf2-cc3e-4c5c-8f16-4c06c0c34095","resolution":{"observed_at":"2026-08-15T18:29:34.638312Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.643418Z","title":"Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.643418Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:e51ff01a0d817cc53af1342819b0618e47f5f7231dd9849e66eb66f0a8be0b7a","observation_id":"6ce8e99a-a2af-4df8-9516-1b8e4c137398","resolution":{"observed_at":"2026-08-15T18:29:34.643418Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.647844Z","title":"Chan and Moshe Lewenstein","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.647844Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:cb8184f8fcc8da9bf3dc21e13e1ccf1343a0c4e61aa76c97adc00973db01c583","observation_id":"d98c2c8e-8b0c-484a-bb30-04ae2d1e6402","resolution":{"observed_at":"2026-08-15T18:29:34.647844Z","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":"10.4230/lipics.icalp.2021.47","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.045628Z","title":"Chan, Virginia Vassilevska Williams , and Yinzhan Xu","venue":null,"work_id":"4e10e870-5769-4ed9-838e-fbc798a0ddb4","year":2021},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.652810Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:7b498168f0b48edc3e93b6c8ed021a16d96e849206511a8377f4fa165cfe2628","observation_id":"9f932b7c-ae9e-47c6-9263-3c6c0f4111fe","resolution":{"observed_at":"2026-08-15T18:29:35.051227Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.657298Z","title":"Chan, Virginia Vassilevska Williams , and Yinzhan Xu","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.657298Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:92dd1116f1de4a219844c522af1358d7f1132db04fbaeb619b7cfc2d25c5ef44","observation_id":"1fbe4b76-ad00-4959-81cf-c193b431997a","resolution":{"observed_at":"2026-08-15T18:29:34.657298Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.662569Z","title":"Faster algorithms for dual-failure replacement paths","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.662569Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:874e0030228113df32ce1f97d42bb3b1c361a2d272bc6c239d4421b9e2753ecc","observation_id":"5cf6191e-d09c-48da-9f81-b75983938191","resolution":{"observed_at":"2026-08-15T18:29:34.662569Z","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":"10.4230/lipics.icalp.2019.48","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.021566Z","title":"Faster algorithms for all pairs non-decreasing paths problem","venue":null,"work_id":"05f7dddd-d78a-42cb-918a-a643c53005dc","year":2019},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.667775Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:3162fa48eba49f34723b3dd9863bb770abb815bf753026d5361f3320e4b45919","observation_id":"bf94a5b5-7d70-4424-b355-751f3d8f1c83","resolution":{"observed_at":"2026-08-15T18:29:35.026376Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.672667Z","title":"Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.672667Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:25eec2d2c5a5df31bbf1e88af4a75d579d95a0929d83ae5fe2c1386cd177081e","observation_id":"4de80614-7a22-40f5-bd52-b9881aec3cdd","resolution":{"observed_at":"2026-08-15T18:29:34.672667Z","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":"2023.10635","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.965728Z","title":"Improved bounds for rectangular monotone min-plus product and applications","venue":null,"work_id":"124a8555-0be9-4478-bce7-110c60b414f5","year":2023},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.677547Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:e2e90ff1a969736d26a0084ed5a2860ded594090882d04dd84aafa819dc61047","observation_id":"2422136b-6c92-4b30-a715-abcb8b8f58cd","resolution":{"observed_at":"2026-08-15T18:29:35.973936Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977912.119","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.996157Z","title":"Deterministic sparse pattern matching via the Baur - Strassen theorem","venue":null,"work_id":"d4fbe81c-250f-4c3f-b8e2-c9142bfa898b","year":2024},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.682790Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:e4f66b747fce29b08285fa65196ed9e6becb37c43e3af17019674fdad96dbe25","observation_id":"35ca57c9-2021-4beb-8b9b-e975088dd68d","resolution":{"observed_at":"2026-08-15T18:29:35.001109Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20764","last_updated":"2024-10-28T06:02:12Z","snapshot_observed_at":"2026-08-16T13:05:30.437702Z","submitted_at":"2024-10-28T06:02:12Z","title":"New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching","version":1},"cited_work":{"arxiv_id":"2410.20764","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.20764","snapshot_observed_at":"2026-08-15T18:29:35.896272Z","title":"New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching","venue":"cs.DS","work_id":"b7a3105a-44fc-4745-9dd5-1b6e62615e48","year":2024},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.687430Z"},"links":{"cited_paper":"/paper/2410.20764","citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:434568bc202da5355197e70d1b95f4aed4b93e2c2e4f5fa336e8d6d83554079d","observation_id":"1c64afc2-b179-419f-b30a-d3db5fad4d05","resolution":{"observed_at":"2026-08-15T18:29:35.901673Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.691628Z","title":"Fischer and Albert R","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.691628Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:c6a7769ee752d8b23c6a1363a9fc6a8cdda391122f7862dbf6ef86242026c3ed","observation_id":"46ead723-8f09-4246-a970-02a5a28852cc","resolution":{"observed_at":"2026-08-15T18:29:34.691628Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.695413Z","title":"Essentially optimal sparse polynomial multiplication","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.695413Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:3d16f0d2da923dfda498e72054b4fd310c6ae518fd68908a29891271d1ebbd1d","observation_id":"35444d8d-138b-4d6c-aa1a-5fd0a0d1f69a","resolution":{"observed_at":"2026-08-15T18:29:34.695413Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.699182Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.699182Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:1ab5e9905374fcbe339cd5ea70b86d333025d8f197883142736cc666bfc68364","observation_id":"5dd40d44-6373-46e5-90a0-0a410e69a916","resolution":{"observed_at":"2026-08-15T18:29:34.699182Z","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":"10.1016/j.dam.2006.08.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.961941Z","title":"Flow trees for vertex-capacitated networks","venue":null,"work_id":"f0214af9-6c0c-488a-87b7-ef0edfc0ce20","year":2007},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.703252Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:4105dba4c302640dfb118c37077bc918606a0ab8c6c56ed8ff18c2e927cddea8","observation_id":"b024528d-0f98-452e-9f88-0dcf015ff5fe","resolution":{"observed_at":"2026-08-15T18:29:34.966756Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1999.1055","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.813126Z","title":null,"venue":null,"work_id":"330dc739-2dfb-4ba2-b1b7-0e57f58c4cd7","year":2000},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.707120Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:cd924793bc0fabf224a46d68ae6956d41d10a0b54c14e5061f437989dcd6c010","observation_id":"494bed69-bc97-4fc3-8362-0291c61ff69b","resolution":{"observed_at":"2026-08-15T18:29:35.820172Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.711406Z","title":"Shaving logs via large sieve inequality: Faster algorithms for sparse convolution and more","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.711406Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:3425b19eb24294156f7dd1e0bcb2dcf6176e82693a62008bca528b8e0cf4b4a0","observation_id":"2c7b7786-67af-48a3-8c70-e297fb1e2cb3","resolution":{"observed_at":"2026-08-15T18:29:34.711406Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.715604Z","title":"LCA queries in directed acyclic graphs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.715604Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:708d9f1418a43efb023c881111059c1761d66056a527df1042d08a8c25603043","observation_id":"a3a4c5e5-a084-432e-8c1c-fb926a214f5c","resolution":{"observed_at":"2026-08-15T18:29:34.715604Z","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":"2410.16784","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:35.686332Z","title":"3SUM in preprocessed universes: Faster and simpler","venue":null,"work_id":"4387e5f7-421e-4652-8091-d5c2046de728","year":2025},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.720543Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:7b8e6e80b8fcba73a2d82f97a5e65a4a528d3cf2f59b4df64af34ac12351e425","observation_id":"424355cb-9199-457f-8dd6-bd33b223e90e","resolution":{"observed_at":"2026-08-15T18:29:35.696641Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.724971Z","title":"On the ratio of optimal integral and fractional covers","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.724971Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:a69fe7c02297a08d0b43395237d410f5f422e90f75a698396f6d301124ba0540","observation_id":"6461cda1-1061-445b-b486-65a09460a1be","resolution":{"observed_at":"2026-08-15T18:29:34.724971Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.730053Z","title":"Monochromatic triangles, intermediate matrix products, and convolutions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.730053Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:113eeee8d2ce38913bb7e17431d02afe7cad9e68b1b47d26f5b978d174c30ecf","observation_id":"669f6545-df8a-4177-9555-e5871344822d","resolution":{"observed_at":"2026-08-15T18:29:34.730053Z","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":"10.1016/0020-0190(91)90071-o","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.918623Z","title":"Computing dominances in e \\^ n","venue":null,"work_id":"9be8599f-cb21-428a-aa49-a55e880b4fb2","year":1991},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.734334Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:d2c15759e4743dd5016084819dacb256a9592722daf703b8d980886e888707ec","observation_id":"fe027b61-4cb0-43de-905c-5d8af5747011","resolution":{"observed_at":"2026-08-15T18:29:34.923662Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.740104Z","title":"Nearly optimal sparse polynomial multiplication","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.740104Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:59f6cedd1cb41cc9d9e0d0b5e063cb1499f4d640b14a20e9a7856b59bd62b6cf","observation_id":"758d7660-bb49-4c55-b9ce-b2f323aa9b27","resolution":{"observed_at":"2026-08-15T18:29:34.740104Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.744482Z","title":"Barkley Rosser and Lowell Schoenfeld","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.744482Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:e3583f65c7f8a2bb8fe5ef97320ae3cf8582e44fe0485c4d491b52bbc6260583","observation_id":"cbfd2a24-8a7e-454f-aca2-e4c1fcc177ed","resolution":{"observed_at":"2026-08-15T18:29:34.744482Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.749658Z","title":"Language edit distance and maximum likelihood parsing of stochastic grammars: Faster algorithms and connection to fundamental graph problems","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.749658Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:afaffcabd0966f9e3aaae910fba9c18fab88d55e12e4671c681bcaa1d32c248c","observation_id":"394cec29-2b3a-4add-af3c-05aac1067bc8","resolution":{"observed_at":"2026-08-15T18:29:34.749658Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.754013Z","title":"On the all-pairs-shortest-path problem in unweighted undirected graphs","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.754013Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:e63585147913924f9d42d72fc11ce2914232ad3ba0991b50cb7d39f351f0a286","observation_id":"94acf69d-5894-4a23-9116-a0c0203f85f6","resolution":{"observed_at":"2026-08-15T18:29:34.754013Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.759496Z","title":"All pairs shortest paths in undirected graphs with integer weights","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.759496Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:ba9dac7d86485dee8bd602287149cd6d48311eafcd73bc873c0aa5d7d3f615b6","observation_id":"46dce098-69d1-4fe5-b01b-7a69fb317de6","resolution":{"observed_at":"2026-08-15T18:29:34.759496Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.763821Z","title":"On some fine-grained questions in algorithms and complexity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.763821Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:33f16f9d85767f064aa73d2323f379a2fb6778bf201425beb0e22b2e48033116","observation_id":"c0fa3cf4-aec7-4b3d-b7ac-96e71d130c2b","resolution":{"observed_at":"2026-08-15T18:29:34.763821Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.768975Z","title":"Finding a maximum weight triangle in n\\( ^ 3-delta \\) time, with applications","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.768975Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:e8d80baf3b06fed261fc7390b60b878ae135e8a15e07e72903b1fc5cd305ef25","observation_id":"78f6389b-a0a3-4243-b8a4-b8a1868a66f0","resolution":{"observed_at":"2026-08-15T18:29:34.768975Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.773110Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.773110Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:9a26e86396d17434f317fe3388fc01632495acbf37fce0f5313c739193efdce7","observation_id":"3995647c-b546-47d7-aeda-9cacb409f4fc","resolution":{"observed_at":"2026-08-15T18:29:34.773110Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.777818Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.777818Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:2639c2eb852788e5ffa7613e2355b7800da6688a0b2e73b998cd47d58521dfd4","observation_id":"1eb7ecbe-0d03-420a-bb72-58298353fe9c","resolution":{"observed_at":"2026-08-15T18:29:34.777818Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.782692Z","title":"Algorithms and lower bounds for replacement paths under multiple edge failure","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.782692Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:bb91c9faedb0e37000d517eef0dd15f8ad87764faf99a8a84ba4398d7f8e29e0","observation_id":"98fc2e63-896a-4447-8159-5fb7e7a39713","resolution":{"observed_at":"2026-08-15T18:29:34.782692Z","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":"10.4086/toc.2009.v005a009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.861908Z","title":"All pairs bottleneck paths and max-min matrix products in truly subcubic time","venue":null,"work_id":"36ef8778-32d7-4a5a-bba1-2e1ed2d34eff","year":2009},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.787676Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:0ab0af9fde755371c2b0ea10ebc64b4218345264f4361836e926dbfb44cbc380","observation_id":"208a7d44-dacd-432c-bc3b-cff06dba3ce6","resolution":{"observed_at":"2026-08-15T18:29:34.866935Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.792943Z","title":"Truly subcubic min-plus product for less structured matrices, with applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.792943Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:7090e6fea51fec64ec4b101ec05fa5769cde3bdacae76bd5644768d13e23052a","observation_id":"0b55fc0e-4644-4025-8b36-06d5117becda","resolution":{"observed_at":"2026-08-15T18:29:34.792943Z","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":"10.1137/1.9781611973068.103","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:29:34.834082Z","title":"Efficient algorithms on sets of permutations, dominance, and real-weighted APSP","venue":null,"work_id":"9308f7b1-d065-4d75-8483-0c412ac867ef","year":2009},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.797341Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:1d4218b8c9790cd5c8b5f6c69ff791600c46773b7382a34034c98bdf524fb9a1","observation_id":"8fea06bc-e7b6-4a22-a2d9-18cbaadd5ec5","resolution":{"observed_at":"2026-08-15T18:29:34.840314Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T18:29:34.802178Z","title":"All pairs shortest paths using bridging sets and rectangular matrix multiplication","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T18:29:34.802178Z"},"links":{"citing_paper":"/paper/2506.20017"},"observation_digest":"sha256:c04ce7c4bf4af12b13a2d288e52009e3fbf71e4ea0cb715b8948f02b91bb5e71","observation_id":"4f790ea7-f655-49a3-b9f8-d922ae2fc089","resolution":{"observed_at":"2026-08-15T18:29:34.802178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.20017","last_updated":"2025-06-24T21:21:25Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:42:24.435473Z","submitted_at":"2025-06-24T21:21:25Z","title":"All-Pairs Shortest Paths with Few Weights per Node"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":39,"verified_exact":14,"verified_fuzzy":2},"total_outbound_references":56},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2506.20017."}