{"as_of":"2026-08-08T04:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09963ea996fc928a0f3e2e677d7d23718f436a6f4a9e0558579e09491ac17a45","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:54:32.319223Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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.01509/citation-record","integrity":"/paper/2506.01509/integrity","json":"/paper/2506.01509/citation-record.json","paper":"/paper/2506.01509"},"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-07T11:54:35.521558Z","title":"Online multistage subset maximization problems","venue":null,"work_id":"2a062c2e-ef0a-4ef2-8782-9a203dab484b","year":2021},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:30.870650Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:9395c588168fde7679a6a479de904f612f69a9a35b5e469b0f47ebf93960fe23","observation_id":"28d47ce0-f850-4658-aade-664372ffcd3e","resolution":{"observed_at":"2026-08-07T11:54:35.678776Z","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-07T11:54:35.304255Z","title":"Online 2-stage stable matching","venue":null,"work_id":"887ba05a-dcca-4ae7-849a-d46194738455","year":2023},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:30.923038Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:b87358999b31c5b5f1f1e2437a1a4faa4e293018ca38dc3f32fd3254f08f88a5","observation_id":"c2c140bb-939f-4fb3-bfcb-7009afb6ef29","resolution":{"observed_at":"2026-08-07T11:54:35.413218Z","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-07T11:54:35.114073Z","title":"Sampling bounds for stochastic optimization","venue":null,"work_id":"efbad2f9-4b03-4b6a-9c10-8ac50b6257f6","year":2005},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.048484Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:de2fc62753db0eea7f69baf27891d92978c60d45540ad3b6274b1f151481d467","observation_id":"1f9795ec-7bad-4b50-98a5-305a36962f0a","resolution":{"observed_at":"2026-08-07T11:54:35.196175Z","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-07T11:54:34.879638Z","title":"Two-stage stochastic stable matching","venue":null,"work_id":"84a031d0-a0c2-462e-b2c8-7687ebbe05de","year":2024},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.139127Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:ffda1da8bc6d1e45906745c8a354f9a728c2b1b123e4690cedbbf0b0129d3c70","observation_id":"ec9fc6dd-caf3-497f-828e-3aa4c32f6569","resolution":{"observed_at":"2026-08-07T11:54:34.997603Z","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-07T11:54:34.636568Z","title":"Multistage vertex cover","venue":null,"work_id":"4c54f89f-46da-42e6-9180-750f5bb9d712","year":2022},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.246894Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:70b93bde4359f8de1a5dea325d1daf8fa50a3edd69d926426bf48897e4f3cb79","observation_id":"dcc5caf6-210c-47d2-a69d-c7b934c4e7c1","resolution":{"observed_at":"2026-08-07T11:54:34.733185Z","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-07T11:54:34.422583Z","title":"Changing bases: Multistage optimization for ma- troids and matchings","venue":null,"work_id":"1b7bdd60-dea9-4337-b229-fa230c4f46ed","year":2014},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.356382Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:ac2ff45ad195dfe67b455141210a3f14c6274af66d3f60cd1ac7798139fdb940","observation_id":"5d3ec1ba-735b-4ad8-a233-69292da041cc","resolution":{"observed_at":"2026-08-07T11:54:34.508857Z","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-07T11:54:34.178327Z","title":"Probability Inequalities for sums of Bounded Random Variables , pages 409–426","venue":null,"work_id":"b7a43e78-04eb-46d1-b3e9-270109438e50","year":1994},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.433333Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:301702fd0d6f6b762216da092ae6c39f8a55a1732d728d839d95234c22065f71","observation_id":"0cb9ae5b-dd58-46d2-832f-ce847ed82bf4","resolution":{"observed_at":"2026-08-07T11:54:34.301722Z","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-07T11:54:33.921962Z","title":"Kleywegt, Alexander Shapiro, and Tito Homem-de Mello","venue":null,"work_id":"78a35ba8-b99b-4b58-95d4-07e4f9429bbb","year":2002},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.526557Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:3aa49a3050d7fe76b7096ec0bad1915325f85f6d75a941a4137a5fc40f522f03","observation_id":"0d8f0d27-5935-4c90-a838-5c8517750148","resolution":{"observed_at":"2026-08-07T11:54:34.033779Z","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-07T11:54:33.726722Z","title":"Maximum matching in the online batch-arrival model","venue":null,"work_id":"486f4d6a-9999-40ce-938e-ec8a640c5aa2","year":2020},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.642207Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:2900eebee7847262bf93b17df7ae45cc5cad48dcf35ea8b7e7d7b5f34c81f3d9","observation_id":"459faebf-e6b8-4140-bfed-25d1e49c6457","resolution":{"observed_at":"2026-08-07T11:54:33.810600Z","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-07T11:54:33.528821Z","title":"Scott Provan and Michael O","venue":null,"work_id":"1d7fac2f-5d3c-40c6-be57-b7837f926a14","year":1983},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.802259Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:3e6ed2548ea30161f8c14a78535c63963bbac0d1e58fe4610e9489ed4c7680e3","observation_id":"7f4eb547-48df-47c9-92c9-cbe7d8288fff","resolution":{"observed_at":"2026-08-07T11:54:33.616083Z","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-07T11:54:33.310545Z","title":"Ravi and Amitabh Sinha","venue":null,"work_id":"6244819d-47ca-4768-b95e-0d6c19977e4a","year":2006},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.889684Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:d82de2bda26cc2a8c3c2da8f47b1b4a9a9b8dd2e2b2267d68a69ed7680ecf659","observation_id":"1e934f0c-3dfc-4142-af8d-18112c761298","resolution":{"observed_at":"2026-08-07T11:54:33.400872Z","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-07T11:54:33.124336Z","title":"Combinatorial Optimization","venue":null,"work_id":"a8d86927-c230-46cd-80e0-2873b9f31ecc","year":2003},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:31.984934Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:de209129df699473676bb11532a2437a081e88164250182f5829592cad4ccb6d","observation_id":"fe36f5df-9cf2-465a-9bc3-4bd378ed9917","resolution":{"observed_at":"2026-08-07T11:54:33.195494Z","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-07T11:54:32.907756Z","title":null,"venue":null,"work_id":"72c9ff63-941b-4d07-b7f0-15f1e92d4e7b","year":1971},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:32.087047Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:85d336a7950b1ffc4b22e60500f1addec6d2b01d1ed960758ef4bc5c6fa1cb92","observation_id":"0fe134ec-5883-49b8-b7a8-205888679187","resolution":{"observed_at":"2026-08-07T11:54:33.006516Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:54:32.665119Z","title":null,"venue":null,"work_id":"db3fe888-69ff-4807-98a3-1384f252b17b","year":null},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:32.186471Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:17c9f0e2ffd0327993659229a9bf4d89c64d0591ad85fe7503e6ffb05c26e51e","observation_id":"c756def2-2c8c-48f4-93ad-68f615621314","resolution":{"observed_at":"2026-08-07T11:54:32.768942Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:54:32.453355Z","title":null,"venue":null,"work_id":"85bd7b1a-bdc8-4a42-bc66-420a8ad18763","year":2012},"citing_paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:54:32.319223Z"},"links":{"citing_paper":"/paper/2506.01509"},"observation_digest":"sha256:1b27dfeb5e3426b1276ea5d7e1b017e183053f54908b674357b32bce4958a67f","observation_id":"79697182-ba72-4dc9-a38c-1393bbe8eefc","resolution":{"observed_at":"2026-08-07T11:54:32.542367Z","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"}}],"paper":{"arxiv_id":"2506.01509","last_updated":"2025-06-02T10:17:26Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-07T11:37:19.508532Z","submitted_at":"2025-06-02T10:17:26Z","title":"Two-stage Stochastic Assignment Games"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":15},"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 8 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.01509."}