Paper Citation Record · LEDGER

All-Pairs Shortest Paths with Few Weights per Node

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.20017 v1

Coverage vector

measured 56 of 56 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T18:29:34.802178Z

measured 57 of 57 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-14T04:19:01.890154Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-14T04:19:07.164880Z

Reference resolution

56 of 56 outbound references displayed

verified exact14
verified fuzzy2
unresolved39
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d137e09d-2433-4c90-9318-4ce7cd7a033a · outbound

This paper cites More Asymmetry Yields Faster Matrix Multiplication.

All-Pairs Shortest Paths with Few Weights per Node More Asymmetry Yields Faster Matrix Multiplication

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.541186Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13d6efdd-c9cd-4e6c-921a-88740e241ec6 · outbound

This paper cites On the exponent of the all pairs shortest path problem.

All-Pairs Shortest Paths with Few Weights per Node On the exponent of the all pairs shortest path problem

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.547025Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d2bed86-e8b3-46f4-b0da-21713cd50c68 · outbound

This paper cites Subcubic equivalences between graph centrality problems, apsp, and diameter.

All-Pairs Shortest Paths with Few Weights per Node Subcubic equivalences between graph centrality problems, apsp, and diameter

Reference 3

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.188055Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 23b24c0d-e70b-4210-a417-f5c1e3a2685d · outbound

This paper cites New algorithms and lower bounds for all-pairs max-flow in undirected graphs.

All-Pairs Shortest Paths with Few Weights per Node New algorithms and lower bounds for all-pairs max-flow in undirected graphs

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:29:36.612290Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation db17d869-cf2a-4825-96bf-445160f62c47 · outbound

This paper cites an unresolved cited work.

All-Pairs Shortest Paths with Few Weights per Node Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.561536Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6990d705-5c34-47a4-ab28-c5f6e53cef50 · outbound

This paper cites Popular conjectures imply strong lower bounds for dynamic problems.

All-Pairs Shortest Paths with Few Weights per Node Popular conjectures imply strong lower bounds for dynamic problems

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.565990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f2e7fe3-1250-4d0a-8816-84b6d15a5d44 · outbound

This paper cites Matching triangles and basing hardness on an extremely popular conjecture.

All-Pairs Shortest Paths with Few Weights per Node Matching triangles and basing hardness on an extremely popular conjecture

Reference 7

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.166011Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 539f8d44-e2db-433e-a40b-b56420058a52 · outbound

This paper cites 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.

All-Pairs Shortest Paths with Few Weights per Node 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

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.576469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f46e259a-ee26-4563-851d-0f894dc48a86 · outbound

This paper cites Sparse nonnegative convolution is equivalent to dense nonnegative convolution.

All-Pairs Shortest Paths with Few Weights per Node Sparse nonnegative convolution is equivalent to dense nonnegative convolution

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.580586Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 038fc88b-193e-4650-9aae-5d3369fb3d2f · outbound

This paper cites Deterministic and las vegas algorithms for sparse nonnegative convolution.

All-Pairs Shortest Paths with Few Weights per Node Deterministic and las vegas algorithms for sparse nonnegative convolution

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.584839Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1acd6b4-21f8-4eaf-9c2c-aa64b742edbf · outbound

This paper cites Tree edit distance cannot be computed in strongly subcubic time (unless APSP can).

All-Pairs Shortest Paths with Few Weights per Node Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)

Reference 11

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.143715Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a455573e-524c-4e4e-820d-1c3ecf60ed0e · outbound

This paper cites Truly sub-cubic algorithms for language edit distance and rna-folding via fast bounded-difference min-plus product.

All-Pairs Shortest Paths with Few Weights per Node Truly sub-cubic algorithms for language edit distance and rna-folding via fast bounded-difference min-plus product

Reference 12

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.129094Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c2f991e0-4fd1-4666-81d7-bc13648e78a8 · outbound

This paper cites Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product.

All-Pairs Shortest Paths with Few Weights per Node Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.598557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 186f68b4-63ec-4efa-a641-511f68dd35dd · outbound

This paper cites The complexity of partial derivatives.

All-Pairs Shortest Paths with Few Weights per Node The complexity of partial derivatives

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.608082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db0e7856-5f45-4354-8225-e2fb52de4dd3 · outbound

This paper cites A statistical theorem of set addition.

All-Pairs Shortest Paths with Few Weights per Node A statistical theorem of set addition

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.612412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 165dfc43-1eb6-4789-b1f3-5cd5c39c6de3 · outbound

This paper cites Improving viterbi is hard: Better runtimes imply faster clique algorithms.

All-Pairs Shortest Paths with Few Weights per Node Improving viterbi is hard: Better runtimes imply faster clique algorithms

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T18:29:36.598098Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 659b6284-f8a2-4a78-bbec-cab3656f51d8 · outbound

This paper cites Faster algorithms for bounded-difference min-plus product.

All-Pairs Shortest Paths with Few Weights per Node Faster algorithms for bounded-difference min-plus product

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.619777Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4da47fd-9b06-43d9-a688-0259ff7c652a · outbound

This paper cites Faster min-plus product for monotone instances.

All-Pairs Shortest Paths with Few Weights per Node Faster min-plus product for monotone instances

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.624207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b65b296e-ebb9-4102-b269-3b27dc3b3f7b · outbound

This paper cites Verifying candidate matches in sparse and wildcard matching.

All-Pairs Shortest Paths with Few Weights per Node Verifying candidate matches in sparse and wildcard matching

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.628841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23fdab1e-7086-4d70-af65-7be70bc70963 · outbound

This paper cites an unresolved cited work.

All-Pairs Shortest Paths with Few Weights per Node Unresolved cited work

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.633575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 848eecf2-cc3e-4c5c-8f16-4c06c0c34095 · outbound

This paper cites A greedy heuristic for the set-covering problem.

All-Pairs Shortest Paths with Few Weights per Node A greedy heuristic for the set-covering problem

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.638312Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ce8e99a-a2af-4df8-9516-1b8e4c137398 · outbound

This paper cites Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication.

All-Pairs Shortest Paths with Few Weights per Node Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.643418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d98c2c8e-8b0c-484a-bb30-04ae2d1e6402 · outbound

This paper cites Chan and Moshe Lewenstein.

All-Pairs Shortest Paths with Few Weights per Node Chan and Moshe Lewenstein

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.647844Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f932b7c-ae9e-47c6-9263-3c6c0f4111fe · outbound

This paper cites Chan, Virginia Vassilevska Williams , and Yinzhan Xu.

All-Pairs Shortest Paths with Few Weights per Node Chan, Virginia Vassilevska Williams , and Yinzhan Xu

Reference 25

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.051227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1fbe4b76-ad00-4959-81cf-c193b431997a · outbound

This paper cites Chan, Virginia Vassilevska Williams , and Yinzhan Xu.

All-Pairs Shortest Paths with Few Weights per Node Chan, Virginia Vassilevska Williams , and Yinzhan Xu

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.657298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5cf6191e-d09c-48da-9f81-b75983938191 · outbound

This paper cites Faster algorithms for dual-failure replacement paths.

All-Pairs Shortest Paths with Few Weights per Node Faster algorithms for dual-failure replacement paths

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.662569Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf94a5b5-7d70-4424-b355-751f3d8f1c83 · outbound

This paper cites Faster algorithms for all pairs non-decreasing paths problem.

All-Pairs Shortest Paths with Few Weights per Node Faster algorithms for all pairs non-decreasing paths problem

Reference 28

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.026376Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4de80614-7a22-40f5-bd52-b9881aec3cdd · outbound

This paper cites Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths.

All-Pairs Shortest Paths with Few Weights per Node Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.672667Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2422136b-6c92-4b30-a715-abcb8b8f58cd · outbound

This paper cites Improved bounds for rectangular monotone min-plus product and applications.

All-Pairs Shortest Paths with Few Weights per Node Improved bounds for rectangular monotone min-plus product and applications

Reference 30

Resolution: metadata mismatch; raw_fallback, observed 2026-08-15T18:29:35.973936Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 35ca57c9-2021-4beb-8b9b-e975088dd68d · outbound

This paper cites Deterministic sparse pattern matching via the Baur - Strassen theorem.

All-Pairs Shortest Paths with Few Weights per Node Deterministic sparse pattern matching via the Baur - Strassen theorem

Reference 31

Resolution: verified exact; doi, observed 2026-08-15T18:29:35.001109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1c64afc2-b179-419f-b30a-d3db5fad4d05 · outbound

This paper cites New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching.

All-Pairs Shortest Paths with Few Weights per Node New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching

Reference 32

Resolution: verified exact; local_arxiv, observed 2026-08-15T18:29:35.901673Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 46ead723-8f09-4246-a970-02a5a28852cc · outbound

This paper cites Fischer and Albert R.

All-Pairs Shortest Paths with Few Weights per Node Fischer and Albert R

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.691628Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35444d8d-138b-4d6c-aa1a-5fd0a0d1f69a · outbound

This paper cites Essentially optimal sparse polynomial multiplication.

All-Pairs Shortest Paths with Few Weights per Node Essentially optimal sparse polynomial multiplication

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.695413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5dd40d44-6373-46e5-90a0-0a410e69a916 · outbound

This paper cites an unresolved cited work.

All-Pairs Shortest Paths with Few Weights per Node Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.699182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b024528d-0f98-452e-9f88-0dcf015ff5fe · outbound

This paper cites Flow trees for vertex-capacitated networks.

All-Pairs Shortest Paths with Few Weights per Node Flow trees for vertex-capacitated networks

Reference 36

Resolution: verified exact; doi, observed 2026-08-15T18:29:34.966756Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 494bed69-bc97-4fc3-8362-0291c61ff69b · outbound

This paper cites an unresolved cited work.

All-Pairs Shortest Paths with Few Weights per Node Unresolved cited work

Reference 37

Resolution: verified exact; raw_fallback, observed 2026-08-15T18:29:35.820172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2c7b7786-67af-48a3-8c70-e297fb1e2cb3 · outbound

This paper cites Shaving logs via large sieve inequality: Faster algorithms for sparse convolution and more.

All-Pairs Shortest Paths with Few Weights per Node Shaving logs via large sieve inequality: Faster algorithms for sparse convolution and more

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.711406Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a3a4c5e5-a084-432e-8c1c-fb926a214f5c · outbound

This paper cites LCA queries in directed acyclic graphs.

All-Pairs Shortest Paths with Few Weights per Node LCA queries in directed acyclic graphs

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.715604Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 424355cb-9199-457f-8dd6-bd33b223e90e · outbound

This paper cites 3SUM in preprocessed universes: Faster and simpler.

All-Pairs Shortest Paths with Few Weights per Node 3SUM in preprocessed universes: Faster and simpler

Reference 40

Resolution: verified exact; raw_fallback, observed 2026-08-15T18:29:35.696641Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6461cda1-1061-445b-b486-65a09460a1be · outbound

This paper cites On the ratio of optimal integral and fractional covers.

All-Pairs Shortest Paths with Few Weights per Node On the ratio of optimal integral and fractional covers

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.724971Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 669f6545-df8a-4177-9555-e5871344822d · outbound

This paper cites Monochromatic triangles, intermediate matrix products, and convolutions.

All-Pairs Shortest Paths with Few Weights per Node Monochromatic triangles, intermediate matrix products, and convolutions

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.730053Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe027b61-4cb0-43de-905c-5d8af5747011 · outbound

This paper cites Computing dominances in e \^ n.

All-Pairs Shortest Paths with Few Weights per Node Computing dominances in e \^ n

Reference 43

Resolution: verified exact; doi, observed 2026-08-15T18:29:34.923662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 758d7660-bb49-4c55-b9ce-b2f323aa9b27 · outbound

This paper cites Nearly optimal sparse polynomial multiplication.

All-Pairs Shortest Paths with Few Weights per Node Nearly optimal sparse polynomial multiplication

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.740104Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbfd2a24-8a7e-454f-aca2-e4c1fcc177ed · outbound

This paper cites Barkley Rosser and Lowell Schoenfeld.

All-Pairs Shortest Paths with Few Weights per Node Barkley Rosser and Lowell Schoenfeld

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.744482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 394cec29-2b3a-4add-af3c-05aac1067bc8 · outbound

This paper cites Language edit distance and maximum likelihood parsing of stochastic grammars: Faster algorithms and connection to fundamental graph problems.

All-Pairs Shortest Paths with Few Weights per Node Language edit distance and maximum likelihood parsing of stochastic grammars: Faster algorithms and connection to fundamental graph problems

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.749658Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94acf69d-5894-4a23-9116-a0c0203f85f6 · outbound

This paper cites On the all-pairs-shortest-path problem in unweighted undirected graphs.

All-Pairs Shortest Paths with Few Weights per Node On the all-pairs-shortest-path problem in unweighted undirected graphs

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.754013Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46dce098-69d1-4fe5-b01b-7a69fb317de6 · outbound

This paper cites All pairs shortest paths in undirected graphs with integer weights.

All-Pairs Shortest Paths with Few Weights per Node All pairs shortest paths in undirected graphs with integer weights

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.759496Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0fa3cf4-aec7-4b3d-b7ac-96e71d130c2b · outbound

This paper cites On some fine-grained questions in algorithms and complexity.

All-Pairs Shortest Paths with Few Weights per Node On some fine-grained questions in algorithms and complexity

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.763821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78f6389b-a0a3-4243-b8a4-b8a1868a66f0 · outbound

This paper cites Finding a maximum weight triangle in n\( ^ 3-delta \) time, with applications.

All-Pairs Shortest Paths with Few Weights per Node Finding a maximum weight triangle in n\( ^ 3-delta \) time, with applications

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.768975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3995647c-b546-47d7-aeda-9cacb409f4fc · outbound

This paper cites Ryan Williams.

All-Pairs Shortest Paths with Few Weights per Node Ryan Williams

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.773110Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1eb7ecbe-0d03-420a-bb72-58298353fe9c · outbound

This paper cites Ryan Williams.

All-Pairs Shortest Paths with Few Weights per Node Ryan Williams

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.777818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98fc2e63-896a-4447-8159-5fb7e7a39713 · outbound

This paper cites Algorithms and lower bounds for replacement paths under multiple edge failure.

All-Pairs Shortest Paths with Few Weights per Node Algorithms and lower bounds for replacement paths under multiple edge failure

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.782692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 208a7d44-dacd-432c-bc3b-cff06dba3ce6 · outbound

This paper cites All pairs bottleneck paths and max-min matrix products in truly subcubic time.

All-Pairs Shortest Paths with Few Weights per Node All pairs bottleneck paths and max-min matrix products in truly subcubic time

Reference 54

Resolution: verified exact; doi, observed 2026-08-15T18:29:34.866935Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0b55fc0e-4644-4025-8b36-06d5117becda · outbound

This paper cites Truly subcubic min-plus product for less structured matrices, with applications.

All-Pairs Shortest Paths with Few Weights per Node Truly subcubic min-plus product for less structured matrices, with applications

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.792943Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8fea06bc-e7b6-4a22-a2d9-18cbaadd5ec5 · outbound

This paper cites Efficient algorithms on sets of permutations, dominance, and real-weighted APSP.

All-Pairs Shortest Paths with Few Weights per Node Efficient algorithms on sets of permutations, dominance, and real-weighted APSP

Reference 56

Resolution: verified exact; doi, observed 2026-08-15T18:29:34.840314Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4f790ea7-f655-49a3-b9f8-d922ae2fc089 · outbound

This paper cites All pairs shortest paths using bridging sets and rectangular matrix multiplication.

All-Pairs Shortest Paths with Few Weights per Node All pairs shortest paths using bridging sets and rectangular matrix multiplication

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-15T18:29:34.802178Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 310735e1-3b04-4d62-8942-8428409cc848 · inbound

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability cites this paper.

TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability All-Pairs Shortest Paths with Few Weights per Node

Reference 193

Resolution: metadata mismatch; local_arxiv, observed 2026-08-14T04:19:07.194910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.