{"as_of":"2026-08-13T05:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df60b2571b81f488ba22d28c45d7900df93ad2ea58821db2223e53feafc638f5","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:56:41.633828Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2411.16667/citation-record","integrity":"/paper/2411.16667/integrity","json":"/paper/2411.16667/citation-record.json","paper":"/paper/2411.16667"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:41.433161Z","title":"Acar, Arthur Charguéraud, and Mike Rainey","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.433161Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:d5fcdcabbb596cb3d5bc1a95e95c1474dc3f39b5e528a807a41e3578d9bd84c0","observation_id":"7cf92b52-49c6-4f36-b587-f66e91edd371","resolution":{"observed_at":"2026-08-12T12:56:41.433161Z","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-12T12:56:41.438710Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.438710Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:a83587e69ecc09501fdde8d46689165853e50b0040706075aaeedf3f67056602","observation_id":"05ecb4d6-772a-4136-a28f-7baf022f92ab","resolution":{"observed_at":"2026-08-12T12:56:41.438710Z","resolver_source":null,"status":"malformed_identifier"},"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-12T12:56:43.854153Z","title":null,"venue":null,"work_id":"11de9152-72cf-4a6e-9d48-bb8c945f544b","year":2017},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.443249Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:a54ac6f7547b8a284e73617e83ba7d465f00c124df912711a0e1ddbb7c3a8d9f","observation_id":"b144343d-b754-4e6e-bfba-e4032cd86f06","resolution":{"observed_at":"2026-08-12T12:56:43.858719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.448184Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.448184Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:8275661c0d78160d46d60d7499840f7ff216ad1cb839c49ac878728fb214871f","observation_id":"45a0a4b0-5bcb-4677-a57a-833fbf806728","resolution":{"observed_at":"2026-08-12T12:56:41.448184Z","resolver_source":null,"status":"malformed_identifier"},"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-12T12:56:43.839423Z","title":null,"venue":null,"work_id":"58533592-1d9b-4189-b9d6-648fc2163034","year":2005},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.452910Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:a10f873986a4bda60015527986f1b58b6562a5d15d5f6690d5cf4229831d3ae0","observation_id":"a5458c6b-baea-49e7-8460-5abfe25008b8","resolution":{"observed_at":"2026-08-12T12:56:43.844085Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.824392Z","title":null,"venue":null,"work_id":"d845d790-acab-4073-803a-028449a7f0af","year":2004},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.457706Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:6585ad31ec1a32269a501dcc230915a69c1e3a6fa3ac2f5beae52e119578a3a2","observation_id":"1b891396-ab36-450c-a71e-cab826946e08","resolution":{"observed_at":"2026-08-12T12:56:43.829187Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.809622Z","title":null,"venue":null,"work_id":"70a27d40-433c-442b-ae7f-45d5ea52a3c3","year":1980},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.462951Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:351a6d80e0104520dfbe24cd8c1d073e33052f5e47cda2d31279e9aa44c9d1ca","observation_id":"ba00aecb-d61d-4f0d-8ba5-096c113529c7","resolution":{"observed_at":"2026-08-12T12:56:43.814605Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.794173Z","title":null,"venue":null,"work_id":"e94e16aa-dd01-410b-869e-18e156368347","year":null},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.467547Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:76914c0121ccd66eafcd7459b25812727e33c05f1ab533351da339d6e7a1fa3c","observation_id":"c49be056-9ff7-4c4c-a8ba-3f49f5ee64d9","resolution":{"observed_at":"2026-08-12T12:56:43.799715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"stable/3689891","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:43.382798Z","title":null,"venue":null,"work_id":"77e6221e-4daa-4260-9502-794572c097da","year":1992},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.476320Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:90a4c88e8d01bd26fcca27cbc422bd28722f5a8aa85aaad4dc0b668efdb03612","observation_id":"82600af1-c2c3-4407-ab82-09d3e6fe3966","resolution":{"observed_at":"2026-08-12T12:56:43.389759Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.480860Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.480860Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:bf56657070e597bd351df4c3f68238aff4a2c108d796a5e57e87560e481f864a","observation_id":"da95ce4a-cd26-4c35-b1c9-d389b8b5d11c","resolution":{"observed_at":"2026-08-12T12:56:41.480860Z","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-12T12:56:43.768929Z","title":null,"venue":null,"work_id":"de33ea6e-cd46-45a9-b99a-742d39088fc1","year":1982},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.485650Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:52689b6197d21d958c270e60cb466d87e005c526f1e8836fc36fe8090bcbe837","observation_id":"66e64741-c57a-404a-b361-7e0567fda3e3","resolution":{"observed_at":"2026-08-12T12:56:43.773653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/icec","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:43.242374Z","title":null,"venue":null,"work_id":"76961c4c-fe38-4b6a-b3fb-703006cd9ad3","year":1994},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.491178Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:c26c8ab2dfb7c1dbf356349270a07c6f059e389cb424308ba9643d82145a4c1f","observation_id":"2f61008b-5d84-49b4-81f5-2e83e2e9b2af","resolution":{"observed_at":"2026-08-12T12:56:43.247389Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.495727Z","title":"Je#rey, Suvinay Subramanian, Cong Yan, Joel Emer, and Daniel Sanchez","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.495727Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:6afc4dfbd307209a6c6a5b1c0014fe8c1aeb8ddf4260f4057dbaa83e41fe6700","observation_id":"637158a2-7225-47f6-b2f7-d292d717c7e3","resolution":{"observed_at":"2026-08-12T12:56:41.495727Z","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-12T12:56:41.500125Z","title":"Leiserson and Tao B","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.500125Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:cb96d2939e4691b240d4d53fcbd6846d6747eccf681f08d8c2e7622d2ec29d9e","observation_id":"0a584632-e733-4dc3-a651-63b252af2960","resolution":{"observed_at":"2026-08-12T12:56:41.500125Z","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":"4399.17544","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:42.870268Z","title":"Luis Pérez De La Cruz","venue":null,"work_id":"911e266f-97f4-49c5-a79a-d70f11d469bc","year":2008},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.504537Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:1d9c26d20fa90cc6b904c303d5f5b5ebe5f5ca8e5068951188c6eb58e5a820cc","observation_id":"dad7a6b5-9cfd-46ea-8e27-81d4878ae0d5","resolution":{"observed_at":"2026-08-12T12:56:42.877645Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0377-2217(84)90011-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:41.737053Z","title":null,"venue":null,"work_id":"b6bce835-1fd8-467c-821c-22ff06ee430a","year":1984},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.509013Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:2d3555dd2f8607e9021a7195693f471050a18bd478320839dacb0b994aa44b5d","observation_id":"9ae623d8-ecc6-43cc-b55e-0cb473b55b45","resolution":{"observed_at":"2026-08-12T12:56:41.741693Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.513584Z","title":"Pattipati, and David L","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.513584Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:b57506fcf3cf61a8363e5bcf3d5c07e15d30ca5c8521247d48400f2d0db7795f","observation_id":"4a9c52e3-5485-43e2-8a0b-9c6a50084e58","resolution":{"observed_at":"2026-08-12T12:56:41.513584Z","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-12T12:56:41.517909Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.517909Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:a10c46aced73ab90445ffab4ebf097388d205a1b187219335a056b0e4f12713d","observation_id":"c27a305e-fb14-4d32-9160-cc3761e77c0c","resolution":{"observed_at":"2026-08-12T12:56:41.517909Z","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-12T12:56:43.754875Z","title":null,"venue":null,"work_id":"99b47f05-7a44-4354-b9a3-df3cda090376","year":2023},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.522416Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:0fe4d617afccc2ebf1a84884c51858dc50ee3ece4657d0d62b3e71000494fcbf","observation_id":"fab484ff-1a15-4308-aa53-64b8dfb84f7a","resolution":{"observed_at":"2026-08-12T12:56:43.759362Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2000.89206","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:42.625490Z","title":"Papadimitriou and M","venue":null,"work_id":"04f93a88-24ea-4c86-a8c0-4ca9474268d9","year":2000},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.526813Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:f3aa74ebae40a3bd7d43aa65c86a271bcd0538f2d8dbe366113cb861cf8915c8","observation_id":"f299c1ee-3566-4711-92d9-a8bc10ea08a8","resolution":{"observed_at":"2026-08-12T12:56:42.632571Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.531251Z","title":"Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prount- zos, and Xin Sui","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.531251Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:28257036e4dcdd295b25a13e6ae55bc6b2ea426f4a253f9b2e87c3f0b955f02d","observation_id":"51f49003-fde9-4a29-b28e-bc2989035e5a","resolution":{"observed_at":"2026-08-12T12:56:41.531251Z","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-12T12:56:41.535604Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.535604Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:c556412bfc2951877f31019fb59dbc171fc1899e7d5fc97ef4cb61a2c8707f12","observation_id":"1d5d8862-0481-4914-b332-82a37f0602cc","resolution":{"observed_at":"2026-08-12T12:56:41.535604Z","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-12T12:56:41.539867Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.539867Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:482e1de450c072805edb303d44387dbef314b8739022c3185b4c33c2df730a2b","observation_id":"7a09adf9-4cb5-40fa-bfd3-531ec5bee453","resolution":{"observed_at":"2026-08-12T12:56:41.539867Z","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-12T12:56:41.544390Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.544390Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:6e3eb0be25361b8556aa44f218b64c487a55e29a0245bc84595c38e59ce216af","observation_id":"e823e2c4-d0da-406b-b853-f0e289975444","resolution":{"observed_at":"2026-08-12T12:56:41.544390Z","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":"10.24963/ijcai.2023/757","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:41.701710Z","title":null,"venue":null,"work_id":"4bfe5db8-eeb2-4683-a19b-134a8af6aea0","year":2023},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.548919Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:400e9e0248fd7daa7e9367c6aeed43db158d8d40336ee255d13968cb92bb1365","observation_id":"6ded3897-9eea-409b-af76-4b634781182a","resolution":{"observed_at":"2026-08-12T12:56:41.707080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/ipdps.2013.89","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:41.685535Z","title":null,"venue":null,"work_id":"0b0c5494-167c-4d34-87d4-f1d9e7dc6dfb","year":2013},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.553847Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:cb4eb5a418091c56579b70a229151434d201dd94e7d89a871f860b69e0e03dfe","observation_id":"5ec81409-7a48-4224-9096-d92fa2bd9b39","resolution":{"observed_at":"2026-08-12T12:56:41.690891Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.739185Z","title":null,"venue":null,"work_id":"3de58850-6ce3-4863-a79c-d0a113e20dfe","year":1987},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.558854Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:e1567059d1adad512f12c7fdb19594fdb6f0ccb3e6a1186e319e11188562a12d","observation_id":"1599fe7c-a182-45e1-9279-54f1f80cad43","resolution":{"observed_at":"2026-08-12T12:56:43.744976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.00046","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:42.394201Z","title":null,"venue":null,"work_id":"8a80eb49-7336-491a-88de-d407991e05e3","year":2022},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.563379Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:d4630aef2cb032934e3575e81105aee672743503e0927a9195b1a966343a2de3","observation_id":"c265f97b-7bc4-440c-84a1-50e8b3ce94ab","resolution":{"observed_at":"2026-08-12T12:56:42.401564Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.723327Z","title":"Shin, Vadim Belenky, W.M","venue":null,"work_id":"8a475f96-f3b3-4aae-b754-457b9e9b99dd","year":null},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.567944Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:8cf7676f768c4df74efe6de12bfed44890772b3e635d2947cfe4566d8f49cdec","observation_id":"5cf98aff-969b-41d0-96ce-c7ce43fd919d","resolution":{"observed_at":"2026-08-12T12:56:43.728531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.576891Z","title":"Peak, James A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.576891Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:acf74f91e4cfd6f3ab4d358d7910e472d01a8bd4259e058bc6960d9556662e88","observation_id":"62ac7d58-5bf0-4bed-a94a-d6ab7cd61e5a","resolution":{"observed_at":"2026-08-12T12:56:41.576891Z","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":"5234.11536","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:56:42.247049Z","title":"Stewart and Chelsea C","venue":null,"work_id":"675acd27-8917-4b9c-9679-04cb63a0e379","year":1991},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.582822Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:1f9a3c7ae127ce8be2313773d805d9c7ea49c49ced3865ca5fc4c4ffc6f0943c","observation_id":"c6d2a9c7-5699-410e-85ee-0d45a86be4c5","resolution":{"observed_at":"2026-08-12T12:56:42.254238Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.691719Z","title":null,"venue":null,"work_id":"81074d55-66eb-49b8-a8e0-a3c0eb3b467a","year":1983},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.587327Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:61452ca54b08b835c67c264a8ebdac0eee1421a4d2b2e64e43e8922b9cba7090","observation_id":"66aee859-6446-4b17-8ab2-edacafc5a11e","resolution":{"observed_at":"2026-08-12T12:56:43.697078Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.591762Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.591762Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:88db32be5efe7d908f2061c4609f991b6f4fcf46786447cef0e79ab318f9caf2","observation_id":"6a748edb-9c95-4b70-884c-b2f717ba79a2","resolution":{"observed_at":"2026-08-12T12:56:41.591762Z","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-12T12:56:43.675425Z","title":"Baier, Han Zhang, Luis Suazo, and Sven Koenig","venue":null,"work_id":"f9818606-7ad5-47cd-8fcf-6d6e4fcaeb61","year":2020},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.596601Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:9f5b430142ac28fb4cfce741cb73d46d883a56c947958a62b29c47a61bcd2721","observation_id":"730e64a2-2a1e-4e4c-ae46-ff978866e989","resolution":{"observed_at":"2026-08-12T12:56:43.680612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:43.660613Z","title":null,"venue":null,"work_id":"431dd9e9-a2fa-4234-9d7a-ea52837b0293","year":2009},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.600845Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:5bc368a3e583fae4a76fc117f1a798df09c930fd5d258cffee5229aa194ca028","observation_id":"f5fc14ad-2dc3-468a-a79a-d3112b29795f","resolution":{"observed_at":"2026-08-12T12:56:43.665343Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.605462Z","title":"Ri#el, and John D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.605462Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:4670bd19185cf213c6411122b13d333d0f1360a41faf518dbf1748ff44800a12","observation_id":"5ce56f85-883a-4805-98fb-79c6464c08c1","resolution":{"observed_at":"2026-08-12T12:56:41.605462Z","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-12T12:56:43.644021Z","title":null,"venue":null,"work_id":"73347d0a-2cce-41b8-97a6-aa30d0a8118b","year":1987},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.610384Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:21bb85315f01b328993b5745d8050c588fa6cd540e1c3e19f0df75e5350d1b84","observation_id":"bedaf228-effa-4348-a40e-decc1d259c02","resolution":{"observed_at":"2026-08-12T12:56:43.649534Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.614951Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.614951Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:3ea78e24bb35bd7b3f975ebb34a16fbcecc06fe4239f6808391ce0ad04f5a5b3","observation_id":"e1b1479b-893a-476c-9d24-5bdd1cd2835f","resolution":{"observed_at":"2026-08-12T12:56:41.614951Z","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-12T12:56:41.620011Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.620011Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:43f887f710dfbee25df38a48edf7db7d8349a53d2c25f791ca567dec6c6fa0f4","observation_id":"a8291929-b182-4cc6-affa-ba33d1a90a44","resolution":{"observed_at":"2026-08-12T12:56:41.620011Z","resolver_source":null,"status":"malformed_identifier"},"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-12T12:56:41.624562Z","title":"Pat- tipati, David Sidoti, and James A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.624562Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:5eb8a0ca91ee55abcf8f22460785cef4130ede1f744883b982538908b02131fe","observation_id":"e0133f35-0f7c-4108-9744-05212af54937","resolution":{"observed_at":"2026-08-12T12:56:41.624562Z","resolver_source":null,"status":"malformed_identifier"},"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-12T12:56:41.629166Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.629166Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:3f50709cab07ce150eb6c83e55bc2f619174711bc44b79da89270b24d016ca36","observation_id":"8f11f59c-617f-4730-bafd-661708060444","resolution":{"observed_at":"2026-08-12T12:56:41.629166Z","resolver_source":null,"status":"malformed_identifier"},"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-12T12:56:41.633828Z","title":"Zitzler and L","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.633828Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:7141f8339c7755c0a0ae20acc002ed433ef74fb0477db98fe90b2ce3d5f885c2","observation_id":"218f948f-d746-4665-9f45-38297494963b","resolution":{"observed_at":"2026-08-12T12:56:41.633828Z","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-12T12:56:43.707133Z","title":"Transactions - Society Gold et al","venue":null,"work_id":"06e0b83c-2c0c-4882-a72d-ff90757c589b","year":2003},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.572474Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:6f3025c2a9f0dcb9f03979de8c323248091582b619252169a80c8d41826aa849","observation_id":"17d89ac5-915c-4406-830a-4666e0991cc1","resolution":{"observed_at":"2026-08-12T12:56:43.711916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T12:56:41.471938Z","title":"unordered: a comparison of parallelism and work- e\"ciency in irregular algorithms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-12T12:56:41.471938Z"},"links":{"citing_paper":"/paper/2411.16667"},"observation_digest":"sha256:2a2e420c1fcf1b646ae114f28a666c87ff6c5dbb3a0675ba28a0828615c07757","observation_id":"a5ecb7bb-461d-431c-8d58-fc5ab0f38c3d","resolution":{"observed_at":"2026-08-12T12:56:41.471938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.16667","last_updated":"2025-04-15T01:51:24Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-12T12:48:04.395763Z","submitted_at":"2024-11-25T18:53:49Z","title":"OPMOS: Ordered Parallel Algorithm for Multi-Objective Shortest-Paths"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":6,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":27,"verified_exact":5,"verified_fuzzy":3},"total_outbound_references":44},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2411.16667."}