{"as_of":"2026-08-07T18:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a480c816a1929d0d4fc3c899f683c7dad68dcd174c655321e331bc0e1d8efc2","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:14:38.493294Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-02T00:54:52.029029Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19675","snapshot_observed_at":"2026-08-02T00:54:52.029029Z","title":"arXiv preprint arXiv:2507.19675 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.14859","last_updated":"2026-07-16T11:32:20Z","snapshot_observed_at":"2026-08-02T00:54:49.806227Z","submitted_at":"2026-07-16T11:32:20Z","title":"Randomized routing strategies of fleets of CAVs may prove market efficient","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T00:54:52.029029Z"},"links":{"cited_paper":"/paper/2507.19675","citing_paper":"/paper/2607.14859"},"observation_digest":"sha256:e107700b2f05772b7eac6af99388b0c6243f4d9ddbbd6147055321366d1e6639","observation_id":"03b94f50-aac6-4b5f-aa62-cbd291996b18","resolution":{"observed_at":"2026-08-02T00:54:52.029029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2507.19675/citation-record","integrity":"/paper/2507.19675/integrity","json":"/paper/2507.19675/citation-record.json","paper":"/paper/2507.19675"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1040.0197","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:14:39.146855Z","title":"URL http://dx.doi.org/10.1287/opre.1040.0197","venue":null,"work_id":"842f4562-57f6-40a1-9c1b-de47108a6e4e","year":2012},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:37.993328Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:c459efae96e41e790dd0576f0a2cf9d198c23b8da9352f4a85fa7902658d05cf","observation_id":"6d10f235-3989-4598-8893-83ff95da8cd4","resolution":{"observed_at":"2026-08-06T14:14:39.186586Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T14:14:39.413115Z","title":"we can assume that sum of this set is equal 0, in such approach we look for non-trivial solutions to such problem (not the one that takes all elements in the set)","venue":null,"work_id":"94ce198c-db69-4b32-8f3f-bf24098a3325","year":1952},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.493294Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:897c7340c554857f32da4a19617c053d1352affe5a09a1823581a5a32baed976","observation_id":"866f568e-a90b-4410-a657-d8335103f829","resolution":{"observed_at":"2026-08-06T14:14:39.509808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T14:14:39.599690Z","title":"Proof of the Claim 2.13 In this section, we prove that reduction of a Wardropian Cycle length by the flow partition method isNP-hard","venue":null,"work_id":"6a1eff5e-e97d-4b2a-af3e-a6e37cfd6454","year":1979},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":368,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.426098Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:b8af9782961a61a43bfac5e94b251b3251b9e4886227dddd2f048eae92adef61","observation_id":"deaa0e5e-f9d2-4f76-ab98-5f3236843ee8","resolution":{"observed_at":"2026-08-06T14:14:39.667137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:14:37.839899Z","title":"URL https://doi.org/10.2307/1969529","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":1951,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:37.839899Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:2b65ad91ff23dedf3d4b340aa89d620fd8eed7090163a9502ccd7f5e74f42c7d","observation_id":"7fc261d2-ce03-41c7-b3e3-2cc0c695edce","resolution":{"observed_at":"2026-08-06T14:14:37.839899Z","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-06T14:14:40.106302Z","title":"Stier-Moses","venue":null,"work_id":"a21fd5dd-e81d-40e3-bd09-358db3d91cb8","year":2007},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.136968Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:e33bace3bdc159e0e053c685c8fa53706f918e750eb576a2217834247cac3552","observation_id":"ecae036f-3f04-41aa-8d63-ee77c8bb591f","resolution":{"observed_at":"2026-08-06T14:14:40.182714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T14:14:40.258906Z","title":null,"venue":null,"work_id":"2cf33a86-0429-41d2-9156-ba4e8ade6f7e","year":1999},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:37.924991Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:53643fc165925809942c6e66a5b85a0d92d0380de6c0d3f88f8503b54481740a","observation_id":"c3428d44-057a-46ab-836d-1a33dc903d18","resolution":{"observed_at":"2026-08-06T14:14:40.332503Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07618","last_updated":"2024-05-14T01:56:30Z","snapshot_observed_at":"2026-08-01T18:58:38.919527Z","submitted_at":"2022-09-15T21:32:23Z","title":"Differentiable Bilevel Programming for Stackelberg Congestion Games","version":4},"cited_work":{"arxiv_id":"2209.07618","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.07618","snapshot_observed_at":"2026-08-06T14:14:38.948721Z","title":"Differentiable Bilevel Programming for Stackelberg Congestion Games","venue":"cs.GT","work_id":"fc48987c-a4e5-4ae9-9daa-4fc0df53ef45","year":2022},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.206632Z"},"links":{"cited_paper":"/paper/2209.07618","citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:bc7319fdfe588ebf9c722cbd4eb71539551f586063778bf847a578bc6f537a10","observation_id":"e64058c4-0fd5-4a47-a931-3ae9a4f8407d","resolution":{"observed_at":"2026-08-06T14:14:39.011600Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T14:14:39.924931Z","title":"Real-time urban tra ffic amount prediction models for dynamic route guidance systems","venue":null,"work_id":"e64182a0-8652-4f0f-b1df-58c39cac1f80","year":2014},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.270601Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:23f22c87b5ede5389abbbe33490b9ba17e1c7231714e270f5f79aa6f193e71ba","observation_id":"ba49cb92-1ec9-44d5-8733-b4a42c88d1dc","resolution":{"observed_at":"2026-08-06T14:14:39.986318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06T14:14:39.752882Z","title":"Bagloee, M","venue":null,"work_id":"8f571e68-53dc-40d5-865a-acdfe57fbda3","year":2016},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.336116Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:6c1fc314f101cea73be50c7f89c885997c10431104489f282c41486f7a098a36","observation_id":"c5a71a21-f1a4-4406-975b-49ebac55ad31","resolution":{"observed_at":"2026-08-06T14:14:39.842291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.22837","last_updated":"2025-03-28T19:17:03Z","snapshot_observed_at":"2026-08-07T16:29:19.066280Z","submitted_at":"2025-03-28T19:17:03Z","title":"A Cooperative Compliance Control Framework for Socially Optimal Mixed Traffic Routing","version":1},"cited_work":{"arxiv_id":"2503.22837","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.22837","snapshot_observed_at":"2026-08-06T14:14:39.265048Z","title":"A Cooperative Compliance Control Framework for Socially Optimal Mixed Traffic Routing","venue":"eess.SY","work_id":"aaddde48-fd59-475f-a6e7-896ace4d2c99","year":2025},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:37.772917Z"},"links":{"cited_paper":"/paper/2503.22837","citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:bdc527ac2b084b62463bd13b4468d21f88dfc2390b1153ac00f2890fd81dcd8c","observation_id":"9357e70a-998a-46bb-ad45-e7cd6a049eb9","resolution":{"observed_at":"2026-08-06T14:14:39.330265Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.10501","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:14:38.782434Z","title":"doi: https: //doi.org/10.1016/j.cor.2020.105016","venue":null,"work_id":"e7306f27-cf96-4375-b4e5-827dc9e7fac2","year":2020},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.379728Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:cce10f9c2eb2d832e833597ad7b41431e19f2b3e0d9f4fdfa31b2cb830d156e4","observation_id":"5832f7e3-69b0-462b-9c6a-18c06e3b4adf","resolution":{"observed_at":"2026-08-06T14:14:38.864078Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.trpro.2023.02.186","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:14:38.595339Z","title":"doi: https: //doi.org/10.1016/j.trpro.2023.02.186","venue":null,"work_id":"c722516b-a5a8-4ae8-9d0b-82949bb7833d","year":2023},"citing_paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T14:14:38.033730Z"},"links":{"citing_paper":"/paper/2507.19675"},"observation_digest":"sha256:12869023573400190e27dff3ccd08e40b58c04bddd6777aa0b6a4f8a1e8c678c","observation_id":"ed5f356f-d4c2-4002-b322-9cb1737e887b","resolution":{"observed_at":"2026-08-06T14:14:38.645238Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.19675","last_updated":"2025-07-25T21:01:31Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-06T14:14:36.720593Z","submitted_at":"2025-07-25T21:01:31Z","title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":5},"total_outbound_references":12},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2507.19675."}