{"as_of":"2026-08-22T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:002af5452f622208e5d707b23c1c15454e24136cfca87f195c40b68845eae60a","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:46:52.629580Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2608.08017/citation-record","integrity":"/paper/2608.08017/integrity","json":"/paper/2608.08017/citation-record.json","paper":"/paper/2608.08017"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9712.12976","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:53.859807Z","title":"Adler and P","venue":null,"work_id":"10000c51-4631-4b61-82e4-9bc3e218ff07","year":1992},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.482870Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:41e9027724d9bea3ccdfe10f8e257502370c56be40f513b2b738eabef8151d27","observation_id":"53170a61-cffa-4a90-9fc3-5dc801d2673a","resolution":{"observed_at":"2026-08-12T00:46:53.868791Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01188714","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"Adler and P","venue":"Algorithmica","work_id":"c046e0f8-4535-45b1-8507-c1a783bcd396","year":1994},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.489941Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:a2dde0ffa2a02760f4bf59a3269f652a06fb479e8fc6687ac41dc8a1da23651e","observation_id":"3c9a20f0-5d1d-4880-bc9a-e6a99960a9fc","resolution":{"observed_at":"2026-08-12T00:46:52.883731Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:05.781256+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:05.781256+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0602059","last_updated":"2006-02-04T10:44:31Z","snapshot_observed_at":"2026-08-18T18:03:50.766808Z","submitted_at":"2006-02-03T13:28:50Z","title":"The Matrix of Maximum Out Forests of a Digraph and Its Applications","version":2},"cited_work":{"arxiv_id":"math/0602059","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/0602059","snapshot_observed_at":"2026-08-12T00:46:53.782974Z","title":"The Matrix of Maximum Out Forests of a Digraph and Its Applications","venue":"math.CO","work_id":"2e17ac0e-24be-4b72-8722-8e5d5792bce8","year":2006},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.496152Z"},"links":{"cited_paper":"/paper/math/0602059","citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:22ef63bd129f07b62e52d41cc885532610d87f80219e0dba528969801ea87bbf","observation_id":"b65d3abc-f1be-4934-814e-82252b2cc8cd","resolution":{"observed_at":"2026-08-12T00:46:53.789117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.1104","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:53.629109Z","title":"Attia and M","venue":null,"work_id":"9f082cf9-3cbe-486f-824e-f90e9aec8239","year":2021},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.503884Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:1464b63c1c04064f04d6b3c41cce075b7c3579a1e55e31aa358ee67a46b22831","observation_id":"d3b46fb2-075c-475a-a760-b7e8387c5645","resolution":{"observed_at":"2026-08-12T00:46:53.763695Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4171/rmi/834","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:52.861377Z","title":"Avendaño and J","venue":null,"work_id":"a468c687-c61d-4b54-abf7-de5e4255013b","year":2015},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.509816Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:bfc1e20aba3eeb196fe445096e9261a5c4448058a261670b45ee7241c5b5a042","observation_id":"ef971d74-e47e-4b7b-8ea3-82b83eac3d8d","resolution":{"observed_at":"2026-08-12T00:46:52.866759Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.055505+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.055505+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T00:46:52.515946Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.515946Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:a426eaf014161884375a7c5f42958759d08dceb3384c66bcff92adb6fe4a2312","observation_id":"f9120282-d162-44eb-bc90-1dbf57d11495","resolution":{"observed_at":"2026-08-12T00:46:52.515946Z","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":"2022.0332","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:53.468393Z","title":"Chatterjee, M","venue":null,"work_id":"80b62d60-0e35-4319-8964-8db75437f391","year":2025},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.523333Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:d64d2c599d420d56f57d236ee570f773a1d1d62eefdf95897442fd6dc672e324","observation_id":"96a09403-41b3-4ec1-a0d9-416eef25d29f","resolution":{"observed_at":"2026-08-12T00:46:53.478983Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01104109","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":null,"venue":"Journal of Mathematical Sciences","work_id":"1e41fda6-b4cd-4966-909c-043789a45433","year":1992},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.529092Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:3dc5f3c36eb061eae69cca04b6ca3f954011fd6904bb4f6de0258ca3b16a5274","observation_id":"91b669d6-ed0a-4295-b8e6-4348b51946c3","resolution":{"observed_at":"2026-08-12T00:46:52.847342Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.159797+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.159797+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1515/9781400882151-004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:52.819217Z","title":null,"venue":null,"work_id":"fadf571c-dd19-4715-be69-2c6d3238a6cb","year":1957},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.535174Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:c5b882664d61cd154ef2b0b7967a1f9827ded2aca55692a1eef98fe8a224e710","observation_id":"5b1ec914-8889-485c-b08a-65a87f370765","resolution":{"observed_at":"2026-08-12T00:46:52.827639Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.235166+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.235166+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T00:46:53.929299Z","title":"Flesch, F","venue":null,"work_id":"dce65c48-f20c-412d-8f43-c7ea0475cf56","year":2001},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.540388Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:f961970b62ba3efb640a5e98cdbc0c1736bd9f6983bb3137eb8658ff5ee76ab1","observation_id":"b6a97362-74d9-48d3-bb98-ce1d98524f21","resolution":{"observed_at":"2026-08-12T00:46:53.935525Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1202.6493","last_updated":"2012-02-29T09:24:28Z","snapshot_observed_at":"2026-08-15T04:17:47.576758Z","submitted_at":"2012-02-29T09:24:28Z","title":"Ideals of curves given by points","version":1},"cited_work":{"arxiv_id":"1202.6493","doi":null,"metadata_source":"pith","pith_arxiv_id":"1202.6493","snapshot_observed_at":"2026-08-12T00:46:53.384647Z","title":"Ideals of curves given by points","venue":"math.AG","work_id":"0427de04-f33f-43cb-9296-fb839d7569f4","year":2012},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.545364Z"},"links":{"cited_paper":"/paper/1202.6493","citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:2f68b68170164fa8cfe005cf4aba328784656b02db546243dcd2f8a6058de42a","observation_id":"2329874b-2605-4da9-be3b-f7371e6e7349","resolution":{"observed_at":"2026-08-12T00:46:53.390844Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"files/4288924","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:53.357055Z","title":null,"venue":null,"work_id":"3ccf6d8c-e97d-426d-a71d-62754d2c8380","year":2015},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.551632Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:de609ba13a6e6db4621ed49d0f57a095955a25d32ec1da869d1af9afc901becc","observation_id":"cce93be4-f394-467b-bc2c-3ed59cf9f030","resolution":{"observed_at":"2026-08-12T00:46:53.367615Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-41036-9_12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":null,"venue":"Lecture notes in computer science","work_id":"fca6ec55-ee4b-4303-9d83-bd21bc8f3906","year":2013},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.556900Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:d9401dcffc0adc17b76796297efd5beaa62a1c571190f50f02b116983a0920f3","observation_id":"e2c4d4f5-e526-41e6-b45b-682f583cc90f","resolution":{"observed_at":"2026-08-12T00:46:52.803325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.311211+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.311211+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1202.3898","last_updated":"2012-02-17T12:37:42Z","snapshot_observed_at":"2026-08-15T04:19:00.804748Z","submitted_at":"2012-02-17T12:37:42Z","title":"Exact Algorithms for Solving Stochastic Games","version":1},"cited_work":{"arxiv_id":"1202.3898","doi":null,"metadata_source":"pith","pith_arxiv_id":"1202.3898","snapshot_observed_at":"2026-08-12T00:46:53.246286Z","title":"Exact Algorithms for Solving Stochastic Games","venue":"cs.GT","work_id":"01d19dec-9ef3-4d76-acf1-d2291075e248","year":2012},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.562392Z"},"links":{"cited_paper":"/paper/1202.3898","citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:5ea8db797e4f76e0279af28f51da538981e8d2d997831715b8c1ddd3352e1068","observation_id":"19bddd23-1f7f-4a98-9724-2213b00ba42e","resolution":{"observed_at":"2026-08-12T00:46:53.252979Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/s0025-5718-1988-0917831-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:52.774755Z","title":"Kannan, A","venue":null,"work_id":"2e84e1c5-cee9-4ab9-97af-43ae271d4142","year":1988},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.568097Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:9b7ea27cfe31ee561b367f23fffdf1010c02fc79ac4c42e80a86f6472e4fb0ba","observation_id":"582257bc-1d9f-4da9-83f7-3f302b5982b3","resolution":{"observed_at":"2026-08-12T00:46:52.780705Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.43337+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.43337+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jalgebra.2013.10.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:52.757527Z","title":"Kemper and N","venue":null,"work_id":"efe2cac0-8ea8-4c56-8426-8157d354f7f8","year":2014},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.573317Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:dc80387752f56e231755d4f52e38f269426f8fa8d86789960988c009cec61f4d","observation_id":"2732331f-1583-4988-82c8-2680c8d8d9a3","resolution":{"observed_at":"2026-08-12T00:46:52.762787Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.513535+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.513535+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T00:46:53.911237Z","title":null,"venue":null,"work_id":"218a3774-db40-487b-9d7a-52b0f84d7f05","year":1983},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.579203Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:2aa379e6c17d6272087ec72ebe938a168bb878b8915907817250b959db51bb03","observation_id":"1b75f502-5b54-461f-b011-83f5f21fdb8e","resolution":{"observed_at":"2026-08-12T00:46:53.916525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0030321","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":null,"venue":"Lecture notes in computer science","work_id":"e92d7c01-4754-4306-a57d-67781d42a4b1","year":1984},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.584312Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:c8329e09fba1c7fe06915acb8ab43e0fd78272fda7afff69916f3fc154a091ba","observation_id":"915662dd-2859-4382-83d9-d99cf157be55","resolution":{"observed_at":"2026-08-12T00:46:52.745024Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.606103+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.606103+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.08843","last_updated":"2016-10-04T01:57:01Z","snapshot_observed_at":"2026-08-14T22:30:19.158175Z","submitted_at":"2015-09-29T16:49:48Z","title":"Algorithms for commutative algebras over the rational numbers","version":2},"cited_work":{"arxiv_id":"1509.08843","doi":null,"metadata_source":"pith","pith_arxiv_id":"1509.08843","snapshot_observed_at":"2026-08-12T00:46:53.210440Z","title":"Algorithms for commutative algebras over the rational numbers","venue":"math.AC","work_id":"5a455604-59f1-41ee-8e7c-0168447f21d9","year":2015},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.590363Z"},"links":{"cited_paper":"/paper/1509.08843","citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:2b6998f785db91fa71eb6540c5be2b187fb611f3796746405549b5cd7fac0fd7","observation_id":"4d7bc5b5-85ab-4c03-8680-6ec2892781b1","resolution":{"observed_at":"2026-08-12T00:46:53.223052Z","resolver_source":"local_arxiv","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T00:46:53.880039Z","title":"Mignotte and D","venue":null,"work_id":"651c71ac-c096-415d-860f-623a87b3fdf3","year":1999},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.597266Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:2eb9d1abf86b63e39cbe66b1c07117a056f1095b6c95bbbfc318416f60efa2d6","observation_id":"30955058-aea8-4ae7-92d6-4222ac2f91d9","resolution":{"observed_at":"2026-08-12T00:46:53.886732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T00:46:52.603317Z","title":"Oliu-Barton","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.603317Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:53fc1f927bd23e24ffff2e68fc445ac77f3463b5cc14716abc6000d6b579de3c","observation_id":"fc64cd3c-fefc-4f51-9c17-32f5a0a6c85a","resolution":{"observed_at":"2026-08-12T00:46:52.603317Z","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-12T00:46:52.609595Z","title":"Wi- ley Series in Probability and Statistics","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.609595Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:49b755526a6b7cf5588a30de17492693e759d2d27c1ba5f465413622c15738a6","observation_id":"6908062a-c3fe-4692-b136-70247df8caf4","resolution":{"observed_at":"2026-08-12T00:46:52.609595Z","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.1515/9781400881727-004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:52.695745Z","title":null,"venue":null,"work_id":"4c8e12a1-d0e7-437a-8eb8-fa0c5e22f39a","year":1950},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.615387Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:00ca9d8bf98f888eeccf8568e586b24c58192ca165ec7657db0fb63e685df997","observation_id":"49c9db3d-8f73-4e8b-8074-4931d07767a2","resolution":{"observed_at":"2026-08-12T00:46:52.703393Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.775756+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.775756+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1995.28536","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:46:53.069590Z","title":null,"venue":null,"work_id":"d4465229-cd91-4d7e-8b21-a8b1152c0e1d","year":2003},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.622713Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:de109daca47b10d26a0118fc45ce37a5d14caba04762539c98d7f5bea87cc365","observation_id":"3ab986ed-bb84-41ec-83bb-d92ebfefa9df","resolution":{"observed_at":"2026-08-12T00:46:53.079093Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00199-009-0437-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"Solan and N","venue":"Economic Theory","work_id":"5d4b8551-604b-4db7-8efc-c1af0c7a7ce9","year":2010},"citing_paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T00:46:52.629580Z"},"links":{"citing_paper":"/paper/2608.08017"},"observation_digest":"sha256:f3cb12380efc229324e70eb20a84837fdc1a6848b5d4275ba3ccc9729b45ccd8","observation_id":"bc905f01-baf7-463c-93cd-7895a8c6d1f7","resolution":{"observed_at":"2026-08-12T00:46:52.675425Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-13T22:38:06.864748+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-13T22:38:06.864748+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.08017","last_updated":"2026-08-08T08:55:35Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-13T23:22:59.444754Z","submitted_at":"2026-08-08T08:55:35Z","title":"Existence and computation of monomial families of near-optimal strategies for recursive games"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":3,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":17,"verified_fuzzy":1},"total_outbound_references":25},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2608.08017."}