{"as_of":"2026-08-16T00:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff227176ec5a3b4b77a8f66d460853178089cacd898d5c12a0a8a623d7335588","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:26:24.566200Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/1909.01597/citation-record","integrity":"/paper/1909.01597/integrity","json":"/paper/1909.01597/citation-record.json","paper":"/paper/1909.01597"},"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-14T05:26:25.182624Z","title":"Abboud, K","venue":null,"work_id":"819c1b68-647e-46a1-be0d-40b4c5614490","year":2016},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.391163Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:21d9ee7c70b0e9d201a5964da2093ecb55b9fe498fb40ead622ad478465f24c8","observation_id":"a8dd76fe-8517-40c4-b47a-66b4498ec949","resolution":{"observed_at":"2026-08-14T05:26:25.187302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.167325Z","title":"Agarwal, V","venue":null,"work_id":"9d0a4ea1-0274-4b62-9b55-079a3c6990cd","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.397406Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:fb971f224c449ca14395492bf403580c3b10a845cdf87d1928a9ed6aa94456e8","observation_id":"4a081c11-e7f7-400c-b7f6-af8711b42940","resolution":{"observed_at":"2026-08-14T05:26:25.172288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.152804Z","title":null,"venue":null,"work_id":"da7101e9-48ad-455c-96a3-5b42509e8967","year":2017},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.402434Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:d5846d3dc29c39a2dbfa21b127374e3ad860feeba0aaa6fcdd8143ba2cae827f","observation_id":"bfbd2fc3-b9df-4f35-abfe-346fc7368910","resolution":{"observed_at":"2026-08-14T05:26:25.157378Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.138124Z","title":"Augustine, M","venue":null,"work_id":"643ca48e-c856-46d4-9c5f-249ac5e74f4b","year":2019},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.406923Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:636e488a1b5e4d1de733b3427cadd28bf56c18cf0a31d7b16121eb6afc759bf3","observation_id":"603c52b3-ccf8-4a5c-abd4-bd380b2d75b3","resolution":{"observed_at":"2026-08-14T05:26:25.142905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.122269Z","title":"Baswana and S","venue":null,"work_id":"ba15d788-ad76-4339-a405-56d42bfa3587","year":2007},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.411840Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:7690814771c5ba46f408d6a57f78fd7ab747445726ca3f07a2db5c6e7db01b9c","observation_id":"2f603ffc-7f39-41c5-a2b4-89eb2812cfec","resolution":{"observed_at":"2026-08-14T05:26:25.127705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.107753Z","title":"Becker, A","venue":null,"work_id":"927b6a42-dc4d-4413-a91e-8600b5771a38","year":2017},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.416539Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:a17f1328b89babf976c0cd9560d7f7acb48fabe5d720d4b5a0868ff4d114cedd","observation_id":"f40471d2-54e7-4d63-bb0d-b71fd935f8ad","resolution":{"observed_at":"2026-08-14T05:26:25.112492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.093277Z","title":"Becker, A","venue":null,"work_id":"f960d776-716e-4de2-8210-44955be7a067","year":2017},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.421908Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:7233265f0b0faeae5e38bdba585edc58558ceb2328e6169e3b1074608a9e854b","observation_id":"e7f9f7ed-eb4c-4841-82b3-fbfb932a1a92","resolution":{"observed_at":"2026-08-14T05:26:25.097872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.077705Z","title":"Bernstein and D","venue":null,"work_id":"d971c143-9256-46ad-9584-38d1f91323b3","year":2019},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.426921Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:51a00531a7e01cb9263a60c6a8fd52834308fa9aedc8ce21fc4121b32bd7e7ee","observation_id":"8cfb69d1-63be-4b99-89e7-71122a69512a","resolution":{"observed_at":"2026-08-14T05:26:25.082987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.063575Z","title":null,"venue":null,"work_id":"4ee50f02-7b1e-4cf9-9ec4-242c99848d62","year":2014},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.431639Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:c9af7d29878b126fbafddee6a64fdd14c3d81fdae96ce15528c50e95bfa750bf","observation_id":"3ce3a58b-9431-4687-8422-2f48bf5fca9a","resolution":{"observed_at":"2026-08-14T05:26:25.068372Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.05956","last_updated":"2019-10-31T16:18:59Z","snapshot_observed_at":"2026-08-14T17:02:21.508481Z","submitted_at":"2019-03-14T12:54:11Z","title":"Fast Approximate Shortest Paths in the Congested Clique","version":2},"cited_work":{"arxiv_id":"1903.05956","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.05956","snapshot_observed_at":"2026-08-14T05:26:24.602524Z","title":"Fast Approximate Shortest Paths in the Congested Clique","venue":"cs.DC","work_id":"f6f5b262-1f9b-4fd0-8db0-68d2b880b4f7","year":2019},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.436121Z"},"links":{"cited_paper":"/paper/1903.05956","citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:1b9f61e3e31f3a7933b86967e7b96d63832ccd8e5d6654e408443a6ef17e3a55","observation_id":"15b4fdc9-8366-411c-9283-52cdde0b44a0","resolution":{"observed_at":"2026-08-14T05:26:24.609677Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.049211Z","title":"Censor-Hillel, P","venue":null,"work_id":"5d6eb804-8ace-41cb-94f4-b63f6c1a2665","year":2015},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.441429Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:667fd56a02e4e0ca436b6ff1fdf52ddee23f329e2ab9eb7c3834eec4ea94b95c","observation_id":"f8312c37-5f92-46bd-923c-4239c8675260","resolution":{"observed_at":"2026-08-14T05:26:25.054071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.035205Z","title":"Drucker, F","venue":null,"work_id":"180c2c88-44c8-495d-ac68-56817e0ff81c","year":2014},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.445841Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:67195095b516042d7a6c09ae87d895a0ec87c093386d32d04d47de942471ef42","observation_id":"e4cc37c8-5ff4-4ad7-9af7-68fd2984ef7b","resolution":{"observed_at":"2026-08-14T05:26:25.039770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.020798Z","title":null,"venue":null,"work_id":"af7452eb-29c6-4313-b0bd-71c1ee32f064","year":2017},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.450602Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:2405cd7f04d687720484773001c0c3d779c2cf535474e2a97201d29defa34cc1","observation_id":"28b26247-29d1-49e1-a2c3-28443207c42c","resolution":{"observed_at":"2026-08-14T05:26:25.025572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:25.005949Z","title":"Farrington, G","venue":null,"work_id":"ba9fd72a-ffbd-4da8-90ef-f3a4bdc9f11f","year":2010},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.454808Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:423d79fd9dfee8a58ad7d7d0ab9c505de309486da7f48df6292d9e191313a033","observation_id":"67c2f655-5d96-4ce3-8f7b-6a231e312b3b","resolution":{"observed_at":"2026-08-14T05:26:25.010686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.990903Z","title":"Foerster, M","venue":null,"work_id":"e131fcae-b969-4b49-83b8-8ebb36e03476","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.459088Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:6d2b84078a97faf95022ec6f68c9906feaf617a1b563cb98fabdc727a8752460","observation_id":"5b737334-3fdc-4424-bd25-2733d578c9d4","resolution":{"observed_at":"2026-08-14T05:26:24.995752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.975930Z","title":"Forster and D","venue":null,"work_id":"6573c3d5-fd75-411a-ae07-6771ce98bd72","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.463503Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:3ddc47eb023d6b748dbf8b86b7abba7a8aaab85f0d53c8cd94b596e7aaa7d501","observation_id":"df235c82-0fad-4ed3-9b88-26d8fa5d5ef9","resolution":{"observed_at":"2026-08-14T05:26:24.980734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.961090Z","title":"Frischknecht, S","venue":null,"work_id":"e5893203-d9c7-4bb2-8956-a1a8112e5142","year":2012},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.467860Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:62c3b7144370c5d753cb472de397115d5223e24b1bdadc8c19a5e26aa456a57c","observation_id":"e2170758-b486-42d6-af4e-9c4c9d647771","resolution":{"observed_at":"2026-08-14T05:26:24.965402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.946674Z","title":"Ghaffari","venue":null,"work_id":"ba119ac5-6e3b-4566-9be6-8093b4e98c28","year":2015},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.472338Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:aceae42f89129c5c5b72f5392fb4754b0626e8b2c2bc203295e3949cfc42ace5","observation_id":"396ba0ed-8d0e-4338-b7f1-ddddc5ed390a","resolution":{"observed_at":"2026-08-14T05:26:24.951292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.932625Z","title":"Ghaffari and J","venue":null,"work_id":"dea0c3b2-a1a0-45c6-a3b7-e102ebb156eb","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.476780Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:8f4e5af6f21df230df1f65f523e97aeff2f871f7970c23111d81438b5c6c43a8","observation_id":"aa4ec236-5e6c-4d28-9edb-2bd53a47047c","resolution":{"observed_at":"2026-08-14T05:26:24.937198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.918154Z","title":null,"venue":null,"work_id":"3148faa2-0d0e-40a4-817e-180f8dc3b7f9","year":2017},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.481085Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:bf80d9de947fcb8b459c82a892dafc5a02d54c30abd0ab5c2680e41e1d263a37","observation_id":"10cf494f-cf06-49ca-8336-b0e69d1fea58","resolution":{"observed_at":"2026-08-14T05:26:24.922848Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.902048Z","title":"Halperin, S","venue":null,"work_id":"b7b8ef4e-f4dc-4791-b7dc-a899e2338eee","year":2011},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.485704Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:15fc816ae5dbd3d80332b4972c2ffb9408f42f236382bec0100d1bc4d24ee2af","observation_id":"9036fc25-9389-4da1-8dfd-ec9e96e7619c","resolution":{"observed_at":"2026-08-14T05:26:24.907021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.886751Z","title":"Henzinger, S","venue":null,"work_id":"788fe90c-7995-4085-bb3c-fade4b7f1f6e","year":2016},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.490225Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:b9237e24d095d0f3b99d2660af7375fd73d6c6f4aebc6fe97ec09d97af71d752","observation_id":"553a40b9-5b03-44de-888c-0b42b6240bd6","resolution":{"observed_at":"2026-08-14T05:26:24.891199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.872425Z","title":"Holzer and R","venue":null,"work_id":"99d2cd9d-eb31-49ff-afff-e50868d86cb4","year":2012},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.494520Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:798cdb818324e38f3afbc4b4b13bf74e37fabe1c04aa312c29c21b47f793e842","observation_id":"864d9488-0d48-4f23-b5c8-2180ce0fae45","resolution":{"observed_at":"2026-08-14T05:26:24.877117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.856812Z","title":"Huang, D","venue":null,"work_id":"ba46f1bd-bd34-43d6-9c7c-ebcc9148276c","year":2017},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.499075Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:5a93472c7138589b0895f9c04955645ca0c1ff3dc65a4195dd86222e83ecad7e","observation_id":"209c99c8-c9b5-4b79-831e-a2cde44065cc","resolution":{"observed_at":"2026-08-14T05:26:24.861882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.841694Z","title":null,"venue":null,"work_id":"e14f95de-82ef-4b79-815c-e4185fbcdc75","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.503727Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:395854a309ef6f370f785a1c3160a7c4f4fab893b5888e0d280847b5c7a0240e","observation_id":"1ebc30c0-b73f-4448-bdda-1011c95e13ff","resolution":{"observed_at":"2026-08-14T05:26:24.846611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.826835Z","title":"Jurdzinski and K","venue":null,"work_id":"a11a5f7f-0cab-4379-9763-f2d3ba156b6f","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.508166Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:347d23202ce6dd2b14985a607603dd030bc4225a77a2d788e047058d6c9f0410","observation_id":"898fffc4-d996-45a0-9a34-6a720a24adcc","resolution":{"observed_at":"2026-08-14T05:26:24.831725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.811677Z","title":null,"venue":null,"work_id":"458c8234-9d2c-4543-88dc-aba458fd014a","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.512564Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:f425ac513e51ed4f9eee646202a6a86e8a68021663c2841bd423c00ab329530c","observation_id":"bc9e420c-5148-49cd-8b6a-70dd2b0b1bee","resolution":{"observed_at":"2026-08-14T05:26:24.816377Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.796579Z","title":null,"venue":null,"work_id":"ad6fc259-904d-4f96-9827-bec2bf067ad6","year":2013},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.516973Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:84f6be2a7d9d391fbf4bd044d12267f9e238f4e0fbf29eec9d28cd9c4b4b9cea","observation_id":"a43d59cb-45f0-4c6b-a525-dea8dd67f0bb","resolution":{"observed_at":"2026-08-14T05:26:24.801128Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.780703Z","title":"Lenzen and B","venue":null,"work_id":"ffd98492-bd70-43f4-b428-eae7c6d282b0","year":2013},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.521637Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:bec5a8ed6b362775c9e629a5bb1e8e24f66feb4856d11c65b99599e113ce806d","observation_id":"cdefc2cd-3daf-4169-b322-6c78b7533bb0","resolution":{"observed_at":"2026-08-14T05:26:24.785313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.765563Z","title":"Lenzen and B","venue":null,"work_id":"985e1367-3533-4e88-acf5-356a9f4efced","year":2015},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.526115Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:a538f53fd4670b7de35d082844e0e4548d80e81452202f79295f7b162242d96f","observation_id":"9cce976a-27b8-4ec4-aab8-4cc5dffdd053","resolution":{"observed_at":"2026-08-14T05:26:24.770376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.750082Z","title":"Lenzen and D","venue":null,"work_id":"b195a414-d018-46a3-8f9d-71b237183acd","year":2013},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.530616Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:ecae8ffbb31229a580bfb975d59ad59c08a3213524d914c7709eab8dab44a374","observation_id":"e128be71-d8dd-4abc-bf4e-3f309b372141","resolution":{"observed_at":"2026-08-14T05:26:24.754843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.735076Z","title":"Lotker, B","venue":null,"work_id":"fee6b95b-403a-44d4-9f01-da5f00a4bf2f","year":2005},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.534814Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:c5b95e67acc64b74be19f7067db31dc8c77aafaf76b765abdee6ba31a095a377","observation_id":"be4ee726-8cf5-4d35-bc89-6aaea54c83b1","resolution":{"observed_at":"2026-08-14T05:26:24.739703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.718941Z","title":"Nanongkai","venue":null,"work_id":"abcf49cc-7aa6-4c2c-b13a-bd6154820543","year":2014},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.539119Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:344b557409de47fb29bfce6623e5ff32ccf878d97cf103ab8a5d60059413e22d","observation_id":"fcc0a788-9dc4-48da-b03d-5d51b88db52b","resolution":{"observed_at":"2026-08-14T05:26:24.724197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.702032Z","title":"Peleg, L","venue":null,"work_id":"9d1c1694-1790-44f9-bdce-48a889bbe8fe","year":2012},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.543460Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:3b5633b70d4b5c9bf0e0e2a1c807289cacf7ed91b522e977455c7a25bcfd975a","observation_id":"5d6f7ddd-b791-4d95-ad44-1a4e5d991f7c","resolution":{"observed_at":"2026-08-14T05:26:24.707872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.683590Z","title":"Rossberg and G","venue":null,"work_id":"5780b365-8ba8-48f1-9caf-a9106beff2e4","year":2011},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.547840Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:204238fc5cc7a7003016b87a630c748b6a4d47910b6863232dcae552e2347e9d","observation_id":"d8c42f57-02df-48fb-85c3-7800734c7e83","resolution":{"observed_at":"2026-08-14T05:26:24.689040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.668435Z","title":null,"venue":null,"work_id":"c73ca141-f015-4ebe-a4dd-14eeedaa7b4c","year":2012},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.552283Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:13ec2c0bf9b837dabb0579dec4995ff54c4aad958381a93493410c2670b4c5dc","observation_id":"cabd5faf-396d-44f9-9211-a9f076596761","resolution":{"observed_at":"2026-08-14T05:26:24.673024Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.653389Z","title":null,"venue":null,"work_id":"118c751b-b593-4d16-b75a-d565fab1dd2b","year":1995},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.557004Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:6078507fbb8aaf7fe104d4c173506b1b14a2fb0bc03695eeceb841d9b07fa558","observation_id":"b467125c-8d35-413a-94e2-25cf711cae25","resolution":{"observed_at":"2026-08-14T05:26:24.658123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.636611Z","title":null,"venue":null,"work_id":"7f53fb15-0271-4584-9eda-bc6b0f170602","year":2018},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.561684Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:b832a0f6fc86bc70639effdb9f251d1b11e0f9d6495efdedbc2526a97bde1049","observation_id":"ef02ca5a-3597-40e1-bfd0-d8b72f11fc90","resolution":{"observed_at":"2026-08-14T05:26:24.641625Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T05:26:24.620623Z","title":null,"venue":null,"work_id":"8b029f90-6f93-4cd6-8aff-68201a301beb","year":1991},"citing_paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T05:26:24.566200Z"},"links":{"citing_paper":"/paper/1909.01597"},"observation_digest":"sha256:6d6a99f6b4a185e07c342fc53f07b0aff179eb6793b874807ad16d31f9b05718","observation_id":"f217c08b-f411-4f59-876a-d08eff276a10","resolution":{"observed_at":"2026-08-14T05:26:24.625656Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.01597","last_updated":"2019-09-04T07:50:40Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-14T05:10:38.446393Z","submitted_at":"2019-09-04T07:50:40Z","title":"Shortest Paths in a Hybrid Network Model"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":39},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:1909.01597."}