Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths | Paper Citation Record

Observation 116d7793-8793-401f-8aee-a828336f58d2 · outbound

This paper cites Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:16.815691Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1decaee-267a-49c6-85c3-b7b7a4c55b1e · outbound

This paper cites Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:16.903072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6b7a839-ea13-4a05-b38c-a9070b7d0f31 · outbound

This paper cites Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.029786Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71548c15-3756-48a0-828c-21df1dd2bf03 · outbound

This paper cites Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.160129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d9f59478-73c6-47b3-9ea0-6d0cc0af4d44 · outbound

This paper cites 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026) , pages=

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.284935Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23af474c-169b-411a-a701-0cc57c5296fd · outbound

This paper cites SIAM Journal on Computing , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths SIAM Journal on Computing , volume=

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.422857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48f4b47d-fe0c-492a-bb22-bba3779e2283 · outbound

This paper cites Journal of the ACM (JACM) , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Journal of the ACM (JACM) , volume=

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.565305Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 414b7180-0787-4919-ad4f-15608c139c5d · outbound

This paper cites Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.691974Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69acf392-eb86-4771-b2e9-80fd5886835b · outbound

This paper cites Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.773700Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5df0bbf3-405d-4f3e-b8fe-e831270e56a1 · outbound

This paper cites 32nd Annual European Symposium on Algorithms (ESA 2024) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 32nd Annual European Symposium on Algorithms (ESA 2024) , pages=

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:17.958142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77f155bb-ca51-454b-8a0d-bca6cb872f7b · outbound

This paper cites 2025 Symposium on Simplicity in Algorithms (SOSA) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2025 Symposium on Simplicity in Algorithms (SOSA) , pages=

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.114185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bab9202b-444a-4db1-af6a-56b40c1200ed · outbound

This paper cites International Colloquium on Automata, Languages, and Programming (ICALP 2017) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths International Colloquium on Automata, Languages, and Programming (ICALP 2017) , pages=

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.233106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a20e200-53ab-4bae-84a9-306e7ca71e31 · outbound

This paper cites Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.398159Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd2a3fe7-c5e4-4595-9a2d-2119a75b939d · outbound

This paper cites Journal of the ACM (JACM) , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Journal of the ACM (JACM) , volume=

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.582998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d60bacd-61a5-4b2b-87cc-83fc91eb0d11 · outbound

This paper cites Proceedings of Structure in Complexity Theory.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of Structure in Complexity Theory

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.698621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09d88777-6aad-4fcd-bc71-7b0aa01d5a3d · outbound

This paper cites Proceedings of the nineteenth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the nineteenth annual ACM symposium on Theory of computing , pages=

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.832737Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87e9b1a7-1618-4e6a-bc36-2cb2d1e70775 · outbound

This paper cites Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.904475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3fafdce-aa59-4fd7-8d08-40740a74869d · outbound

This paper cites Journal of algorithms , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Journal of algorithms , volume=

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:18.972753Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54b4be96-212b-4d62-8194-5524b4a9c276 · outbound

This paper cites Proceedings of the April 30--May 2, 1968, spring joint computer conference , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the April 30--May 2, 1968, spring joint computer conference , pages=

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.064482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c3132c9-cae4-4a67-983d-7f204c3c11c1 · outbound

This paper cites Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures , pages=

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.182064Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d917ad8b-db2f-4118-b6b5-b54885a978ea · outbound

This paper cites Journal of Parallel and Distributed Computing , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Journal of Parallel and Distributed Computing , volume=

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.353113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 258febc5-c5bf-4f83-8c63-3c31562e35d3 · outbound

This paper cites Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures , pages=

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.497094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9af0a7f7-9d61-4fb6-87a0-091fb6441d47 · outbound

This paper cites an unresolved cited work.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.623007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c749e351-d7ff-4865-9798-6c62bf24b433 · outbound

This paper cites Proceedings of the seventeenth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the seventeenth annual ACM symposium on Theory of computing , pages=

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.732198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a5fd5ee-c46c-4774-98c3-831dfec00e2e · outbound

This paper cites Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures , pages=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.815330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f391b03-8930-4a41-bae8-2e0b9ecf8326 · outbound

This paper cites Communications of the ACM , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Communications of the ACM , volume=

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.901497Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d869c3c-3726-45cb-a45e-1e57d4e65575 · outbound

This paper cites Proceedings of the seventeenth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the seventeenth annual ACM symposium on Theory of computing , pages=

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:19.971199Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19e29b69-955d-4f3c-bcdc-1b0ba01cda5f · outbound

This paper cites The Quasi-Polynomial Low-Degree Conjecture is False.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths The Quasi-Polynomial Low-Degree Conjecture is False

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.077593Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dd5656a6-41d6-40b1-b8cf-81a5cac49d20 · outbound

This paper cites Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.194634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45cee7e0-383b-4f8b-8656-1b199d42dc65 · outbound

This paper cites IEEE Transactions on Information Theory , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths IEEE Transactions on Information Theory , volume=

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.254319Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation daa7de90-2274-486b-9b1b-62e8ab47e53e · outbound

This paper cites Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.365184Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7082c2f2-7a4e-4e19-99ca-79b2e5d602bb · outbound

This paper cites 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.486943Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2719f39b-0836-4a16-88fe-90fa35830405 · outbound

This paper cites Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.584988Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a679bd68-6043-4470-b579-d2d72b6a49dc · outbound

This paper cites Proceedings of the forty-first annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-first annual ACM symposium on Theory of computing , pages=

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.678825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 020c154f-e68c-4e3d-b803-7fbcd61889ae · outbound

This paper cites Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.755534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f264beb-b068-4755-bb43-92f8ad55cf6d · outbound

This paper cites Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.869878Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e126c63-279a-4a78-9a7d-d421cb853e69 · outbound

This paper cites Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.041930Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21df6145-918b-4fa5-861e-66d05bce337e · outbound

This paper cites Annual International Cryptology Conference , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Annual International Cryptology Conference , pages=

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.152808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adabb9b6-d1eb-4cf4-8122-67a16021c0bf · outbound

This paper cites Communications of the ACM , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Communications of the ACM , volume=

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.259000Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c271062e-e533-4534-a34a-417672d18b0d · outbound

This paper cites an unresolved cited work.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Unresolved cited work

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.390216Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 952c19c3-6c57-493f-855f-3cea54b5c830 · outbound

This paper cites Theory of Cryptography Conference , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Theory of Cryptography Conference , pages=

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.521758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84b12e91-74a0-40d7-b05e-3cf64ce0ba3f · outbound

This paper cites 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 44th Annual IEEE Symposium on Foundations of Computer Science, 2003

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.638469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a84c6a16-45d8-433a-82fb-363ac9e5f677 · outbound

This paper cites Journal of the ACM (JACM) , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Journal of the ACM (JACM) , volume=

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.762088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b890f488-d66b-4aee-b573-19a1d1ba02c8 · outbound

This paper cites Discrete Mathematics , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Discrete Mathematics , volume=

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:21.894414Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 947927ad-1658-4dd8-a1e4-7bcbb577dc4c · outbound

This paper cites Geometric & Functional Analysis GAFA , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Geometric & Functional Analysis GAFA , volume=

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.060876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6cf89f8f-c097-4053-bb2e-72411bbc848d · outbound

This paper cites International Mathematics Research Notices , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths International Mathematics Research Notices , volume=

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.215778Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1631a179-6880-4258-b8c3-78f75dd9a08d · outbound

This paper cites Proceedings of the American Mathematical Society , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the American Mathematical Society , pages=

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.380518Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c0e401e-2a33-4e40-b055-969fff5d4d19 · outbound

This paper cites Mathematical Proceedings of the Cambridge Philosophical Society , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Mathematical Proceedings of the Cambridge Philosophical Society , volume=

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.512200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98ae9e3d-ac94-4582-9d1b-4a3c19b9b4c2 · outbound

This paper cites Slightly improved sum-product estimates in fields of prime order.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Slightly improved sum-product estimates in fields of prime order

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.658240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0712826d-5c28-459f-bd4d-14f202106d74 · outbound

This paper cites International Mathematics Research Notices , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths International Mathematics Research Notices , volume=

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.762975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3464ee10-2570-4498-8e50-3f0e428ccd82 · outbound

This paper cites Advances in Mathematics , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Advances in Mathematics , volume=

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:22.895756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7fcb723-7f0b-4ba4-bc4b-5eb91df5c371 · outbound

This paper cites Proceedings of the American Mathematical Society , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the American Mathematical Society , volume=

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.034808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5d390fe-e1a5-40cf-bbc8-54904c460d64 · outbound

This paper cites International Mathematics Research Notices , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths International Mathematics Research Notices , volume=

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.169061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49443fd9-7991-4de1-afcf-a84a76332b11 · outbound

This paper cites Studies in pure mathematics , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Studies in pure mathematics , pages=

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.276475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4714d48e-4041-4aa9-876c-7b0ae0485a28 · outbound

This paper cites How to find groups?(and how to use them in Erd.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths How to find groups?(and how to use them in Erd

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.395746Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08924aea-d7bb-4470-b542-e2f8777f3639 · outbound

This paper cites Polynomials vanishing on Cartesian products: The Elekes--Szab.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Polynomials vanishing on Cartesian products: The Elekes--Szab

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.484681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94ff3fed-39c4-4663-9461-a8d8e32a9592 · outbound

This paper cites Polynomials vanishing on grids: The Elekes-R.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Polynomials vanishing on grids: The Elekes-R

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.668037Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67de2db7-be64-4d81-956b-59b141b94405 · outbound

This paper cites The Elekes--Szab.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths The Elekes--Szab

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.820262Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae5ddd29-b9c1-4f99-9f62-b6127b7a0a27 · outbound

This paper cites Approximation, Randomization, and Combinatorial Optimization.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Approximation, Randomization, and Combinatorial Optimization

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:23.932082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5777a463-ecb8-41b3-80bc-80dcb5938fed · outbound

This paper cites Current Developments in Mathematics , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Current Developments in Mathematics , volume=

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.035355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f5277bb-34e0-4075-abdc-593516e5e6ca · outbound

This paper cites Combinatorics, Probability and Computing , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Combinatorics, Probability and Computing , volume=

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.144007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbb0efcd-c5fc-4b3e-94b3-46e6c04f050c · outbound

This paper cites International Colloquium on Automata, Languages, and Programming , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths International Colloquium on Automata, Languages, and Programming , pages=

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.286856Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5537c57f-f99d-4455-8107-2df8692ecf83 · outbound

This paper cites 2020 IEEE International Symposium on Information Theory (ISIT) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2020 IEEE International Symposium on Information Theory (ISIT) , pages=

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.402833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc4654e2-5988-4a13-ac2f-fccd080172ed · outbound

This paper cites Conference on Learning Theory , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Conference on Learning Theory , pages=

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.567249Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aab1b7c6-8150-4023-bcec-fb2aeccd7d7f · outbound

This paper cites Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.747280Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 218c16d8-fb90-4c54-9262-5065c7fbb3d5 · outbound

This paper cites Detecting Arbitrary Planted Subgraphs in Random Graphs.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Detecting Arbitrary Planted Subgraphs in Random Graphs

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.871904Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c237e40-35c9-4d8c-8aa4-9e3b2e7a6b73 · outbound

This paper cites Improved Elekes-Szab.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Improved Elekes-Szab

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:24.989311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 40535889-0da3-4384-bb84-304ce38bfaf8 · outbound

This paper cites The Elekes—Szab.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths The Elekes—Szab

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:25.105935Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a857417-895e-48cc-bb7e-69e092dd5606 · outbound

This paper cites Convexity, Squeezing, and the Elekes-Szab\'{o} Theorem.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Convexity, Squeezing, and the Elekes-Szab\'{o} Theorem

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:25.188441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fdfc59d5-1def-4852-9368-ab18b36882df · outbound

This paper cites Expanding polynomials: A generalization of the Elekes-R.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Expanding polynomials: A generalization of the Elekes-R

Reference 70

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:25.315787Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bedd119-fa07-4c7b-898d-8edaf2dace6e · outbound

This paper cites A survey of Elekes-R.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths A survey of Elekes-R

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:25.519387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bcce3303-db50-4443-baa6-bef6c8709416 · outbound

This paper cites Theory of Cryptography Conference , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Theory of Cryptography Conference , pages=

Reference 72

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:25.701942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 829edf38-e5b4-4ad9-8d22-a3912005cd7c · outbound

This paper cites Proceedings of the forty-fourth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-fourth annual ACM symposium on Theory of computing , pages=

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:25.860265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 158c31f6-680b-4759-a6f3-644958001748 · outbound

This paper cites Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , pages=

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.040875Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8acc1b92-30b3-43ca-b442-58e621a9bca0 · outbound

This paper cites Proceedings of the tenth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the tenth annual ACM symposium on Theory of computing , pages=

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.145369Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9737662c-b6d1-4dea-904a-084216e4a256 · outbound

This paper cites an unresolved cited work.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Unresolved cited work

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.251189Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5192c434-d675-4a19-8502-48343ae01a16 · outbound

This paper cites Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing , year=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing , year=

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.378256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f19a62bb-24a0-4545-ae89-57211ee5eb6b · outbound

This paper cites Proceedings of the forty-second ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-second ACM symposium on Theory of computing , pages=

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.426138Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9f8170e0-720d-454c-b85e-36f2185d3701 · outbound

This paper cites Expanding Polynomials over the rationals.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Expanding Polynomials over the rationals

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.543094Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 385a2960-4ecf-40f1-a5b8-682cbcc25d30 · outbound

This paper cites Annual International Cryptology Conference , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Annual International Cryptology Conference , pages=

Reference 80

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.656773Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c167b38-89a3-429d-ae31-60b34c7b3d12 · outbound

This paper cites Coding Thv , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Coding Thv , volume=

Reference 81

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.810120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae5c1877-9777-4cf0-9f5d-fc525d4f161c · outbound

This paper cites International Workshop on Post-Quantum Cryptography , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths International Workshop on Post-Quantum Cryptography , pages=

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:26.911798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b47a242-04d6-4b86-83ed-8eb7339b490d · outbound

This paper cites 1994 , publisher=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 1994 , publisher=

Reference 83

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.037798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb5dbdf1-21b8-4b60-83d1-eaa5d870fdeb · outbound

This paper cites Advances in Cryptology—EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8--11, 1991 Proceedings 10 , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Advances in Cryptology—EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8--11, 1991 Proceedings 10 , pages=

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.188790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e2b2191-fe54-442a-8e58-7b90dc76e721 · outbound

This paper cites Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.254926Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7af0967b-dfee-4ae1-8ab5-f9b3b5ac03df · outbound

This paper cites Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=

Reference 86

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.331123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e615135-c158-4911-a18f-65c0ae55e29f · outbound

This paper cites Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich , pages=

Reference 87

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.420068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bb667e6-c4b0-4476-bd87-355bfc98bbfc · outbound

This paper cites Studies in Complexity and Cryptography.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Studies in Complexity and Cryptography

Reference 88

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.452629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad5161d0-32c4-4d8c-a342-6454fcd9be3b · outbound

This paper cites Capacity on BMS Channels via Code Symmetry and Nesting.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Capacity on BMS Channels via Code Symmetry and Nesting

Reference 89

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.551431Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94a80e1e-ac50-44d3-b061-6a5e00600880 · outbound

This paper cites IEEE Transactions on Information Theory , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths IEEE Transactions on Information Theory , volume=

Reference 90

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.640020Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2fc8194-e89a-479d-9b2b-4fbd0041775d · outbound

This paper cites Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=

Reference 91

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.749162Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 762e8144-d68f-40e3-ab1f-d97adc4b13e5 · outbound

This paper cites 2018 IEEE International Symposium on Information Theory (ISIT) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2018 IEEE International Symposium on Information Theory (ISIT) , pages=

Reference 92

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.853208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3898e29b-49b1-4f10-9703-f37dd7ff9598 · outbound

This paper cites Innovations in Theoretical Computer Science (ITCS) , volume=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Innovations in Theoretical Computer Science (ITCS) , volume=

Reference 93

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:27.930433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 273b2a56-4ac9-4225-bfaa-44716e633693 · outbound

This paper cites 2014 IEEE 29th Conference on Computational Complexity (CCC) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2014 IEEE 29th Conference on Computational Complexity (CCC) , pages=

Reference 94

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.087712Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abe973d7-aa77-459d-bf3e-d99a18280f8f · outbound

This paper cites Lower bounds for the polynomial calculus and the Gr.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Lower bounds for the polynomial calculus and the Gr

Reference 95

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.226911Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 232496fe-ad40-4be2-8ac7-4886dd4d5042 · outbound

This paper cites Planted Models for the Densest $k$-Subgraph Problem.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Planted Models for the Densest $k$-Subgraph Problem

Reference 96

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.407121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46c4ca71-a440-4fe6-b4c0-02c1c7c50d3e · outbound

This paper cites Theory of Cryptography Conference , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths Theory of Cryptography Conference , pages=

Reference 97

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.571767Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d36f5019-a7a1-4180-b864-89f8b2ce5036 · outbound

This paper cites 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 98

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.712851Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd59cabb-6c33-4e35-810c-8251f09e5c5a · outbound

This paper cites 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 99

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.821181Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4d290d4-b14b-4742-b9f3-29250dd733a1 · outbound

This paper cites 37th Computational Complexity Conference , year=.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths 37th Computational Complexity Conference , year=

Reference 100

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:28.968703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers