{"as_of":"2026-08-12T12:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c23a9a030dba8da8916ac20ec1b0e62caed3e5a37e09c7c9ef73eebae176da2c","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:17:53.912177Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.22561/citation-record","integrity":"/paper/2506.22561/integrity","json":"/paper/2506.22561/citation-record.json","paper":"/paper/2506.22561"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2011.152","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Approximating petri net reachability along context-free traces","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"9d0d637c-b4b9-42a0-8b99-97dbe297c460","year":2011},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.811232Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:691e766e31e1238052355fe7d4458428dec6167b2c54da471880e034ed40c623","observation_id":"4cc68fe1-d003-43c8-872e-8c2abc42d07c","resolution":{"observed_at":"2026-08-06T22:17:54.077530Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.814893Z","title":"The reachability problem for two-dimensional vector addition systems with states","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.814893Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:73e0e8f591c33f0c86d4bd0e74aaf7a661b12f59744cfb5abde7f3c1d0448f57","observation_id":"5cf00de5-334b-4453-8dac-34bf055a0eca","resolution":{"observed_at":"2026-08-06T22:17:53.814893Z","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":"2351.11423","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:54.560762Z","title":"Two-variable logic on data trees and XML reasoning","venue":null,"work_id":"0c942755-8102-41d5-a325-3a24edd355e6","year":2006},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.818066Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:930b6a412836a2b710be45756028f50d6241681b7780b7316d9e23550e00290a","observation_id":"b0fc1924-94ed-4d43-8139-81a844c102b6","resolution":{"observed_at":"2026-08-06T22:17:54.591448Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.821702Z","title":"Analysis of recursively parallel programs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.821702Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:fe9d5780bab071d9ea319d15e382f7c523de8b274efa13f07d5d3197c47528c0","observation_id":"29b9b407-6c2b-4c9d-9706-f47c2d11feea","resolution":{"observed_at":"2026-08-06T22:17:53.821702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.824981Z","title":"The tractability border of reachability in simple vector addition systems with states","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.824981Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:dc00ea7b2062ecf64ffa3d3299b5730b0a4cdf176d6e9a83fca15286e3d46155","observation_id":"c4448311-482a-4938-a583-0e496f83c120","resolution":{"observed_at":"2026-08-06T22:17:53.824981Z","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":"2017.80050","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:54.419026Z","title":"Timed pushdown automata and branching vector addition systems","venue":null,"work_id":"54fe25aa-9ff7-4500-8bbd-d03063b6f10a","year":2017},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.828266Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:0ee5ed6218d5d697c3587511ce9f757a1183b0d1e4a840cdd1e5ddc2c3bc31c4","observation_id":"d28a0cb3-5893-4a16-b6f9-642a2b61c5cd","resolution":{"observed_at":"2026-08-06T22:17:54.423069Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.831246Z","title":"Murawski, and C","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.831246Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:f6011d9d23b61e984fa85a0d9c7559101ca4adee27d1fc12262490e3a647e2b1","observation_id":"b884540f-236b-45fc-b1cf-62763d78d3b0","resolution":{"observed_at":"2026-08-06T22:17:53.831246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.833910Z","title":"The reachability problem for P etri nets is not elementary","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.833910Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:255c868935afd892444e6a9fe18f347f6dfde19cdf46b8f2c52cdb459e67ff8a","observation_id":"f7a1a7de-5fcc-463e-a54e-ca70a99d88fb","resolution":{"observed_at":"2026-08-06T22:17:53.833910Z","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-06T22:17:54.890825Z","title":"David and H","venue":null,"work_id":"34e87ae9-354b-4c7f-94b3-68af6d203f1c","year":1987},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.837461Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:fa29993f652f4eb34b1e934f2a1a412d029780477635332b0006d53ec04785cf","observation_id":"7838c4af-ac98-4154-9069-6ed9dff33f01","resolution":{"observed_at":"2026-08-06T22:17:54.926582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.13196","last_updated":"2020-04-27T22:07:02Z","snapshot_observed_at":"2026-08-11T19:02:40.827388Z","submitted_at":"2020-04-27T22:07:02Z","title":"Distributions of Distances and Volumes of Balls in Homogeneous Lens Spaces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.13196","snapshot_observed_at":"2026-08-06T22:17:53.840271Z","title":"Vector addition tree automata","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.840271Z"},"links":{"cited_paper":"/paper/2004.13196","citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:ac47a1fed2dcc6330fa9ca00f42c66b95534cf2315ac0a57e2a3fd9bb88d3423","observation_id":"c216fedf-be51-4933-8134-104f4f5ea450","resolution":{"observed_at":"2026-08-06T22:17:53.840271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.843931Z","title":"The covering and boundedness problems for branching vector addition systems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.843931Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:b793c4506ae0efe0f2963755b0520cf0f818f1f2d967c79ee7218150c65df07b","observation_id":"b56102f2-9808-49f8-bf4e-935337623ab8","resolution":{"observed_at":"2026-08-06T22:17:53.843931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.847524Z","title":"Polynomial-space completeness of reachability for succinct branching VASS in dimension one","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.847524Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:cf0391a66b6abd27ca3f6e4b3f7a964dcb1c77be517183702c2a93d912f2de08","observation_id":"690f4dfa-87ce-43ad-87c2-f96380ad8da8","resolution":{"observed_at":"2026-08-06T22:17:53.847524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2018.31","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Reachability for two-counter machines with one test and one reset","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"751e99ed-21e9-4aa0-b235-24e47186a8df","year":2018},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.850748Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:68746ebfdea1bd543534db86f258257f57d34a354d784433b48e0e7e2ab9d5d5","observation_id":"7c9f31f7-bb7e-4de6-97a5-f8e1d9978724","resolution":{"observed_at":"2026-08-06T22:17:54.039263Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.853871Z","title":"Complexity analysis of continuous petri nets","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.853871Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:0fb21fc3ab3760ac83c0f5802db0948cfd24d251b45d41ad54b325187ed7dc08","observation_id":"dbb1c0a6-8bab-4223-b609-ceb05396c384","resolution":{"observed_at":"2026-08-06T22:17:53.853871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2022.124","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Reachability in bidirected pushdown VASS","venue":"arXiv (Cornell University)","work_id":"f11bfbac-2123-4cab-b1c0-51a549959672","year":2022},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.857054Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:04d1abc043469b796e2c61e40988b60d7a4cf51aa4ab075fc4c3586eabfd5b58","observation_id":"cb60087e-8074-4d9e-99fe-05fa2fb15d74","resolution":{"observed_at":"2026-08-06T22:17:54.025609Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.859785Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.859785Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:b47d383e578ea2bf7eca5bfd73b9d1333a708493db5a2623499c253d3a447a44","observation_id":"dbf0c39d-7dd6-4266-b34e-c6d33295be0e","resolution":{"observed_at":"2026-08-06T22:17:53.859785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icalp.2016.105","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A polynomial-time algorithm for reachability in branching VASS in dimension one","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"b718d878-17fa-4482-84ce-ff90cad64a75","year":2016},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.862518Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:c35a52f43ac134095612611f4c399592afa5b231f40928c5b5f2c7d48ad5541d","observation_id":"4ee311cc-2dbd-4edc-b0e5-4c02cf2d8be7","resolution":{"observed_at":"2026-08-06T22:17:54.012093Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2953.32429","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:54.340226Z","title":"A survival guide to presburger arithmetic","venue":null,"work_id":"86cd08d5-e33f-474b-8a83-94f42d292d21","year":2018},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.865613Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:13b1649abc40eddf169d46053f969863269bb93af3a52ff59c0a51d5063d5e77","observation_id":"8da027a3-5301-41ca-8f06-8e0791c8b986","resolution":{"observed_at":"2026-08-06T22:17:54.344487Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.868016Z","title":"Hopcroft and Jean - Jacques Pansiot","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.868016Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:9860192da5902a433d3acb37ed39ef2e0ffa00e47b5e6a034452927d8c904343","observation_id":"f9a7c251-d29f-420d-a989-bb46a8295f71","resolution":{"observed_at":"2026-08-06T22:17:53.868016Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.871183Z","title":"Fo2( , +1, ) on data trees, data tree automata and branching vector addition systems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.871183Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:953bf68bd03910fa6374de60cb5f33694e0fb0347a984a93b60ccadbb6232d41","observation_id":"39e674cc-e839-4514-8652-703140b06ab8","resolution":{"observed_at":"2026-08-06T22:17:53.871183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.873576Z","title":"Karp and Raymond E","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.873576Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:42682f31aafe89c8d45847f65ebaeb0c2bffc374ef781dd4595d2fa123ab8e66","observation_id":"3bf20cca-d330-418d-993f-aa621f2c32d1","resolution":{"observed_at":"2026-08-06T22:17:53.873576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1310.1767","last_updated":"2013-10-07T13:00:07Z","snapshot_observed_at":"2026-07-06T03:24:57.969541Z","submitted_at":"2013-10-07T13:00:07Z","title":"The reachability problem for vector addition systems with a stack is not elementary","version":1},"cited_work":{"arxiv_id":"1310.1767","doi":"10.48550/arxiv.1310.1767","metadata_source":"pith","pith_arxiv_id":"1310.1767","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The reachability problem for vector addition systems with a stack is not elementary","venue":"cs.FL","work_id":"32a43dae-62ff-41de-8b2b-42f51f23ceae","year":2013},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.876128Z"},"links":{"cited_paper":"/paper/1310.1767","citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:39791266e3d707af10a2919f06dd369f7feff7a219bba07a22db270fa93ac7d3","observation_id":"8cf07bfb-3d18-47f8-8772-56607d16d92b","resolution":{"observed_at":"2026-08-06T22:17:53.988232Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:54.734445Z","title":null,"venue":null,"work_id":"f93b5abd-81b7-436a-822e-cd65f842c452","year":2008},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.879049Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:6bde63c9ca6e362f803614d400ef0e444fc4c311cc81843d82d6b5675113f843","observation_id":"9c61c61d-0fea-4ec0-acb8-dd4bf79ee434","resolution":{"observed_at":"2026-08-06T22:17:54.805847Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.881483Z","title":"Nonelementary complexities for branching VASS , MELL , and extensions","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.881483Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:fdb07edf511e59ffbd09c00ac3da213d0a5006854e6d7121fd5d8723d8d5143e","observation_id":"93db3afc-23cc-4e06-89a1-db8fbb6c1bef","resolution":{"observed_at":"2026-08-06T22:17:53.881483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.884362Z","title":"The reachability problem for P etri nets is not primitive recursive","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.884362Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:c0b0d404d105e21039a4710b59cc46e73c140b22040cdec64d3311edae3d41b6","observation_id":"caca1071-6f92-46ad-a443-7ef617f0b5ec","resolution":{"observed_at":"2026-08-06T22:17:53.884362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.886967Z","title":"Reachability in vector addition systems is primitive-recursive in fixed dimension","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.886967Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:d58570efb6dcdfac94979c4bfada5859967cbf81edbe71cb7b8c9406af5836eb","observation_id":"4b9910e1-fdf4-4d96-8b2c-7a7e91ba48d0","resolution":{"observed_at":"2026-08-06T22:17:53.886967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.890153Z","title":"On the coverability problem for pushdown vector addition systems in one dimension","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.890153Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:d385ff7ff2baa5c150f8389581254d549eee85ce54b3cec19515b09ae6e09178","observation_id":"19bd9f0a-4e5d-46ca-9851-59ccd60c3c62","resolution":{"observed_at":"2026-08-06T22:17:53.890153Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.893433Z","title":"Counting and equality constraints for multitree automata","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.893433Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:7dd2c562cdf94731e291db51ec9c085de85b44a1093c9893b6ea6c1a99fc817f","observation_id":"da31abe3-0287-4a3e-bae2-c3a3d100c469","resolution":{"observed_at":"2026-08-06T22:17:53.893433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.896589Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.896589Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:0816bce878c27eb10cc5a947ea1fd1275e91564321921ad227bd6ca1fa6e319b","observation_id":"1e878b8f-bd74-4cbb-a8ea-27156f2d9f87","resolution":{"observed_at":"2026-08-06T22:17:53.896589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.concur.2019.28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Reachability for bounded branching VASS","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"e587fce4-2f41-44c3-bbf2-9e61d8397b4b","year":2019},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.900294Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:b79850d55849c286cc74c2b16e2e1b98dcec9385da5b3d623b0118d3cf537026","observation_id":"8bf682b9-5c6a-489f-9694-c2de4e1adbd9","resolution":{"observed_at":"2026-08-06T22:17:53.952810Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.903038Z","title":"Beyond regularity: Equational tree automata for associative and commutative theories","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.903038Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:7f5442d8fc732e69e1041f0393113ee1a824f0d0b41a86a2660452c7f832eccf","observation_id":"6d8ae08f-8855-4240-9677-e46a21431cd0","resolution":{"observed_at":"2026-08-06T22:17:53.903038Z","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":"1732.98176","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:54.158538Z","title":"Multiset-valued linear index grammars: Imposing dominance constraints on derivations","venue":null,"work_id":"69e62d4c-720a-464b-8a7e-b42c55c6b102","year":1994},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.906269Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:abd508ad04c6389fcf8c85a7f8b4fab4794a2954848b49e47717283fc5b6e040","observation_id":"0e113971-cca5-4ac7-bf45-79b9f6ee8f09","resolution":{"observed_at":"2026-08-06T22:17:54.162831Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:54.624281Z","title":"On the computational complexity of dominance links in grammatical formalisms","venue":null,"work_id":"2911962e-1b5b-49bd-99d4-d27237a9cadd","year":2010},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.909541Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:07ff4e4b8b597de8397cc162c1b70b2e9cc523325b367597ab07ee6cc0397e6a","observation_id":"48f8e70b-a41a-4b82-939e-7747812795ae","resolution":{"observed_at":"2026-08-06T22:17:54.674470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:17:53.912177Z","title":"Karp-miller trees for a branching extension of VASS","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T22:17:53.912177Z"},"links":{"citing_paper":"/paper/2506.22561"},"observation_digest":"sha256:772206e1d4fbb5e03025f26d6bece2290e426d940f20fc14708c18dc3b122715","observation_id":"029ec2c1-4880-464b-ba0a-2cbf3b3671e2","resolution":{"observed_at":"2026-08-06T22:17:53.912177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.22561","last_updated":"2025-06-27T18:20:20Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-06T22:01:15.189795Z","submitted_at":"2025-06-27T18:20:20Z","title":"On the Reachability Problem for Two-Dimensional Branching VASS"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":1,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":21,"verified_exact":6,"verified_fuzzy":2},"total_outbound_references":34},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2506.22561."}