{"as_of":"2026-08-14T21:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5de3879b40534797e0ba6fe354a6be54d34ad2fb2b59b077b5171f2b66d05de1","coverage":[{"denominator":157,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:53:28.968703Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.19342/citation-record","integrity":"/paper/2607.19342/integrity","json":"/paper/2607.19342/citation-record.json","paper":"/paper/2607.19342"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T12:53:16.815691Z","title":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:16.815691Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:ce06afc87d1e995e34808e0e23ff6e0779e0aa4530ef18e4af6f760e11ff800f","observation_id":"116d7793-8793-401f-8aee-a828336f58d2","resolution":{"observed_at":"2026-08-01T12:53:16.815691Z","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-01T12:53:16.903072Z","title":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:16.903072Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:0ad7b66a4aa9092f9ddeef78c6803738f2a78b431af11d400ab29deb797ce6a5","observation_id":"f1decaee-267a-49c6-85c3-b7b7a4c55b1e","resolution":{"observed_at":"2026-08-01T12:53:16.903072Z","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-01T12:53:17.029786Z","title":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.029786Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:cdee0315cb12f5254e247a2fa9dc95585f1a8dbf39f28062113a8b5bc0dc43cd","observation_id":"c6b7a839-ea13-4a05-b38c-a9070b7d0f31","resolution":{"observed_at":"2026-08-01T12:53:17.029786Z","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-01T12:53:17.160129Z","title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.160129Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:79ee4f2ec0506fea3391df87cd06a233fe9965e8fb52df22b82ce743e6ddcfa1","observation_id":"71548c15-3756-48a0-828c-21df1dd2bf03","resolution":{"observed_at":"2026-08-01T12:53:17.160129Z","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-01T12:53:17.284935Z","title":"53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026) , pages=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.284935Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:02ae263f827e8007f510735bada68f2ea177a541874f275e58bd31b3820147fd","observation_id":"d9f59478-73c6-47b3-9ea0-6d0cc0af4d44","resolution":{"observed_at":"2026-08-01T12:53:17.284935Z","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-01T12:53:17.422857Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.422857Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:80d9ac2a0108eb0a37ee0ff74cc25137bc1401379bcd1197a0fe94319626ccf3","observation_id":"23af474c-169b-411a-a701-0cc57c5296fd","resolution":{"observed_at":"2026-08-01T12:53:17.422857Z","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-01T12:53:17.565305Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.565305Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:d548665d528b223608b8f72e557fc8720d318bc4b6c30b182d93337ccc63c288","observation_id":"48f4b47d-fe0c-492a-bb22-bba3779e2283","resolution":{"observed_at":"2026-08-01T12:53:17.565305Z","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-01T12:53:17.691974Z","title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.691974Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:b2ee4e50de108a17241b4bb50c997e9755aec5e43980f92a9695cc375d246c22","observation_id":"414b7180-0787-4919-ad4f-15608c139c5d","resolution":{"observed_at":"2026-08-01T12:53:17.691974Z","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-01T12:53:17.773700Z","title":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.773700Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:78cb7caee3e615b7742529368b34a15613510dd840e39950b843ceae25945858","observation_id":"69acf392-eb86-4771-b2e9-80fd5886835b","resolution":{"observed_at":"2026-08-01T12:53:17.773700Z","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-01T12:53:17.958142Z","title":"32nd Annual European Symposium on Algorithms (ESA 2024) , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:17.958142Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:a616881e44ffcd340b00fe18dfe80dcfd952d5355c8cc046b89d7f6e0821622e","observation_id":"5df0bbf3-405d-4f3e-b8fe-e831270e56a1","resolution":{"observed_at":"2026-08-01T12:53:17.958142Z","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-01T12:53:18.114185Z","title":"2025 Symposium on Simplicity in Algorithms (SOSA) , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.114185Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:32aaf7dbb7fb96d25fe62b1097c92d486ee18c7317578ea9a8d118ce3202eb69","observation_id":"77f155bb-ca51-454b-8a0d-bca6cb872f7b","resolution":{"observed_at":"2026-08-01T12:53:18.114185Z","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-01T12:53:18.233106Z","title":"International Colloquium on Automata, Languages, and Programming (ICALP 2017) , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.233106Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:aa1d0033e05a71ca276e6368de26c4163e1a254517a04418e397960e80032d09","observation_id":"bab9202b-444a-4db1-af6a-56b40c1200ed","resolution":{"observed_at":"2026-08-01T12:53:18.233106Z","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-01T12:53:18.398159Z","title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.398159Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:8a0138ee80851351fd3510f8107d792d793f3b198f09f116ab078a3cc538cd79","observation_id":"3a20e200-53ab-4bae-84a9-306e7ca71e31","resolution":{"observed_at":"2026-08-01T12:53:18.398159Z","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-01T12:53:18.582998Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.582998Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:e1853b104c52f65eed1022f04cd812b2239f714647b27549823f61c5ae965c21","observation_id":"dd2a3fe7-c5e4-4595-9a2d-2119a75b939d","resolution":{"observed_at":"2026-08-01T12:53:18.582998Z","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-01T12:53:18.698621Z","title":"Proceedings of Structure in Complexity Theory","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.698621Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:77f1e5c08826a5ce65c411ae620bf88f562c1ef3bbd0d6c6f768c4e633334e3f","observation_id":"0d60bacd-61a5-4b2b-87cc-83fc91eb0d11","resolution":{"observed_at":"2026-08-01T12:53:18.698621Z","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-01T12:53:18.832737Z","title":"Proceedings of the nineteenth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.832737Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:6fce10692d16a0f5d2d07762541743954e7501e680f631b8675a8995a8038744","observation_id":"09d88777-6aad-4fcd-bc71-7b0aa01d5a3d","resolution":{"observed_at":"2026-08-01T12:53:18.832737Z","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-01T12:53:18.904475Z","title":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.904475Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:de093dfd0e7b05831e838351d84e248208df7814cb779e096a80d9c3fe5dd020","observation_id":"87e9b1a7-1618-4e6a-bc36-2cb2d1e70775","resolution":{"observed_at":"2026-08-01T12:53:18.904475Z","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-01T12:53:18.972753Z","title":"Journal of algorithms , volume=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:18.972753Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:703ebdd3a3d23306802cdb65584b9c8a05c9269e9242278d044c4cc79e500fb9","observation_id":"e3fafdce-aa59-4fd7-8d08-40740a74869d","resolution":{"observed_at":"2026-08-01T12:53:18.972753Z","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-01T12:53:19.064482Z","title":"Proceedings of the April 30--May 2, 1968, spring joint computer conference , pages=","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.064482Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:4553ce53117830a40fdf053f26943d1610e2f0a08bf55739e899fa7187bc96bb","observation_id":"54b4be96-212b-4d62-8194-5524b4a9c276","resolution":{"observed_at":"2026-08-01T12:53:19.064482Z","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-01T12:53:19.182064Z","title":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.182064Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:e223a806d5309b0afbb390b4aafeb0bdb15854db173da2209bb3741081991a6c","observation_id":"9c3132c9-cae4-4a67-983d-7f204c3c11c1","resolution":{"observed_at":"2026-08-01T12:53:19.182064Z","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-01T12:53:19.353113Z","title":"Journal of Parallel and Distributed Computing , volume=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.353113Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:259d8953bacc2cc3fcac94cff63677fbeb550de6e1395b05015dbaa5eaa1e63d","observation_id":"d917ad8b-db2f-4118-b6b5-b54885a978ea","resolution":{"observed_at":"2026-08-01T12:53:19.353113Z","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-01T12:53:19.497094Z","title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.497094Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:5b7009813914947421cd7c1a349a20605aeeec01f87f3870f1e34fe21bbf11dc","observation_id":"258febc5-c5bf-4f83-8c63-3c31562e35d3","resolution":{"observed_at":"2026-08-01T12:53:19.497094Z","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-01T12:53:19.623007Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.623007Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:6f0f5881576395feb87e1cb5b2c405a387790c6d982a1ef2fa36dff40102b7b3","observation_id":"9af0a7f7-9d61-4fb6-87a0-091fb6441d47","resolution":{"observed_at":"2026-08-01T12:53:19.623007Z","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-01T12:53:19.732198Z","title":"Proceedings of the seventeenth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.732198Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:6cdfdec1d3c9426047d61c0935b9816096e006d8db6f2d2d6e71ea8c3cf0e718","observation_id":"c749e351-d7ff-4865-9798-6c62bf24b433","resolution":{"observed_at":"2026-08-01T12:53:19.732198Z","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-01T12:53:19.815330Z","title":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.815330Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:3e1f7c6679609795415f9d4cc7f37ef831d7aee16543e1acf558907619620c8f","observation_id":"7a5fd5ee-c46c-4774-98c3-831dfec00e2e","resolution":{"observed_at":"2026-08-01T12:53:19.815330Z","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-01T12:53:19.901497Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.901497Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:aa98be411ed5dd021edf9f8d985a91e74b51c84f764fda4bb1b05c6b48954c8b","observation_id":"8f391b03-8930-4a41-bae8-2e0b9ecf8326","resolution":{"observed_at":"2026-08-01T12:53:19.901497Z","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-01T12:53:19.971199Z","title":"Proceedings of the seventeenth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:19.971199Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:f6d1ee1797c54d3b1ffbf11180855d8f63c134efd33840920600a76b7cd7611a","observation_id":"4d869c3c-3726-45cb-a45e-1e57d4e65575","resolution":{"observed_at":"2026-08-01T12:53:19.971199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17360","last_updated":"2025-05-23T00:30:55Z","snapshot_observed_at":"2026-08-07T14:46:15.051323Z","submitted_at":"2025-05-23T00:30:55Z","title":"The Quasi-Polynomial Low-Degree Conjecture is False","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17360","snapshot_observed_at":"2026-08-01T12:53:20.077593Z","title":"arXiv preprint arXiv:2505.17360 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.077593Z"},"links":{"cited_paper":"/paper/2505.17360","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:d39e3aa73d46414492548685cb89381d7265114e2da1baf6a61e30b6a7e4a4ea","observation_id":"19e29b69-955d-4f3c-bcdc-1b0ba01cda5f","resolution":{"observed_at":"2026-08-01T12:53:20.077593Z","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-01T12:53:20.194634Z","title":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.194634Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:3bff5ef878aadaf75bd4b18a17259e91277051cfe9a051c2e9b1149844ada7e6","observation_id":"dd5656a6-41d6-40b1-b8cf-81a5cac49d20","resolution":{"observed_at":"2026-08-01T12:53:20.194634Z","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-01T12:53:20.254319Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.254319Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:5c735ef764e519f2efa989bb20f5e7ab79e2758444057f8b193d0d22e4f48f18","observation_id":"45cee7e0-383b-4f8b-8656-1b199d42dc65","resolution":{"observed_at":"2026-08-01T12:53:20.254319Z","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-01T12:53:20.365184Z","title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.365184Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:fd5250fe4d6b40e8ca7d19b8311dfdcd904ac4541ff054c28f85a729a927ea08","observation_id":"daa7de90-2274-486b-9b1b-62e8ab47e53e","resolution":{"observed_at":"2026-08-01T12:53:20.365184Z","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-01T12:53:20.486943Z","title":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.486943Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:2c301ffef999e29634b9cf21a7b73486302f27f29d130c8c37b003bcb44600f9","observation_id":"7082c2f2-7a4e-4e19-99ca-79b2e5d602bb","resolution":{"observed_at":"2026-08-01T12:53:20.486943Z","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-01T12:53:20.584988Z","title":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.584988Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:71086d30226cdabcdd895b04714b1b9c92561a40c7d9aa6c693f9fd417a5ccab","observation_id":"2719f39b-0836-4a16-88fe-90fa35830405","resolution":{"observed_at":"2026-08-01T12:53:20.584988Z","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-01T12:53:20.678825Z","title":"Proceedings of the forty-first annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.678825Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:e1463518146ce383ebb9f59dc1b9c352a633675a77a2687bb2c3f7b66270e9ac","observation_id":"a679bd68-6043-4470-b579-d2d72b6a49dc","resolution":{"observed_at":"2026-08-01T12:53:20.678825Z","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-01T12:53:20.755534Z","title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.755534Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:0ee7f2d58591efeb447dd1114d5bfb16200aa1e4710ab827b50d0e2b458ec11d","observation_id":"020c154f-e68c-4e3d-b803-7fbcd61889ae","resolution":{"observed_at":"2026-08-01T12:53:20.755534Z","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-01T12:53:20.869878Z","title":"Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:20.869878Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:0be7b14cb979de966ea35905e730aba579d9ef820776e01c4841b4b62ebe243c","observation_id":"6f264beb-b068-4755-bb43-92f8ad55cf6d","resolution":{"observed_at":"2026-08-01T12:53:20.869878Z","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-01T12:53:21.041930Z","title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.041930Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:017b84c39947fb866412b063b7be5106d90d2a5e201573ddb7e1e8bb44e3c3bb","observation_id":"2e126c63-279a-4a78-9a7d-d421cb853e69","resolution":{"observed_at":"2026-08-01T12:53:21.041930Z","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-01T12:53:21.152808Z","title":"Annual International Cryptology Conference , pages=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.152808Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:938c33d95dd4a82d52005da7b5e66f779cdf2cfe138f68d0f31ba08c1877d863","observation_id":"21df6145-918b-4fa5-861e-66d05bce337e","resolution":{"observed_at":"2026-08-01T12:53:21.152808Z","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-01T12:53:21.259000Z","title":"Communications of the ACM , volume=","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.259000Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:070d2a30d53bf6e3600cda72ee74280c2c5bd9b4907b9470e2673f14f4566be4","observation_id":"adabb9b6-d1eb-4cf4-8122-67a16021c0bf","resolution":{"observed_at":"2026-08-01T12:53:21.259000Z","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-01T12:53:21.390216Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.390216Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:01f7a08b001e705b63173168b608c327a6cbbfa599b37f87e3b08b263f858210","observation_id":"c271062e-e533-4534-a34a-417672d18b0d","resolution":{"observed_at":"2026-08-01T12:53:21.390216Z","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-01T12:53:21.521758Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.521758Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:67e126823334d8e94568e183fbdc38d7fad4121899d6f761183a44163b96d2a1","observation_id":"952c19c3-6c57-493f-855f-3cea54b5c830","resolution":{"observed_at":"2026-08-01T12:53:21.521758Z","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-01T12:53:21.638469Z","title":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.638469Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:46864914824219bd25efbeec4f8367cf10a011c5622f156f9732df23e4d6079c","observation_id":"84b12e91-74a0-40d7-b05e-3cf64ce0ba3f","resolution":{"observed_at":"2026-08-01T12:53:21.638469Z","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-01T12:53:21.762088Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.762088Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:306fcd7de15c0daeb36bf37616af330539cc30d9c3966844d3f54610cb9df17e","observation_id":"a84c6a16-45d8-433a-82fb-363ac9e5f677","resolution":{"observed_at":"2026-08-01T12:53:21.762088Z","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-01T12:53:21.894414Z","title":"Discrete Mathematics , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:21.894414Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:73a8561bcb89e7662c972fb5242903e8544e94fa4e77fb0a5fc970f389d14d5a","observation_id":"b890f488-d66b-4aee-b573-19a1d1ba02c8","resolution":{"observed_at":"2026-08-01T12:53:21.894414Z","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-01T12:53:22.060876Z","title":"Geometric & Functional Analysis GAFA , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.060876Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:157b8f324bf603be6ed04d5bd59006febdbfbad73c7bab45322d4359e5adc153","observation_id":"947927ad-1658-4dd8-a1e4-7bcbb577dc4c","resolution":{"observed_at":"2026-08-01T12:53:22.060876Z","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-01T12:53:22.215778Z","title":"International Mathematics Research Notices , volume=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.215778Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:755c8a8bb74d03579ef0a3028467a9409c3eda11ca5d1d6323836322fa1cd0b8","observation_id":"6cf89f8f-c097-4053-bb2e-72411bbc848d","resolution":{"observed_at":"2026-08-01T12:53:22.215778Z","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-01T12:53:22.380518Z","title":"Proceedings of the American Mathematical Society , pages=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.380518Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:5d55ebefff2b3a40ae0c299ced4046ae9de6ed7aab505843f66e854773cbfca1","observation_id":"1631a179-6880-4258-b8c3-78f75dd9a08d","resolution":{"observed_at":"2026-08-01T12:53:22.380518Z","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-01T12:53:22.512200Z","title":"Mathematical Proceedings of the Cambridge Philosophical Society , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.512200Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:1d6e5a89d21b4c01a53f6e9dda1ffca7ec62925dda675917659e9ce16c60e523","observation_id":"3c0e401e-2a33-4e40-b055-969fff5d4d19","resolution":{"observed_at":"2026-08-01T12:53:22.512200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0907.2051","last_updated":"2009-07-12T19:28:58Z","snapshot_observed_at":"2026-08-11T15:28:21.845528Z","submitted_at":"2009-07-12T19:28:58Z","title":"Slightly improved sum-product estimates in fields of prime order","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0907.2051","snapshot_observed_at":"2026-08-01T12:53:22.658240Z","title":"arXiv preprint arXiv:0907.2051 , year=","venue":null,"work_id":null,"year":2051},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.658240Z"},"links":{"cited_paper":"/paper/0907.2051","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:ec4ed441c86ce9f3421ca6fc9539931c9fa65886815fb57e2f3a9a4ef3b468b4","observation_id":"98ae9e3d-ac94-4582-9d1b-4a3c19b9b4c2","resolution":{"observed_at":"2026-08-01T12:53:22.658240Z","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-01T12:53:22.762975Z","title":"International Mathematics Research Notices , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.762975Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:1c94ce85620ea1f6ab67233989b98f7b5750a8b59cd409faef2cb1b06f5c8bc3","observation_id":"0712826d-5c28-459f-bd4d-14f202106d74","resolution":{"observed_at":"2026-08-01T12:53:22.762975Z","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-01T12:53:22.895756Z","title":"Advances in Mathematics , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:22.895756Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:1929ee0bae2bdf5f9544992ced3e19b0d84985b88d9582dfd303406eb1027204","observation_id":"3464ee10-2570-4498-8e50-3f0e428ccd82","resolution":{"observed_at":"2026-08-01T12:53:22.895756Z","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-01T12:53:23.034808Z","title":"Proceedings of the American Mathematical Society , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.034808Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:965ee4f3694f62fc92e055f159a9cf85b32184b27bad8cfe142904a0361f0e54","observation_id":"b7fcb723-7f0b-4ba4-bc4b-5eb91df5c371","resolution":{"observed_at":"2026-08-01T12:53:23.034808Z","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-01T12:53:23.169061Z","title":"International Mathematics Research Notices , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.169061Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:9110c9c4b57d80b19bea8fe9f8d49a2c949047dc0a8fcfbfe069c879e36cf5e7","observation_id":"c5d390fe-e1a5-40cf-bbc8-54904c460d64","resolution":{"observed_at":"2026-08-01T12:53:23.169061Z","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-01T12:53:23.276475Z","title":"Studies in pure mathematics , pages=","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.276475Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:3c910e63a7b6fac225f0e5742906d55e7b68a4c6c9a6e17ad9f016c8a12c77cd","observation_id":"49443fd9-7991-4de1-afcf-a84a76332b11","resolution":{"observed_at":"2026-08-01T12:53:23.276475Z","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-01T12:53:23.395746Z","title":"How to find groups?(and how to use them in Erd","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.395746Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:edd0d0051a0794f1e0bc53fdf043734c7b8dc9d4a9d5e56b54efee464e1d248a","observation_id":"4714d48e-4041-4aa9-876c-7b0ae0485a28","resolution":{"observed_at":"2026-08-01T12:53:23.395746Z","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-01T12:53:23.484681Z","title":"Polynomials vanishing on Cartesian products: The Elekes--Szab","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.484681Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:ddca42a4944a94e44236685fa47f485dc65d409e8fcce73e561f274f814769c5","observation_id":"08924aea-d7bb-4470-b542-e2f8777f3639","resolution":{"observed_at":"2026-08-01T12:53:23.484681Z","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-01T12:53:23.668037Z","title":"Polynomials vanishing on grids: The Elekes-R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.668037Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:aa65454e220accb6846edfd184cb78156d16be42629444eb3d897bfbf79987ba","observation_id":"94ff3fed-39c4-4663-9461-a8d8e32a9592","resolution":{"observed_at":"2026-08-01T12:53:23.668037Z","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-01T12:53:23.820262Z","title":"The Elekes--Szab","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.820262Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:b1d78982a861e86585720ea86b37048380fc26d610b566c545b29507f595e0cf","observation_id":"67de2db7-be64-4d81-956b-59b141b94405","resolution":{"observed_at":"2026-08-01T12:53:23.820262Z","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-01T12:53:23.932082Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:23.932082Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:8636de01449c754ff8da7b91e8ec27ce083a2fc99918e76f4f2f3191df43ac71","observation_id":"ae5ddd29-b9c1-4f99-9f62-b6127b7a0a27","resolution":{"observed_at":"2026-08-01T12:53:23.932082Z","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-01T12:53:24.035355Z","title":"Current Developments in Mathematics , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.035355Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:c5c027042c5e3cf77ff6ad2cc5aca403fdd516c80bf9caae475a0b23e508446b","observation_id":"5777a463-ecb8-41b3-80bc-80dcb5938fed","resolution":{"observed_at":"2026-08-01T12:53:24.035355Z","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-01T12:53:24.144007Z","title":"Combinatorics, Probability and Computing , volume=","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.144007Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:0705153f6e19d3ac5aed9f3b4400e75498e87fa54c403b06e16b09cb836d027b","observation_id":"4f5277bb-34e0-4075-abdc-593516e5e6ca","resolution":{"observed_at":"2026-08-01T12:53:24.144007Z","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-01T12:53:24.286856Z","title":"International Colloquium on Automata, Languages, and Programming , pages=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.286856Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:0e9c1ce318b991bc4fa978cd58f9a349fe11532488581183ed2bd1548b717b68","observation_id":"dbb0efcd-c5fc-4b3e-94b3-46e6c04f050c","resolution":{"observed_at":"2026-08-01T12:53:24.286856Z","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-01T12:53:24.402833Z","title":"2020 IEEE International Symposium on Information Theory (ISIT) , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.402833Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:838aad6869e0c1930ce7a93970df0287ecddbf70e7fb9c8734da81737c5dcb95","observation_id":"5537c57f-f99d-4455-8107-2df8692ecf83","resolution":{"observed_at":"2026-08-01T12:53:24.402833Z","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-01T12:53:24.567249Z","title":"Conference on Learning Theory , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.567249Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:5c21e588f806d5a5598788e477fb74f4350df1ff1d7562199e6f7456251fd54e","observation_id":"fc4654e2-5988-4a13-ac2f-fccd080172ed","resolution":{"observed_at":"2026-08-01T12:53:24.567249Z","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-01T12:53:24.747280Z","title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.747280Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:6affb33c24d18bff8a6aa1c424ff4522c593d6a06454120b3ae2800567a28c19","observation_id":"aab1b7c6-8150-4023-bcec-fb2aeccd7d7f","resolution":{"observed_at":"2026-08-01T12:53:24.747280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19069","last_updated":"2025-05-18T18:13:59Z","snapshot_observed_at":"2026-08-07T16:40:12.801200Z","submitted_at":"2025-03-24T18:54:43Z","title":"Detecting Arbitrary Planted Subgraphs in Random Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19069","snapshot_observed_at":"2026-08-01T12:53:24.871904Z","title":"arXiv preprint arXiv:2503.19069 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.871904Z"},"links":{"cited_paper":"/paper/2503.19069","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:756b45294f2bb9c350576adb3ade1b29c5d6a1b8070e107e1f2f7bbbd85e8193","observation_id":"218c16d8-fb90-4c54-9262-5065c7fbb3d5","resolution":{"observed_at":"2026-08-01T12:53:24.871904Z","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-01T12:53:24.989311Z","title":"Improved Elekes-Szab","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:24.989311Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:291be9cb50925aa8497d4efcd9f27d8e9117de87fe6f72823d710cc499d5929c","observation_id":"7c237e40-35c9-4d8c-8aa4-9e3b2e7a6b73","resolution":{"observed_at":"2026-08-01T12:53:24.989311Z","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-01T12:53:25.105935Z","title":"The Elekes—Szab","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:25.105935Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:a01c0c80a385d8f452c4ff849560eaf54297f8f3e4d7b6b7eca86b1ca318566d","observation_id":"40535889-0da3-4384-bb84-304ce38bfaf8","resolution":{"observed_at":"2026-08-01T12:53:25.105935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14059","last_updated":"2024-01-14T20:31:37Z","snapshot_observed_at":"2026-08-13T15:35:15.444747Z","submitted_at":"2022-05-27T15:47:05Z","title":"Convexity, Squeezing, and the Elekes-Szab\\'{o} Theorem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14059","snapshot_observed_at":"2026-08-01T12:53:25.188441Z","title":"arXiv preprint arXiv:2205.14059 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:25.188441Z"},"links":{"cited_paper":"/paper/2205.14059","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:2250b621f1d99a35cd67a2551ae69962871570dfa3f43b791a7be9fddcd91dab","observation_id":"6a857417-895e-48cc-bb7e-69e092dd5606","resolution":{"observed_at":"2026-08-01T12:53:25.188441Z","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-01T12:53:25.315787Z","title":"Expanding polynomials: A generalization of the Elekes-R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:25.315787Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:9bbd73b31b13cdbc52051c0d5f7f2f9926cade0951186db07580772d7f3cf401","observation_id":"fdfc59d5-1def-4852-9368-ab18b36882df","resolution":{"observed_at":"2026-08-01T12:53:25.315787Z","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-01T12:53:25.519387Z","title":"A survey of Elekes-R","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:25.519387Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:63b65dbde00145a20b727c0634f8e3b6a973d800b56179a454948dad824170d0","observation_id":"1bedd119-fa07-4c7b-898d-8edaf2dace6e","resolution":{"observed_at":"2026-08-01T12:53:25.519387Z","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-01T12:53:25.701942Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:25.701942Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:ebc0046d0695b4034abcf07e5720322a52a3ec0cb3160272c30180cca13d793d","observation_id":"bcce3303-db50-4443-baa6-bef6c8709416","resolution":{"observed_at":"2026-08-01T12:53:25.701942Z","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-01T12:53:25.860265Z","title":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:25.860265Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:e43b6473d668e2d731056a833e877e43ef4f7a2bd69dae21e4b6c5f701577a92","observation_id":"829edf38-e5b4-4ad9-8d22-a3912005cd7c","resolution":{"observed_at":"2026-08-01T12:53:25.860265Z","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-01T12:53:26.040875Z","title":"Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.040875Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:b47a40fce629d663c6a5d501cc9d14ffd59d34cc289c56db0e7912a276823e72","observation_id":"158c31f6-680b-4759-a6f3-644958001748","resolution":{"observed_at":"2026-08-01T12:53:26.040875Z","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-01T12:53:26.145369Z","title":"Proceedings of the tenth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.145369Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:1196ede5779da33aefb904a2ce8ac7df8598491f298e1b5f588687f3f5347240","observation_id":"8acc1b92-30b3-43ca-b442-58e621a9bca0","resolution":{"observed_at":"2026-08-01T12:53:26.145369Z","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-01T12:53:26.251189Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.251189Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:845b108fd22002ecdc86e9790b6245b7fcf7bb7a4b23a17b51cba12f1750166a","observation_id":"9737662c-b6d1-4dea-904a-084216e4a256","resolution":{"observed_at":"2026-08-01T12:53:26.251189Z","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-01T12:53:26.378256Z","title":"Proceedings of the 57th Annual ACM SIGACT Symposium on Theory of Computing , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.378256Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:c9b5b4eee945d11fe455e8bad4b9db0dde14a19d24cf6d75df0724828a49d8f4","observation_id":"5192c434-d675-4a19-8502-48343ae01a16","resolution":{"observed_at":"2026-08-01T12:53:26.378256Z","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-01T12:53:26.426138Z","title":"Proceedings of the forty-second ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.426138Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:3775a6899c6eb7cc09765eafe14b0a1e3e21426f7831c5549f3081a0c035171e","observation_id":"f19a62bb-24a0-4545-ae89-57211ee5eb6b","resolution":{"observed_at":"2026-08-01T12:53:26.426138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.3365","last_updated":"2012-12-13T23:27:07Z","snapshot_observed_at":"2026-07-06T03:02:00.289526Z","submitted_at":"2012-12-13T23:27:07Z","title":"Expanding Polynomials over the rationals","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.3365","snapshot_observed_at":"2026-08-01T12:53:26.543094Z","title":"arXiv preprint arXiv:1212.3365 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.543094Z"},"links":{"cited_paper":"/paper/1212.3365","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:85302c29df10d33853f62ca031a19409ea81b82727397505dda5eafc978cf162","observation_id":"9f8170e0-720d-454c-b85e-36f2185d3701","resolution":{"observed_at":"2026-08-01T12:53:26.543094Z","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-01T12:53:26.656773Z","title":"Annual International Cryptology Conference , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.656773Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:a7deb174ba0f829eba807e6f377c4c827a45630a672d42744f0b962890618223","observation_id":"385a2960-4ecf-40f1-a5b8-682cbcc25d30","resolution":{"observed_at":"2026-08-01T12:53:26.656773Z","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-01T12:53:26.810120Z","title":"Coding Thv , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.810120Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:b9f984d0742b4b7f6a6cb5d29a1b90fd6a5cf230a5cdb00a370268366a230f91","observation_id":"1c167b38-89a3-429d-ae31-60b34c7b3d12","resolution":{"observed_at":"2026-08-01T12:53:26.810120Z","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-01T12:53:26.911798Z","title":"International Workshop on Post-Quantum Cryptography , pages=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:26.911798Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:346c374e11118054398eff09ce6e11be6d348feae2662f8e8ca398a956349a9e","observation_id":"ae5c1877-9777-4cf0-9f5d-fc525d4f161c","resolution":{"observed_at":"2026-08-01T12:53:26.911798Z","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-01T12:53:27.037798Z","title":"1994 , publisher=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.037798Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:c29d214536fdcfc92259944a431bbf5dbae8eeae2eddfb9ce9d9d852ff002741","observation_id":"4b47a242-04d6-4b86-83ed-8eb7339b490d","resolution":{"observed_at":"2026-08-01T12:53:27.037798Z","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-01T12:53:27.188790Z","title":"Advances in Cryptology—EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8--11, 1991 Proceedings 10 , pages=","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.188790Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:6fe48e05f2b0042b3803a9715526b196e92487999acaa7d51e4ec242296ef5dc","observation_id":"fb5dbdf1-21b8-4b60-83d1-eaa5d870fdeb","resolution":{"observed_at":"2026-08-01T12:53:27.188790Z","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-01T12:53:27.254926Z","title":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.254926Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:36950fd1a614455fcf7a44ea2e978d65e235b944a491610829f6b16fbb9731a5","observation_id":"0e2b2191-fe54-442a-8e58-7b90dc76e721","resolution":{"observed_at":"2026-08-01T12:53:27.254926Z","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-01T12:53:27.331123Z","title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.331123Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:49ef4b8542743d7a76eac6f6f1d83112aec44b8a1f0494b91905e9af37ee674f","observation_id":"7af0967b-dfee-4ae1-8ab5-f9b3b5ac03df","resolution":{"observed_at":"2026-08-01T12:53:27.331123Z","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-01T12:53:27.420068Z","title":"Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.420068Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:7d720e384df0c756c12a24c45cfe4502d83c573097f0b47cf0d946efb6364483","observation_id":"1e615135-c158-4911-a18f-65c0ae55e29f","resolution":{"observed_at":"2026-08-01T12:53:27.420068Z","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-01T12:53:27.452629Z","title":"Studies in Complexity and Cryptography","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.452629Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:43ac2b0da657a97e7c197c86a1e57a7bfa59f4593cb9adfea115d76b658003fa","observation_id":"5bb667e6-c4b0-4476-bd87-355bfc98bbfc","resolution":{"observed_at":"2026-08-01T12:53:27.452629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-07T16:00:27.894749Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15394","snapshot_observed_at":"2026-08-01T12:53:27.551431Z","title":"arXiv preprint arXiv:2504.15394 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.551431Z"},"links":{"cited_paper":"/paper/2504.15394","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:9742ee608b0e895fbc94f44719ec30f4bab83770394d72896de0ead8894c636d","observation_id":"ad5161d0-32c4-4d8c-a342-6454fcd9be3b","resolution":{"observed_at":"2026-08-01T12:53:27.551431Z","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-01T12:53:27.640020Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.640020Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:cbe7aa7f8ad91ea46aaaa7ecaaaf94012e8bb029a561d3796c2ce5aa0fc2be0c","observation_id":"94a80e1e-ac50-44d3-b061-6a5e00600880","resolution":{"observed_at":"2026-08-01T12:53:27.640020Z","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-01T12:53:27.749162Z","title":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.749162Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:5ac94f42aede852d656a4ca9a87068d54c9abcec0dd01f5ddc36335a05a9c370","observation_id":"f2fc8194-e89a-479d-9b2b-4fbd0041775d","resolution":{"observed_at":"2026-08-01T12:53:27.749162Z","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-01T12:53:27.853208Z","title":"2018 IEEE International Symposium on Information Theory (ISIT) , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.853208Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:9f89092fc2f7fa30a79813196a011dedf3acbee04ddaa44945205f051f782ca2","observation_id":"762e8144-d68f-40e3-ab1f-d97adc4b13e5","resolution":{"observed_at":"2026-08-01T12:53:27.853208Z","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-01T12:53:27.930433Z","title":"Innovations in Theoretical Computer Science (ITCS) , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.930433Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:f2a04ac5101f7a218f0e1dabdb2718e8b5869345887234be0cba12952899934f","observation_id":"3898e29b-49b1-4f10-9703-f37dd7ff9598","resolution":{"observed_at":"2026-08-01T12:53:27.930433Z","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-01T12:53:28.087712Z","title":"2014 IEEE 29th Conference on Computational Complexity (CCC) , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.087712Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:5440da65c98224a0932db28bb57e19e3a25eb263d19e5d75aa3bc38e06afa674","observation_id":"273b2a56-4ac9-4225-bfaa-44716e633693","resolution":{"observed_at":"2026-08-01T12:53:28.087712Z","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-01T12:53:28.226911Z","title":"Lower bounds for the polynomial calculus and the Gr","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.226911Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:8f0217e9bbb1e8164fd0c361ffaff0f32edee97c637d9b1b9a638c428b38a628","observation_id":"abe973d7-aa77-459d-bf3e-d99a18280f8f","resolution":{"observed_at":"2026-08-01T12:53:28.226911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13978","last_updated":"2020-11-07T15:39:14Z","snapshot_observed_at":"2026-08-04T20:59:09.887681Z","submitted_at":"2020-04-29T06:38:37Z","title":"Planted Models for the Densest $k$-Subgraph Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13978","snapshot_observed_at":"2026-08-01T12:53:28.407121Z","title":"arXiv preprint arXiv:2004.13978 , year=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.407121Z"},"links":{"cited_paper":"/paper/2004.13978","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:9e77c9dbcc38c67a048b68cf89558955aef1b892888f0e375091b97fd5be8cbf","observation_id":"232496fe-ad40-4be2-8ac7-4886dd4d5042","resolution":{"observed_at":"2026-08-01T12:53:28.407121Z","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-01T12:53:28.571767Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.571767Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:45ad4ea3fda86f84cae7da8ef6874a1553f7169324cd94445fb1608652734c94","observation_id":"46c4ca71-a440-4fe6-b4c0-02c1c7c50d3e","resolution":{"observed_at":"2026-08-01T12:53:28.571767Z","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-01T12:53:28.712851Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.712851Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:a0f01674f8336d12852e6c5e692b70164958fe6cd03259bc5d630c1ce47d64f6","observation_id":"d36f5019-a7a1-4180-b864-89f8b2ce5036","resolution":{"observed_at":"2026-08-01T12:53:28.712851Z","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-01T12:53:28.821181Z","title":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.821181Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:805167af37f2c62571d4e232481845fdbd6874bdd7717822f00552df42d976e1","observation_id":"bd59cabb-6c33-4e35-810c-8251f09e5c5a","resolution":{"observed_at":"2026-08-01T12:53:28.821181Z","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-01T12:53:28.968703Z","title":"37th Computational Complexity Conference , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:28.968703Z"},"links":{"citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:3ef36c9daf813695b1af41cd37938871e10f7c90908031dca514e3e2f66e82a0","observation_id":"d4d290d4-b14b-4742-b9f3-29250dd733a1","resolution":{"observed_at":"2026-08-01T12:53:28.968703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":157},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 157 outbound references and 0 inbound Pith citation observations for arXiv:2607.19342."}