{"as_of":"2026-08-13T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:970e439155b058dfb409bb82c5773e3efe648ead018d4f6d51123a89d6a769c9","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:21:24.883785Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2412.17665/citation-record","integrity":"/paper/2412.17665/integrity","json":"/paper/2412.17665/citation-record.json","paper":"/paper/2412.17665"},"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-11T05:21:25.497417Z","title":"The linear fit holds up only up to ∼ 3 km for low traffic, while linearity is regained deep into the congested regime","venue":null,"work_id":"e9406891-e7df-4522-856a-fac3b178bf5e","year":null},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.734599Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:ddba1a74c2c4f6e3f6a158b887f61ceae2c50527fa6c50ae4265e40c612b44d4","observation_id":"3e578499-31f5-4e2b-abef-b39e6206683e","resolution":{"observed_at":"2026-08-11T05:21:25.504726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.475019Z","title":"sub-transition","venue":null,"work_id":"87dae9af-b3d0-45d5-8b0c-f2a138ee4156","year":null},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.740764Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:1372dbaa2ed1bc2da92056272559759701120666f6e6eed0791fe2fd677130f4","observation_id":"2c083021-e8d1-4943-959a-e97a8195cba0","resolution":{"observed_at":"2026-08-11T05:21:25.481138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.449124Z","title":"Traffic and related self-driven many- particle systems","venue":null,"work_id":"c95cf118-d8d3-4f5a-bb98-e24fca13cd4f","year":2001},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.747159Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:756453fe82ef2fcb666d090bf0fb36339ef4629afcfdb97d7344856c264047ea","observation_id":"f37c01a6-5a2d-4223-aa7a-9d5300d233ad","resolution":{"observed_at":"2026-08-11T05:21:25.457684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.430338Z","title":"Eugene Stanley, and Shlomo Havlin","venue":null,"work_id":"a8bc4b3e-4016-4858-8452-2377df38c13d","year":2019},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.753418Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:09194897642a6e011dfed7be2909211af4b0cc5246dc790f06d6a8543fbaa389","observation_id":"6a79e89e-071f-420e-b000-369936d6eb6c","resolution":{"observed_at":"2026-08-11T05:21:25.436040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.402195Z","title":"Complex-network-based traffic network analy- sis and dynamics: A comprehensive review","venue":null,"work_id":"e2755337-3825-415d-a03d-9997b8f4d2c9","year":2022},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.759653Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:e47aeb98ba9fa0337634f1e132b9a2ef0936e6206fc0adfcab63baa1699a3f8e","observation_id":"4079fd63-a6c5-49c1-8beb-5a18af0cd9db","resolution":{"observed_at":"2026-08-11T05:21:25.413663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.379626Z","title":"Impact of random failures and attacks on Poisson and power-law random networks","venue":null,"work_id":"d5a3243c-3535-4268-8d17-326293af8017","year":2011},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.765077Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:b8ef02bf9d6e5a0ee92cf41aab22d819f21774e6e1264fa6d2f99edefc2baa9b","observation_id":"e82fa06f-11d1-45d8-a375-cabf249b5897","resolution":{"observed_at":"2026-08-11T05:21:25.388729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.358882Z","title":"Graph metrics for network robustness—a survey","venue":null,"work_id":"3d61f650-d9c0-49f6-9f62-3e497ae70f1c","year":2021},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.770514Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:1aec17c616ef9fbd3bec6729f4740b285c00d1fc6281b64905a083fdd71e6ff9","observation_id":"ff8fb2b0-af66-41d0-8ba1-325314fe1fa4","resolution":{"observed_at":"2026-08-11T05:21:25.364729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.07498","last_updated":"2024-09-10T06:20:40Z","snapshot_observed_at":"2026-08-12T22:48:01.882375Z","submitted_at":"2024-09-10T06:20:40Z","title":"Structural Robustness and Vulnerability of Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.07498","snapshot_observed_at":"2026-08-11T05:21:24.775830Z","title":"Structural robustness and vulnerability of networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.775830Z"},"links":{"cited_paper":"/paper/2409.07498","citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:8ab080da2dc461ddaa47dfe08f466dd6642d3d4a0399bde2f4c8e5febf32fc88","observation_id":"27e26db6-7f8b-4e28-ab7d-dec86b0f62ac","resolution":{"observed_at":"2026-08-11T05:21:24.775830Z","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-11T05:21:25.332205Z","title":"Eugene Stanley, and Shlomo Havlin","venue":null,"work_id":"33bc6082-c138-4faa-aecf-743bef598c9b","year":2020},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.782769Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:509ee41ebde189d173bf206b2beccb9b3c714dab4202e4d2bb0ecd3ae9ddad1d","observation_id":"bc3e9849-7b49-4454-a168-4cca3acf7972","resolution":{"observed_at":"2026-08-11T05:21:25.338896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.314031Z","title":"Stability of traffic breakup patterns in urban networks","venue":null,"work_id":"3623141c-41f5-4695-82f1-52394c5cee79","year":2021},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.789254Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:6b7b257f703287fd6b6b0260e22fac809249e66883ab2a38bef8f5fe01f8f673","observation_id":"dfdbeb27-5442-4cca-8804-55ee0cdbca83","resolution":{"observed_at":"2026-08-11T05:21:25.319831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.285016Z","title":"Predicting net- work congestion by extending betweenness centrality to interacting agents","venue":null,"work_id":"e3655a99-cae3-4e94-9663-403c17768b49","year":2024},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.793949Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:6c371bda69573a7978385a45a9d3cefbf5bbc67441acbb433a8fe76249e41de4","observation_id":"accbbd98-c810-4b8d-8356-f8515cd981fb","resolution":{"observed_at":"2026-08-11T05:21:25.291905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.260911Z","title":"Unveiling the inter-relations be- tween the urban streets network and its dynamic traf- fic flows: Planning implication","venue":null,"work_id":"e88b1ade-a596-42bd-9019-1c69268e112f","year":2019},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.799135Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:314c9bff4d23a39b9e94a5db26d9c5adb5835c4ade5bec31f9725ac65d164916","observation_id":"6425bc75-ded6-44e6-9f8a-6f980e86812c","resolution":{"observed_at":"2026-08-11T05:21:25.269392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.242411Z","title":"Congestion and centrality in traffic flow on complex networks","venue":null,"work_id":"f3f48132-7e2a-435f-add0-d9990ca56728","year":2003},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.805268Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:fa67487e9615d808adf793a9b11d271245a6b027665e6e91ae817e7a804fffff","observation_id":"6744185a-d944-4b53-9241-99aa44a26ce1","resolution":{"observed_at":"2026-08-11T05:21:25.250092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.223966Z","title":"The worldwide air transportation net- work: Anomalous centrality, community structure, and cities’ global roles","venue":null,"work_id":"ec8d706e-ee87-4103-bcc2-216f7eac47ab","year":2005},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.810386Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:c6700aba7dfd93a9bc306e1990f63136fd95cc6d61a021bb0dfa89a19226ff20","observation_id":"9dbf04fc-1f87-424c-ae7a-9c755e288e0f","resolution":{"observed_at":"2026-08-11T05:21:25.230276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.206317Z","title":"Can betweenness centrality explain traffic flow","venue":null,"work_id":"3432e8db-260c-4dff-807a-163387813f35","year":2009},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.814646Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:2f78e54dd600ffca12ba975792fbfd7905f410c64383f873f1a2af7811db6ad3","observation_id":"03ae91f3-b062-4d99-8228-e01aaa46fc26","resolution":{"observed_at":"2026-08-11T05:21:25.211546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.189046Z","title":"Competition for short- est paths on sparse graphs","venue":null,"work_id":"f3dc9b76-990a-40ce-80f1-85a36db3867e","year":2012},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.819482Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:cef346c6d88f9e2c48eef541357a31b9d1194fa038fe39a807a6b735e1ccbc92","observation_id":"7bf3b3e7-c226-45eb-a3b7-5306c0d5dd49","resolution":{"observed_at":"2026-08-11T05:21:25.195054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.166315Z","title":"Vu, and Lewi Stone","venue":null,"work_id":"aaa32426-210e-4898-b060-acac5895d291","year":2021},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.824958Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:1518e5a85e38f0dd1d69d68db7e0a86acc49299eab92c93041181088e4fccd9a","observation_id":"0c6773da-6b41-41c5-b042-b003cd8dbf9a","resolution":{"observed_at":"2026-08-11T05:21:25.172110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.144522Z","title":"Olmos, Serdar C ¸ olak, Sajjad Shafiei, Meead Saberi, and Marta C","venue":null,"work_id":"90fa8e3d-8878-44f0-b6d1-e66c617c95ff","year":2018},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.830320Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:b217d192ae8dd2fa95f2d30a9df302d0bd5675660b013fc720f200fa50a176d5","observation_id":"48d5e7f8-9e75-4ad1-8842-245aceb4d7d0","resolution":{"observed_at":"2026-08-11T05:21:25.151912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.118797Z","title":"Gonz´ alez","venue":null,"work_id":"59642c86-25e6-459d-961f-07c966ed778c","year":2016},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.836519Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:ed67bcf20da5da58ee5f56bf30131bb0e591e107577f0bf0d257902159454397","observation_id":"a6af0d9b-7c4a-4129-b103-7aa6c1e92619","resolution":{"observed_at":"2026-08-11T05:21:25.126581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.101589Z","title":"Towards a clas- sification of planar maps","venue":null,"work_id":"6ace96a3-5923-4e4c-b138-8bed59ecdb77","year":2018},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.841533Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:ebeed29f3ef36fa1d14a0db6d8f93a8a86fb7569aa468253e2204a8c2d2b4ea8","observation_id":"09c152a5-0cb9-4327-b3ad-22959234dd43","resolution":{"observed_at":"2026-08-11T05:21:25.106883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.084350Z","title":"True scale-invariant random spatial networks","venue":null,"work_id":"6ac99989-30e4-4769-9c38-64af19dc7a2c","year":2013},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.847694Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:65afe8935b4338e0a6dc53c6bdafd11fef2b28f47e9e1a7d071964b841869101","observation_id":"cbb09815-dc5c-4c49-b2c4-e7e5a50f6ccd","resolution":{"observed_at":"2026-08-11T05:21:25.090045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.060813Z","title":"Eugene Stanley, and Shlomo Havlin","venue":null,"work_id":"28c17457-6c26-4049-9543-e208488d91e4","year":2015},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.852784Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:87c65927d8003946d34c7d25f719f669aa1d46892e1743486764e3caf267d5b5","observation_id":"114b2a5c-5b36-4757-aa35-8f0bdba3aa07","resolution":{"observed_at":"2026-08-11T05:21:25.067407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.041409Z","title":"From the betweenness centrality in street networks to structural invariants in random planar graphs","venue":null,"work_id":"350c368a-b878-470f-a8ac-f956666146fa","year":2018},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.857862Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:9fd6a359879dd1a1b65584a1235708c64e0bf60dbf2b5f8eb2b40459ae69b8c3","observation_id":"ce3bdfcb-e54e-447d-a5a0-aed27834f320","resolution":{"observed_at":"2026-08-11T05:21:25.047693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:25.018261Z","title":"Morphology of travel routes and the organization of cities","venue":null,"work_id":"e4437f58-ed87-4a90-93e0-8cbce7fb733e","year":2017},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.862688Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:eed95ea48dc68c4532673b8589b26a95c6c49705fe57e6ce6c73affb2a4de186","observation_id":"c0741f57-8462-465a-8b59-cf1b642d5e2c","resolution":{"observed_at":"2026-08-11T05:21:25.026069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:24.996993Z","title":"Comparison of greenshields, pipes, and van aerde car-following and traffic stream models","venue":null,"work_id":"050d0171-2c90-4ab3-849f-6dfd01020be1","year":2002},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.868828Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:2fde4d4723ff66cd93f87f5f1d05f148f18c80fd13be9464c404f3968f678fcd","observation_id":"23b3ad78-3fa6-4921-b19f-3d640461763a","resolution":{"observed_at":"2026-08-11T05:21:25.005523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:24.978284Z","title":"Detecting the urban traffic network struc- ture dynamics through the growth and analysis of multi- layer networks","venue":null,"work_id":"72872837-1a13-4380-8658-2bfe3d855324","year":2018},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.873553Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:8cb0593f569bc19be88602e57a1b1dc801f57da4b77b7b30c9fcfec4f109fc22","observation_id":"dabfefbf-11ee-4127-b787-8117ebef07b6","resolution":{"observed_at":"2026-08-11T05:21:24.984119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:24.958547Z","title":"Shape of shortest paths in random spatial networks","venue":null,"work_id":"b0896bed-2875-46a1-b459-04e98f4a648a","year":2019},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.878660Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:83fe7e7296d4d4f391ebb09890dc64f0e63313608bdb02ffd8e7e398176abc55","observation_id":"ee31ffb6-449a-4ecf-8e8e-93dbbe50246c","resolution":{"observed_at":"2026-08-11T05:21:24.964847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-11T05:21:24.937863Z","title":"Ultrametricity of optimal transport substates for multiple interacting paths over a square lattice net- work","venue":null,"work_id":"a8e65a49-834c-4778-b273-dabaeaac9022","year":2017},"citing_paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T05:21:24.883785Z"},"links":{"citing_paper":"/paper/2412.17665"},"observation_digest":"sha256:8c46946e4581c54de7a38f477fe386b72790bd9d6ffc652ec2f03e653d5cad46","observation_id":"7490d453-4aa5-406a-9d1e-d3b1a32db67e","resolution":{"observed_at":"2026-08-11T05:21:24.945947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.17665","last_updated":"2025-03-04T10:08:44Z","latest_version":2,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-13T05:57:17.615846Z","submitted_at":"2024-12-23T15:51:49Z","title":"Shape and Performance of Fastest Paths over Networks with Interacting Selfish Agents"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":28},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2412.17665."}