{"as_of":"2026-08-14T03:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bbafe3413b548f4a4f9905b9712ae57b53fa8a798f1be2c724c6fab7e2781665","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:30:53.614197Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:59:20.159317Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-11T04:59:20.339036Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"cited_work":{"arxiv_id":"2508.07145","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.07145","snapshot_observed_at":"2026-08-11T04:59:20.339036Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","venue":"cs.GT","work_id":"8fcb594c-3b92-4a82-9686-cdba299695ae","year":2025},"citing_paper":{"arxiv_id":"2608.09894","last_updated":"2026-08-10T17:42:40Z","snapshot_observed_at":"2026-08-13T23:49:18.134834Z","submitted_at":"2026-08-10T17:42:40Z","title":"Competitive mediator games and urban CAV routing markets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T04:59:20.159317Z"},"links":{"cited_paper":"/paper/2508.07145","citing_paper":"/paper/2608.09894"},"observation_digest":"sha256:c79c389ed919380988ed62bf6480e1bb46f427d12bbf757a77f615ae9c9fead7","observation_id":"eb922177-dc08-488a-8311-037a81660e1e","resolution":{"observed_at":"2026-08-11T04:59:20.342421Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.07145/citation-record","integrity":"/paper/2508.07145/integrity","json":"/paper/2508.07145/citation-record.json","paper":"/paper/2508.07145"},"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-05T22:30:54.140485Z","title":"Implementing mediators with asynchronous cheap talk","venue":null,"work_id":"2f3093ea-7efe-4b8a-9532-ff4046261d3c","year":2019},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.478018Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:3d3eea6048f686184c5b93113cd54876bae7ca721cd6df4bb143e72ccb1a707b","observation_id":"dcd49517-0b6b-40bc-9b5e-4f5f387e201e","resolution":{"observed_at":"2026-08-05T22:30:54.145773Z","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-05T22:30:54.124344Z","title":"Mediated cheap talk design","venue":null,"work_id":"0a409999-c475-4fd6-b4e1-f2c2b46348b3","year":2023},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.484322Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:ebb0b850d22941b8e7c33ee7b793649ddfa3994784e524ca19112b9c945ef0b6","observation_id":"d017306e-922f-4a2a-9886-a1293a3fe590","resolution":{"observed_at":"2026-08-05T22:30:54.129170Z","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-05T22:30:54.108519Z","title":"Resilient information aggregation","venue":null,"work_id":"f41d1ba2-2456-4836-af81-6fef9065083c","year":2023},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.490440Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:2f1711baf0b1fb84fd527bdec04a646bde0ad482c93b56bc4df54a68c39a7abd","observation_id":"d1fd715a-0d08-4eee-9942-21749d795fc6","resolution":{"observed_at":"2026-08-05T22:30:54.113537Z","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-05T22:30:54.086722Z","title":"Simultaneous ad auctions","venue":null,"work_id":"46535f88-90f8-4dd9-8cda-3e5773dfcbbb","year":2011},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.496597Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:cef75f626f70341452fd61f0306093c8027f815aebdb877cb38abc6a7dc1f790","observation_id":"7438e57d-f93c-47a3-a4c4-642d770a84c4","resolution":{"observed_at":"2026-08-05T22:30:54.092976Z","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-05T22:30:54.068861Z","title":"Mechanism design with strategic mediators","venue":null,"work_id":"2a3f9658-e46a-4486-9a58-3045c0e5016f","year":2016},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.501790Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:c8f64a62d250d11e4dbed1683b104397d315a7206847c9faa072e003f321853d","observation_id":"0b362e6a-334c-4e7b-9783-74a60abec4e7","resolution":{"observed_at":"2026-08-05T22:30:54.074561Z","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-05T22:30:54.050898Z","title":"Cheap talk in games with incomplete information","venue":null,"work_id":"d9422a46-d13b-4bdb-8d99-1225b70033c6","year":2003},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.507640Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:f7bd1614ed9c9842ac589f4c29348df76800584fb16728a94b56f1507a5dc668","observation_id":"89a8bec2-acce-4db5-ae5f-7c887273e2c3","resolution":{"observed_at":"2026-08-05T22:30:54.057043Z","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-05T22:30:54.033888Z","title":"Computing optimal equilibria in repeated games with restarts","venue":null,"work_id":"b92e5419-84b4-4c45-a3ce-5b62dbac38ce","year":2024},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.514153Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:cf33ef965da43760e00d49501d0b07fdb0fd5e92df962a3f13adf5a5b1ebb495","observation_id":"c022a539-9d63-41ef-841f-4aa3c40805d7","resolution":{"observed_at":"2026-08-05T22:30:54.039394Z","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-05T22:30:54.015450Z","title":"The myth of the folk theorem","venue":null,"work_id":"2d5af8fd-9240-4c94-aa33-a94df4f14351","year":2008},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.520776Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:48a28c5c83063ea9106084b4e0651f3adc505075271e8e9cad7e86c9417bb8fe","observation_id":"31741ed8-abff-42ad-8e12-b7b5388ad08d","resolution":{"observed_at":"2026-08-05T22:30:54.021340Z","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-05T22:30:53.995301Z","title":"Mediated communication with transparent motives","venue":null,"work_id":"fc759baa-539b-4c65-86aa-5660b1034f68","year":2023},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.525498Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:e154dbe331304bcd9dfc5d72075169872e8597a7416690360b12cdf321224c86","observation_id":"072593ff-1819-4591-bb27-01b1478583ad","resolution":{"observed_at":"2026-08-05T22:30:54.001728Z","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-05T22:30:53.974886Z","title":"Muthukrishnan, and Mallesh M","venue":null,"work_id":"9c6f488c-91a0-4714-9a22-197fac57d0fd","year":2010},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.531157Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:63fe90bdd914f184f78ad23f9d71dc9f29685d984f7f03f8ac0ba5e33fb1c3ce","observation_id":"9d589534-69d1-4df6-ad63-90aea0697aa4","resolution":{"observed_at":"2026-08-05T22:30:53.982266Z","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-05T22:30:53.954326Z","title":"Partition equilibrium","venue":null,"work_id":"3fefc0cf-f23e-403a-b370-d8503c13bca1","year":2009},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.537030Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:f6cd31ce43a9e4a4abeecf2dffdaa564bab40dbf1b082f9bbf73eceae074c50d","observation_id":"0f7f9b32-0d62-489e-8153-2b8fc1a1daf8","resolution":{"observed_at":"2026-08-05T22:30:53.961266Z","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-05T22:30:53.936028Z","title":"Communication games, sequential equilibrium, and medi- ators","venue":null,"work_id":"4e13022f-70c3-443a-be83-830839628a84","year":2024},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.541871Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:8670a85ff84c8cda747974f69de2e760c455d5097563de6f54405b8b1d0dfb53","observation_id":"78a80ddb-4b52-40bb-9f25-ad26431eb7bc","resolution":{"observed_at":"2026-08-05T22:30:53.941594Z","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-05T22:30:53.915683Z","title":"Making a nash equilibrium resilient to coalitions","venue":null,"work_id":"1a8c0928-695d-465b-9176-3ba6779ea939","year":2024},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.547238Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:0eed6c203c0e26939c56d9be21510b4d2acc1337a850957aca481e5109086f98","observation_id":"5f9d5eaf-e758-47bb-a850-97805cece550","resolution":{"observed_at":"2026-08-05T22:30:53.921647Z","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-05T22:30:53.895358Z","title":"Unmediated communication in games with complete and incomplete information","venue":null,"work_id":"90664dbe-2e20-4499-aa2f-b966a52df462","year":2004},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.553351Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:d50b1eeca2af15e817bad8b8555c315a928bf36dbf17eb215c60544f63baec70","observation_id":"f5aa3860-5edc-49d8-acce-9cc328c3bb52","resolution":{"observed_at":"2026-08-05T22:30:53.901869Z","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-05T22:30:53.870693Z","title":"Network structure and strong equilibrium in route selection games","venue":null,"work_id":"8940deb7-de7a-4b90-8d32-9b2978c00167","year":2003},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.558934Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:5a03a9e63b7c2801091abee214473843bc41a211ded9deecaebb452eef7bfb29","observation_id":"6e7f408d-7561-47d7-abec-2c4ac02c1bdb","resolution":{"observed_at":"2026-08-05T22:30:53.877867Z","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-05T22:30:53.850589Z","title":"Strong equilibrium in network congestion games: increasing versus decreasing costs","venue":null,"work_id":"9f326372-4f76-416a-bee8-91afa75045b5","year":2015},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.564849Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:cb8bfc78760e8a5e512609ca1eacd79a3ad3bd963e152df109fb6733eee1bed3","observation_id":"beaa93cf-8b69-46ce-b6dc-240f26ab1727","resolution":{"observed_at":"2026-08-05T22:30:53.856297Z","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-05T22:30:53.832750Z","title":"Worst-case equilibria","venue":null,"work_id":"647d706a-4152-49ae-bfab-9aabd2e18821","year":1999},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.570054Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:10c6ba178912b4e5140be1b4f384300d955f8946bf00758d19f36d1c97d10555","observation_id":"4b72265a-1266-491e-93aa-40b1365d3dc7","resolution":{"observed_at":"2026-08-05T22:30:53.838223Z","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-05T22:30:53.813025Z","title":"Game theory with simulation of other players","venue":null,"work_id":"2201c5d6-ea85-4f7d-907c-896772b0295a","year":2023},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.574950Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:ce8957b23f4b7499544dc2d6cffc9aaf74f3cbe89626444dde11c98e7434bacb","observation_id":"bf104bd9-3595-435f-98c4-47e0908c8db2","resolution":{"observed_at":"2026-08-05T22:30:53.819973Z","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-05T22:30:53.795393Z","title":"Equilibrium and potential in coalitional congestion games","venue":null,"work_id":"acd5c58c-f508-4417-93c4-9efe332a4325","year":2014},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.579643Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:0f744ad24f85260a2545ebae4faa9ef1706813f91f71d575c31d977551ed971a","observation_id":"54856624-6d72-4d7a-8a0b-cf592bb7a0dc","resolution":{"observed_at":"2026-08-05T22:30:53.800858Z","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-05T22:30:53.778804Z","title":"Bidding clubs in first-price auc- tions","venue":null,"work_id":"625011da-d71d-4562-9b6b-3730f5913f1a","year":2002},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.584664Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:96e9e1dbd4bfb41044e7f486ad22cad3ef93571ee4d6b7b4d92b437df84a7548","observation_id":"49f36e87-c5dd-490d-bfe2-ee790b4ae895","resolution":{"observed_at":"2026-08-05T22:30:53.783966Z","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-05T22:30:53.759391Z","title":"k-implementation","venue":null,"work_id":"c263d4f2-28e5-4b8e-a316-83796c463bb7","year":2003},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.589662Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:05524b087c12e9d2ed2550409578668ec21944057fc15b0794eb42d9ab0ea9c3","observation_id":"2eda5623-c210-43d2-88b4-8308553e80a7","resolution":{"observed_at":"2026-08-05T22:30:53.765540Z","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-05T22:30:53.739056Z","title":"K-price auctions: Revenue inequalities, utility equiva- lence, and competition in auction design","venue":null,"work_id":"3ec51d2e-e431-47c5-a026-b0c7607e5741","year":2004},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.594733Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:2c81b0ef2bef5648dadeda4bbea5a9c125ac033d9a0c08c709a5a44c61d03360","observation_id":"65283818-95c2-4685-8810-9d79d6c75992","resolution":{"observed_at":"2026-08-05T22:30:53.744906Z","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-05T22:30:53.721259Z","title":"The economics of welfare","venue":null,"work_id":"48f1643b-b126-46a1-bb15-17c56be9f34c","year":1920},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.599554Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:18eac8998e21d774d0d0a01f4aa0c9741856a75c36905674735d755fe4180af1","observation_id":"d207f5ba-10d1-431d-baf2-a0a63aea62e8","resolution":{"observed_at":"2026-08-05T22:30:53.726549Z","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-05T22:30:53.701804Z","title":"How bad is selfish routing? Journal of the ACM (JACM) , 49(2):236–259, 2002","venue":null,"work_id":"025c5d8f-21d0-429e-8959-bdfff479f523","year":2002},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.604188Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:515da7b037b0e01c9e110eaf502c5471f859d0697e71cc07bedbdd2141294f9c","observation_id":"1b60d8af-6ee4-45c0-a9e5-ffc1388482a3","resolution":{"observed_at":"2026-08-05T22:30:53.708224Z","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-05T22:30:53.677086Z","title":"Program equilibrium","venue":null,"work_id":"c16eb43a-0534-4a43-aaeb-c4e0335da31a","year":2004},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.608866Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:bb977d294f77b6e5f86e242b3aa551e6c85c20b29647394f348941907346a4b9","observation_id":"b8619959-1013-4e71-ba71-98b81075ef4f","resolution":{"observed_at":"2026-08-05T22:30:53.683336Z","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-05T22:30:53.655591Z","title":"Learning equilibria in repeated congestion games","venue":null,"work_id":"5f07ccca-c063-447b-ac16-8a7f6c0f3cfa","year":2009},"citing_paper":{"arxiv_id":"2508.07145","last_updated":"2025-08-10T02:32:43Z","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T22:30:53.614197Z"},"links":{"citing_paper":"/paper/2508.07145"},"observation_digest":"sha256:c8c64e59f3a557e51ffa26c31b25c90073d23fed4f49720ed7ca12d40f16214c","observation_id":"e7895186-f3bc-4b39-8ebb-f4cdb885f9ca","resolution":{"observed_at":"2026-08-05T22:30:53.663075Z","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":"2508.07145","last_updated":"2025-08-10T02:32:43Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-05T22:30:52.834670Z","submitted_at":"2025-08-10T02:32:43Z","title":"When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":26},"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 14 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2508.07145."}