{"as_of":"2026-08-16T12:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7c8d0e94544bbdb1cdbe36523bbc5e6a28ddd59c942d86fb3a785f464c9ef70","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:22:01.024989Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.09378/citation-record","integrity":"/paper/1908.09378/integrity","json":"/paper/1908.09378/citation-record.json","paper":"/paper/1908.09378"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.882621Z","title":"JaJa, Introduction to Parallel Algorithms","venue":null,"work_id":"6dce6d1d-4aee-4d57-8684-7ca7055a3517","year":1992},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.873201Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:76ea48f2275d33f9eea05c53fee237b833b76b9e7ed6d2a74db4c396645b5b0c","observation_id":"0fe11ea1-65d8-4b77-ae50-2ea0dc73e1ad","resolution":{"observed_at":"2026-08-14T11:22:01.887523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.867081Z","title":"The input/output coplexity of sorting and related problems,","venue":null,"work_id":"db607fa3-93c4-430d-b435-9c3370596211","year":1988},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.878933Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:dd38d322ec6e84f72f7becc6340ed2da37a482e0bfeaac0da787660a103e63b0","observation_id":"dfe60ea0-7ccd-402e-9ff5-4d74f4b3d15b","resolution":{"observed_at":"2026-08-14T11:22:01.872353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.852067Z","title":"Fundamental parallel algorithms for private-cache chip multiprocessors,","venue":null,"work_id":"75f29f01-9d64-486a-84d0-43ad6e256c8a","year":2008},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.883801Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:00bc8192a8e0a9cf6192e77ac228f97e897bc350ba53b3c41019f97157c2bd7f","observation_id":"b5986915-0927-43c6-833e-0eea80098b25","resolution":{"observed_at":"2026-08-14T11:22:01.856854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.836308Z","title":"Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths,","venue":null,"work_id":"353f866e-f4db-4f36-a120-63926958befa","year":2004},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.888881Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:ea10a9ddfc8e81a34d585dcd8036052b0c2cc4fdb405437533cc8d5afdeeee38","observation_id":"33f1c368-c0b8-47d6-ab28-bcbd5193bbd1","resolution":{"observed_at":"2026-08-14T11:22:01.841297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.821348Z","title":"A parallel priority queue with constant time operations,","venue":null,"work_id":"5dd396a1-8e18-4ded-815f-07ee28240ccd","year":1998},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.893923Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:f39d935c9e15ef8c5a0159a35708f6b2365428c1012da5180f9b7fc8b476c41f","observation_id":"947c3f46-dd86-442a-b554-f2a207e07ace","resolution":{"observed_at":"2026-08-14T11:22:01.826480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.806058Z","title":"CUDA nvgraph library,","venue":null,"work_id":"966c6235-1adf-4bcf-af8c-9dc76bdcc336","year":2019},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.899094Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:4de4b299a750cf134a6f5d84079b88220b29a8c8494a2498681703fc26f99960","observation_id":"9acc562e-d78e-4f91-b9ba-db9a76f08cc2","resolution":{"observed_at":"2026-08-14T11:22:01.810889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.790401Z","title":null,"venue":null,"work_id":"c218fa1d-bafe-4327-9110-eeb122ba210a","year":2001},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.904786Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:59194ee585113730fd553829e1d90202199bce8bade8760b4f4e2453800d6fb8","observation_id":"cfc08776-dea7-4441-9a2e-7fdc8bf23d7c","resolution":{"observed_at":"2026-08-14T11:22:01.795089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:00.909995Z","title":"The pairing heap: A new form of self-adjusting heap,","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.909995Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:8bd22c4355c9bfd0fae55a32209176d5c50c952c1abaf53ffa56ee1cd808ae41","observation_id":"33ad17b1-4612-4811-9bae-7fa5a6cb44bf","resolution":{"observed_at":"2026-08-14T11:22:00.909995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.774717Z","title":"Very fast optimal parallel algorithms for heap construction,","venue":null,"work_id":"b55f7c9b-88b4-4675-abbb-1fa56553c92f","year":1994},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.914901Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:9a946fd06b81627dcf65a4569dc0055a718801feef1523b0987d1a9d11cff526","observation_id":"676331fb-d04c-4b6e-93a3-9a63c287bdaf","resolution":{"observed_at":"2026-08-14T11:22:01.779684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.758814Z","title":"Fibonacci heaps and their uses in improved network optimization algorithms,","venue":null,"work_id":"5ef2456f-f8b9-4f0f-b4a8-e703e2ff6b32","year":1984},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.919556Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:02e041e67444e18dab3443a307b81f43c641c277fb679873c64433149f4b870a","observation_id":"5c1a6128-c3ea-4019-ada7-810fbd45e15b","resolution":{"observed_at":"2026-08-14T11:22:01.764562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0020-0190(96)00148-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.059063Z","title":"An efficient algorithm for concurrent priority queue heaps,","venue":null,"work_id":"c58c3365-e8ce-4b43-be6e-73ac1f3ece56","year":1996},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.924117Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:9c818a2473c0dcb4169854620c18bd287469bb1d1056fa95110ab8abfd12fdef","observation_id":"1b038861-db22-4c1f-8a94-d95c3da93c40","resolution":{"observed_at":"2026-08-14T11:22:01.065951Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:00.929709Z","title":"Cache-oblivious shortest paths in graphs using buffer heap,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.929709Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:b12ba2d7416e856ccdb7cd82a94399520749567f5750311189b602da469f6cba","observation_id":"865ad388-bd23-4487-a4de-d537760ff4ca","resolution":{"observed_at":"2026-08-14T11:22:00.929709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.743439Z","title":"Performance evaluation of priority queues for fine-grained parallel tasks on gpus,","venue":null,"work_id":"9b6c0597-e119-49a8-8b95-226bb4c14d5c","year":2017},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.934347Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:b53333b98bde9426b000354f07dffdf1bf0e59c4227faa0cf143c719d962d64b","observation_id":"86b3d5c3-9de5-4ac0-a2b5-645db77533a0","resolution":{"observed_at":"2026-08-14T11:22:01.748573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.728218Z","title":"Design and implementation of a parallel priority queue on many-core architectures,","venue":null,"work_id":"9ecda245-5a85-49be-b2b5-510ce58cdd36","year":2012},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.938871Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:4686b166182c80d056896b1510ab10565636b59eb912bd17f77e44390a405aee","observation_id":"5245842a-f98b-400e-83d2-a850c1ff45d6","resolution":{"observed_at":"2026-08-14T11:22:01.733118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.713253Z","title":"Undirected single source shortest paths in linear time,","venue":null,"work_id":"1b76f652-cc9c-4dc4-8ad9-fdd1a97d7684","year":1997},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.943283Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:229ed72cf3f812e4d7e59d77ef2bbbfb53c909b830c38efd338fe5564e920cff","observation_id":"0217f59d-f14b-46de-9287-35b2cab2ec0a","resolution":{"observed_at":"2026-08-14T11:22:01.718254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.696165Z","title":"A parallelization of dijkstra’s shortest path algorithm,","venue":null,"work_id":"d52cbbc2-e1df-40c8-9277-12543aa45e04","year":1998},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.947760Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:9d0afd22fc2f490f9fb9fe886152c36daaac350f1fa87eb3f2098747f8b7aefa","observation_id":"0dae8f10-5346-4cab-89d8-7ad4b28a0637","resolution":{"observed_at":"2026-08-14T11:22:01.701883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.680339Z","title":"Delta-stepping: A parallel single source shortest path algorithm,","venue":null,"work_id":"ae9887af-b8b0-40f9-bd3a-632d84e49f96","year":1998},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.952279Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:33b5af4ed9fff2459320c8f033d08bf769947aac19c304018e6b44a0d7dd4254","observation_id":"0bc47967-f831-43af-a080-97d2621174e3","resolution":{"observed_at":"2026-08-14T11:22:01.685500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4872.11488","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.444304Z","title":"Handbook of theoretical computer science (vol. a),","venue":null,"work_id":"f7ba0696-ff47-44ae-b035-3d06e324df73","year":1990},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.957794Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:36a9e2a769a9c9df477c14669f224dc3ed24b18e28aeb602205e0de2873dc248","observation_id":"ccc47605-f611-4c2d-86ee-509a359a03c7","resolution":{"observed_at":"2026-08-14T11:22:01.452250Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.662938Z","title":"Arora and B","venue":null,"work_id":"1535fb66-3bc9-4890-bebf-5a32fedf11e3","year":2009},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.962683Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:1acf612abec09b614520a3cdf19847ab653f4627ef2280510b7b492c790f4c0c","observation_id":"5ef96c50-7b45-48a7-b19c-abd13f90e9e9","resolution":{"observed_at":"2026-08-14T11:22:01.668832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0901.14191","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.357142Z","title":"Efficient parallel algorithms for computing all pair shortest paths in directed graphs,","venue":null,"work_id":"fb66f1e4-3ba5-4cde-b55b-877964d8983b","year":1992},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.967650Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:9770835339d90e10efd785357c886bdb73fac8882ca6397b8f161f9f5791c409","observation_id":"c29cd8d3-dc31-41ed-8e3d-a459862f9c53","resolution":{"observed_at":"2026-08-14T11:22:01.365062Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.647283Z","title":"Parallel shortest paths using radius stepping,","venue":null,"work_id":"3f30512e-b9f6-435f-91e4-20491cb79889","year":2016},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.972595Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:7a44bcb83474f95c3cc18f5ba66263ce5ec3c0e3acbedca5faca2e20eea2164c","observation_id":"207a5127-3d11-470b-b413-f7b389d2731c","resolution":{"observed_at":"2026-08-14T11:22:01.652138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2174.17822","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.280708Z","title":"Accelerating large graph algorithms on the gpu using cuda,","venue":null,"work_id":"03725bbd-e44f-4781-b65d-d6a584cac620","year":2007},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.977479Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:25aab12abfdb391e700a728006697e2ef04acadd252adba7cd901634f9909698","observation_id":"aecc9806-6a30-4c7d-af80-8ebbed61198b","resolution":{"observed_at":"2026-08-14T11:22:01.289585Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3957.14139","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.205800Z","title":"All-pairs shortest-paths for large graphs on the gpu,","venue":null,"work_id":"26ff6622-6c23-406e-aa17-18734d522aa5","year":2008},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.982459Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:5e67058e9e26cd8ee806530287502e1416470220a628c5f149b77086468d425f","observation_id":"94e8d35b-6b4c-4726-bae7-fcbcc42ef397","resolution":{"observed_at":"2026-08-14T11:22:01.213690Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.631383Z","title":"Work-efficient parallel gpu methods for single- source shortest paths,","venue":null,"work_id":"fc6044f3-14d4-4fa8-bc51-279e028a93f0","year":2014},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.987318Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:e8e1442e413a6fb048430c0dc96ebd6b4be0ae7a6244abd1f0ba1052578ba5a7","observation_id":"9753886d-d77c-4789-acac-93b09032ca1d","resolution":{"observed_at":"2026-08-14T11:22:01.636571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.614629Z","title":"Gunrock: A high-performance 19 graph processing library on the gpu,","venue":null,"work_id":"701d8d72-4407-45cb-802a-01797a692509","year":2016},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.991906Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:537a4fc957c277e090e14aa91c34e23c2da08fbcb1b2a4401138aebd0cc72f53","observation_id":"68873c94-b4bb-4e8e-9ca8-61cd254bf58f","resolution":{"observed_at":"2026-08-14T11:22:01.620375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.597624Z","title":"CUDA programming guide 10.0,","venue":null,"work_id":"4266f985-0a02-4d7b-953b-77981aa2a99f","year":2019},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:00.996538Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:24e6f1206507f39b35cb696b0d331345ce4e47ec36c220e142e0163b00d24ce2","observation_id":"5069b3e4-6f01-401a-b1fa-ee15d54c73ee","resolution":{"observed_at":"2026-08-14T11:22:01.602752Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2628","last_updated":"2014-06-20T14:45:02Z","snapshot_observed_at":"2026-08-14T23:30:52.602080Z","submitted_at":"2014-06-10T17:04:23Z","title":"Merge Path - A Visually Intuitive Approach to Parallel Merging","version":2},"cited_work":{"arxiv_id":"1406.2628","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.2628","snapshot_observed_at":"2026-08-14T11:22:01.094330Z","title":"Merge Path - A Visually Intuitive Approach to Parallel Merging","venue":"cs.DC","work_id":"7eee7841-7b8f-41d4-ac3d-e7b41bec8abf","year":2014},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:01.001278Z"},"links":{"cited_paper":"/paper/1406.2628","citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:937b022435c041224134a2b85ada2cf35995a10387fc2b4c84755a60e1c3f23c","observation_id":"84119c85-e6b9-485c-b4b7-7c9a64f06f1b","resolution":{"observed_at":"2026-08-14T11:22:01.100042Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.581083Z","title":"JaJa, An Introduction to Parallel Algorithms","venue":null,"work_id":"dce28f0a-1a01-4d85-8fbd-a7036123139f","year":1992},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:01.006720Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:741d0ede4f6eed482c6e3a594b346e524298e10e6bea719979d7a1fd94991a68","observation_id":"f8027935-6926-4343-bc87-4aa44a00cac2","resolution":{"observed_at":"2026-08-14T11:22:01.586343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.563413Z","title":"Geneva, Switzerland: International Organization for Standardization, Feb","venue":null,"work_id":"673fc67c-2bb6-46a5-b9d1-4d74ab665c33","year":2011},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:01.013016Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:937819985b854732f6a1e7f7fa41d1a4fea1bf48ec0921eead720a9bdc418646","observation_id":"f990dfb2-923f-4b9f-b543-a70b90b80af4","resolution":{"observed_at":"2026-08-14T11:22:01.568825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.546392Z","title":"Thrust: A parallel template library,","venue":null,"work_id":"a63ba89a-8487-43c6-a590-4255537ad2df","year":2010},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:01.019640Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:2ecb1d6756a313fc5dcfbb3d91722877603a8b8e497892d4706aac74f2df9219","observation_id":"c8419bb9-d27a-4540-8b11-9bb274873d5a","resolution":{"observed_at":"2026-08-14T11:22:01.552595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:22:01.528511Z","title":"Profiler user’s guide,","venue":null,"work_id":"a75eb704-3974-436b-b5fa-131437db6c4d","year":2019},"citing_paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:22:01.024989Z"},"links":{"citing_paper":"/paper/1908.09378"},"observation_digest":"sha256:0d712923771a85d043fc99908a074b092d149667da96a7f4fc5225d099f4b52c","observation_id":"38371e27-b88d-46f2-8351-c132d47696b0","resolution":{"observed_at":"2026-08-14T11:22:01.534608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09378","last_updated":"2023-05-12T00:40:15Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T06:55:43.912099Z","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":1,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":21},"total_outbound_references":31},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.09378."}