{"as_of":"2026-08-14T14:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13e957f7fe2f7c6b75c17f735e24c8b83e0646e400d61a63c594485449661b74","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-08T13:09:37.440091Z","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:d66040cf68698c787c6e7cfef41047bd3c757e9181dc09cc41ca74bc45ada325","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-08T13:09:37.440091Z","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:651b1c8588a34fef3cd4cd2d53f9158ff68cdc663594c2826276f2bf4fd7f8f9","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-08T13:09:37.440091Z","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:23134a43f899220002b2ef690ce70507846fd69912cd5a8639fc2759b0310715","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-08T13:09:37.440091Z","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:ea65a79944b6d42df007c7ffca5057a5e89874bc3b21abfed80342880e9fb301","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-08T13:09:37.440091Z","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:8d8d088cb679e4284bf766c8b94e2ffcccc9f1fe529e5ef8faa2320b0121ef30","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-08T13:09:37.440091Z","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:b57d9b8b3db157307da817642a3e9ad17c44ebac7fb0a49351b879407c81c8ae","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-08T13:09:37.440091Z","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:9bc88c04fc4cdf41ce2e81b012f08992efb2feb144655d25c0d1e5bacfaa96ac","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-08T13:09:37.440091Z","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:7a2eee478bac1757db256804ea85796bdbfd17a8e8cc252f884e8abb4259020a","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-08T13:09:37.440091Z","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:dfd422e577e4a54f9455cb8674306b5ed62ee77406e8ba0df6b15493e2f24a53","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-08T13:09:37.440091Z","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:69e2569008de036446b85eec4d524ddb51053c7907ddd129a89c912444200193","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-08T13:09:37.440091Z","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:4dd1fe9bedd8fbc364c48e971a9ebe242674f37d0d8baac6b138ddb9608728b9","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-08T13:09:37.440091Z","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:cb8618707a7105d1bad8f704f9a5958f176c3b0f4036ad9f8e4f5cba49801c30","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-08T13:09:37.440091Z","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:60bd20d90d3ba24f9354f6b1862488de12159eed212468679d4256da13feb79a","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-08T13:09:37.440091Z","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:67131998f0b700d80a8d32b1931cf32496ac2c51b0f65c42f2b5924545cf8098","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-08T13:09:37.440091Z","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:80c0990f43f4454e756cb435cda7869906b2987bc2562bddfbd06e93e6bf8cab","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-08T13:09:37.440091Z","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:1321d7d16735b76a5ed2111804e0b9f3cc8ee1a8c47dd652422e7318f14a53f9","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-08T13:09:37.440091Z","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:3a06ebb609b2ce61e6d239d4ae97b7f147fbd5b8c9956138149b875a60abe77a","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-08T13:09:37.440091Z","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:86b11d29a197fb97472049ccac1e5464fdeb706ae9c889004d2ae61a8ece7d5b","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-08T13:09:37.440091Z","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:ac9fb848fe1cd70410ce96d1009d54e84a4829870b3706e57f5f6822b1abc010","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-08T13:09:37.440091Z","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:df7272d1d8f0e394eab2f14bf1ef36ae84d8df3f157629b5f49bacda9c8b815f","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-08T13:09:37.440091Z","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:b73df073f99344fc8765af14d3ceff35a5e8e0731f196e427ad3d7668891fa21","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-08T13:09:37.440091Z","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:02bb507df876defddac7ade92395fb631eb8a202d2da88046a0bdcd1d958a235","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-08T13:09:37.440091Z","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:e2bf6316cedbd6ad8f152b60a8585bda46d50001f32e75aba28edef4b2c76b33","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-08T13:09:37.440091Z","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:c0c4573380104114d5a0053c26a7045b65af4a0d1b2ed9a771ff0dcbf9e5d50f","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-08T13:09:37.440091Z","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:2ebed3f78b5164d0cf9314a465fd3330dcb6f0016646cdca92a25fd49e8dccf1","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-08T13:09:37.440091Z","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:6c910119456e4849f4cbf4cefb1d4e5eb0b7917335e248da903e936f05396a53","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-08T13:09:37.440091Z","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:359db457c75fdfd9e6e596249d3a039822a17dbc8f12b4c419a1734644385d9e","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-08T13:09:37.440091Z","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:9e2fb50a032cadfa795842ecca0cc8fde1108aaa11c1600da97e52b766b1862b","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-08T13:09:37.440091Z","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:eacfc88a60869027eafdf32d55ec49dff680ee9dc0dc8359ae5fc2903bc999d1","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-08T13:09:37.440091Z","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:85c6a4d9084504eeef7e7ccc4f71a005a67ca50e55631075bbe9a609e11c1158","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-08T13:09:37.440091Z","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:60fe0c18981203a62217e63a2e48f02263d63397d15b20283028f93beaa25af3","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-08T13:09:37.440091Z","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:def007dc276df2ad0bb6a269bc36e699811d1e8e9fadd70a194cd9388e103d9b","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-08T13:09:37.440091Z","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:84d163797b2632f04f5264ebd14161456a00e01627c302a8c1b51fee2e687aa9","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-08T13:09:37.440091Z","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:186d2cf68e3fa1f26389bc1d89d35cf67e7a01f292a93ab0fdbfb1c04c1fcc21","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-08T13:09:37.440091Z","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:a2dc14b72acb7d632ec986e82955388e63c13b057bd95048063929a9c2e62e88","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-08T13:09:37.440091Z","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:9ae128873ca47cf357138b36beab6df16edeee419d50c70ec2386be8debfdd6d","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-08T13:09:37.440091Z","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:3b6cc1e6f698f05db139e7007552a21507b4b7cd7bf84b77495898626911b71e","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-08T13:09:37.440091Z","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:31fefc526090806c09e4688434ab2c259cc25b09dff07c5bdaaa9caab60311fb","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-08T13:09:37.440091Z","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:2fa7f79c019134857cc467d6019c839fb3a7f71db5f3742c25a8201bae1f0c8a","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-08T13:09:37.440091Z","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:ba844cd8091ac4fc3fcc5466f33f19412e5f92f04e9c17a8b895dddb5c509ca3","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-08T13:09:37.440091Z","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:32bd70bec46dced601d7eea282808c5d8b92cf082b7b05ac247b936c0d42af31","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-08T13:09:37.440091Z","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:542b99375f51eab7f492c9f406379ee5679afd119ce76bd3aee421af9ad375fd","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-08T13:09:37.440091Z","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:67a14f89433a626e6b803ff3254d32a8b5bf3484817c75860fcf14ae736ff3de","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-08T13:09:37.440091Z","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:8200f2084065ebc9cf44e97b95e3589179e82635799a5afd299c6aac0f8dbeb0","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-08T13:09:37.440091Z","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:f827d0c7fb9c7972c63cbe5c67985c9b0e0502b05ed26c7024ecad0c50224eab","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-08T13:09:37.440091Z","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:de26f9039af41182c75b6d37de111f2ec55a45be1b767d66d09f9eb97475b0e3","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-08T13:09:37.440091Z","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:dde2471316dac64180afb823dd76d8201a847764dccb567804a97cd8ac639e42","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-08T13:09:37.440091Z","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:719256232f718a7c60bea70bd90df5e09e23ca1be4f2a045692143f1da4dedae","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-08T13:09:37.440091Z","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:8221b51984f7a0c6501dc2454f30623cdfa25abd2c20252f8984a5f3d5fd37b1","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-08T13:09:37.440091Z","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:172bb12f169ad1936e65eebacff26c4da91fcfd8fc120ad331c061b1e16ee358","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-08T13:09:37.440091Z","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:52bd9ebccd0114425c80c26e804c9b3e730d3280f5ba7d870636fc79363f7d88","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-08T13:09:37.440091Z","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:dacdb62de1cb52eb4ff84c0f1d67d4e44b7f3089a790d08c8b112be495e73afd","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-08T13:09:37.440091Z","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:2cb7f7233fcb4fdb97c27e297fa9ee4d430c216df7307dd6058c4e4dd0393dde","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-08T13:09:37.440091Z","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:0617a77f25e3bd65ec6077e577daccd5f35dc1d50f0efa490964e5ff735e34f7","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-08T13:09:37.440091Z","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:d1cd4a5c4e7f613453d55c2613818867cc3f99f19122b73570a16d9f471f0987","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-08T13:09:37.440091Z","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:76c65e51417f96a032176f6508c5a6cc8ea70fbc0f7a699d2b2ccb565637696a","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-08T13:09:37.440091Z","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:bec7649c9dc2ecfd1ecd09200673fdd53a80c6119c9e6326fc18fe861666e4c6","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-08T13:09:37.440091Z","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:3f9e5c566f1fafdc497676c8402824ab918f32346d87e12323793cad38a1d3ca","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-08T13:09:37.440091Z","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:caa7818f42bd62c5215b6b06dc8327df268e25a606a4669ee56191f8feab43fb","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-08T13:09:37.440091Z","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:58c72ebaf525b76139882e9d29cf81c151e83960c2144c6f19d36d09ecd182ad","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-08T13:09:37.440091Z","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:ff09b2612f5617272184233221c61e46f0541b6380af8200d86ee6731ec61516","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-08T13:09:37.440091Z","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:d72e941b6ff98c59aed07bbb2baa0346b953c02f059329503028fa3ae6fa2cde","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-08T13:09:37.440091Z","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:a735fd497231ddcbf91c767f4736a40d85e7283e1f592c30db469f6a41926a09","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-08T13:09:37.440091Z","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:51346fd3c3dc2dc0fd6f3219c7e719da0267a0cae2f0c72818232dd89b4a7c58","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-08T13:09:37.440091Z","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:5130b08bc5cbe5e8a7a6979add617a7a47e634b97851f3ca15bbb27c20e7b2bc","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-08T13:09:37.440091Z","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:09b5fc88e82ca5a8b040b205a8afeec462325c4f616342c69e6c14bd87c274d4","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-08T13:09:37.440091Z","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:cddcd51c70a93dc08e0de0415d62213005cabe4309b1aff8b94c8ff9649f1f75","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-08T13:09:37.440091Z","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:212b41df63efc6d51d1e9f0044d2f558a72f5209955a28295860b194b20cf7a4","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-08T13:09:37.440091Z","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:efc71d12b224ae2e2c64762b55b968ee8e12eab966f2f6a7bdebc03e815369ab","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-08T13:09:37.440091Z","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:e7899dc83a394d73bbc8d6f2a1fea1bba0dc58d0dc653ae63b7369db5a8fbd91","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-08T13:09:37.440091Z","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:9e4acd0969123b72e3550c9ecd0fb73375b456b8c25cd18dd5b2feb1e6a36a7d","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-08T13:09:37.440091Z","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:e4e49356794df438863a8878f54c553c7107f16a28858086e57af14e41510f29","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-08T13:09:37.440091Z","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:0abe51271f89cfc00fdceb418cec8f3d565fd5d558e15832dc5a5f5c433cd08a","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-08T13:09:37.440091Z","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:90e784cc4e249b6852019ddbd54fa03818110005a0ef687a8342c4b289be6b6d","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-08T13:09:37.440091Z","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:5ac8bc980c1e23d7764632246a2fea9c6f3c94a72059759c89b73f5d0d367298","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-08T13:09:37.440091Z","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:39a4df8f85f1dd42a7d91152e42c9e33743e50ff2bd1ecae1adf4235e6d54a0d","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-08T13:09:37.440091Z","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:c5a99782b6bb2067b74a52586a120efa97a06c4575c9e65287d0b6d910200b98","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-08T13:09:37.440091Z","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:eff92cb7bea5f8ec73892339a399290b5b3398a8b3b840a5f1f44da405bd9e26","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-08T13:09:37.440091Z","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:fc1a0c0497d4deed5e4b16af7aa2bdb78f4e3baffb1e0914f3d7782a3e07144d","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-08T13:09:37.440091Z","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:17a35751aa7614dc7fe4837e94032c16a30d7adcf57e3abfaf5aafc3fa428c12","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-08T13:09:37.440091Z","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:a3ac54b720a63ac2045f11799e601239e5502c423441a578e78214758a819691","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-08T13:09:37.440091Z","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:f2b44521d3962528a37c417fff203c92b51915da79375f4f462361b360bd7baf","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-08T13:09:37.440091Z","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:5927bb1e36221738f8661105d19527adcb72e6d50c607ea067092a80717ced8a","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-08T13:09:37.440091Z","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:de2197eb42fa4e76003896f4ebf211e45ea372f310dd632dfaf19f83be3b6eef","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-08T13:09:37.440091Z","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:c88bb1e429f8f9a9002024f1e1e15b6c1c0397fa2e155882198dc18a465ed7b3","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-08T13:09:37.440091Z","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:06acb00da7b9cec4bae4785882e12a086dc3e76395d7dfbdf62d419b3e625e44","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-08T13:09:37.440091Z","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:f700d62cdaaf0c0748c3a8bad6f00df9929bd0108b7035890e002b67f77698aa","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-08T13:09:37.440091Z","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:32cfde0050ec664a7c2d589bc1a0d9208a0b4c018aaab6dda0d34f9c147ccc1c","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-08T13:09:37.440091Z","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:7386b137aa59ebf064aab60e1deb4ad08918d32c2c1f63e918079bb490dea47a","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-08T13:09:37.440091Z","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:9ae3d9eb2da0463db76defbd69e1fa03b4804f27c6ed9c0ae19d38ad2ca3a5cd","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-08T13:09:37.440091Z","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:1c947bec338d6c5595558f76d565a46b6e4a968f05b0a2df7235f770d3b14918","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-08T13:09:37.440091Z","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:48dab0db436b1d0da8501561f059baec65252b22c04b9d38988071cad4a6f39e","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-08T13:09:37.440091Z","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:87776e674c8dc895fd406e9f4cd8a76f1cb57a59ce8f12efc58ac4317f0d8dc7","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-08T13:09:37.440091Z","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:bf46bbd0746f9d76b9c68a92e649aff135b57e494d2b629f15d71496c7c223f3","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-08T13:09:37.440091Z","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:c0c3e861b168fdf8da44c09b1161afac5cabfcb5c50ef7e45055f1646a75a45c","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-08T13:09:37.440091Z","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:b1edff7f38d932cd9ff04429885e9beed7c0b7a8c7b3e29e5d2479e2825d5e6d","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-08T13:09:37.440091Z","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:fd9ab8b8b80874b73a14cbc834f887ec631a96446f7510985d7d4b4d54608338","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-08T13:09:37.440091Z","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:1a27a396cf729c346e2a79b07186e84dbc4726aec4ce0cf8783817ad72f8db54","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-08T13:09:37.440091Z","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:8d0634298a62f781e8b19bd79775b9c661964d7b849ce2461cd09b71af02cbd8","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-08T13:09:37.440091Z","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:1df1799ef48b863f596f193f71f449a8861121ffe3cefb1415e883c54c111938","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-08T13:09:37.440091Z","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."}