{"as_of":"2026-08-04T05:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:510d7bd493993c607cb72a73130ac9ca6ce588b0915df82ab66fd010214a66a1","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T02:25:31.261856Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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/2607.03444/citation-record","integrity":"/paper/2607.03444/integrity","json":"/paper/2607.03444/citation-record.json","paper":"/paper/2607.03444"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T02:25:31.261856Z","title":"Disjoint refinement","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:061571d9d71975bf935249e8b62faddf8c10614c11d425dbae74532c84db4fc6","observation_id":"2ca60c76-53d6-43e0-a259-fa8bdba5e537","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"The hyper-weak distributive law and a related game in B oolean algebras","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:6620426d952529b73d43547375cde6723d74e44203c63346c8fa68440619436a","observation_id":"bf1d736c-9c2c-4c78-8ef3-5cf0be044783","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:b27454e491b79d27af3c5be3ca85a25f187c6c78776e60951c4a76c842362393","observation_id":"fdac44e2-a150-4804-a1e9-8d350cc82580","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Notes on singular cardinal combinatorics","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:a91746c2b2a39f3677b1aba759401cbb057402c3b0815000dedbc5e4cf0a9b44","observation_id":"ccb361a7-c650-4229-bad3-389ca55c7f1e","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Iterated forcing and elementary embeddings","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:df5ea0c7cc2426aa14c2b338bb972888d8d568c13f6f52edc7e461fe5e251d49","observation_id":"120da0bb-7c18-4f0f-a0a8-9eb306d75bdd","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Games and general distributive laws in B oolean algebras","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:8522daf5039eb28165ed45361fa4226d6fffe16e48a2c2ccc4d1693b9b08b48f","observation_id":"12876f7a-7f08-48ba-9f33-6180026e5bc1","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"More ubiquitous undetermined games and other results on uncountable length games in B oolean algebras","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:3d164820006ef90756db15c05ac4b195b1edfc94a7c4d7adf3f8d96834f5e8fb","observation_id":"d4783e1f-dda7-441d-8043-11fa5a6205fe","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"-stationary subsets of, infinitary games, and distributive laws in B oolean algebras","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:c0cb837b4057929668742a999f87e49947cfc697d2f9a96aa9a70c3e3d83e80d","observation_id":"7dca7565-0f88-4283-b898-63e7ae4df852","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Successors of singular cardinals","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:b8993c5a915d35a72b1e72358ce293f122cd00fdac08dd8ea85430daa516fcac","observation_id":"18c1efaa-ce36-46b4-897c-fddbbc796289","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Martin's maximum, saturated ideals, and non-regular ultrafilers","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:0d08c2e0cee29e316b7a236878460e1ae6a8efb62e97e4fa42dfcf90e0eddc00","observation_id":"9a413b56-fff6-4826-911d-a831c8f456a8","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Games played on B oolean algebras","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:3b78668869800a85b0a4694728f039d4a2b10909e1cee5b1a025ebc69a649964","observation_id":"d752c606-4d23-4ae7-8ea7-dc1552023349","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Simultaneous stationary reflection and square sequences","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:d79411f72d8dbfa25a1e1e00221e4e24a76d4543cc99ec53c3606ab8d17f9934","observation_id":"69c2fd2f-8214-471e-8173-46c52bca6c0d","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Disjoint stationary sequences on an interval of cardinals","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:610811fabf8e89f18244f8c7d74a0ce2d996b628581cb730315c8da4097684f4","observation_id":"fc4c7ca2-5d31-4687-93b3-a8854530eff5","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Slender trees and the approximation property: H","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:9a158eb310d472d342aa431175c08e50fedafdc12cfbd2b090beca70c2411111","observation_id":"db79269d-ffbe-4ee1-963b-7bf9f89095cd","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"A game theoretic property of B oolean algebras","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:dc36a84c82cb8dce3a5f39179c056b16e185dcf601acd5f26f6916710a34ad57","observation_id":"ef388894-2569-4c8e-8e09-e0af1ceb0d98","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"More game-theoretic properties of B oolean algebras","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:7a25719c6843660706169d4c841f2db5492e09c72221d2f3dba494427beae4ce","observation_id":"8dc73bcc-d385-41b4-b7c0-a3da2e008717","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Set Theory","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:761787d03aed870f430434889f60454cf98e424809160b8260b1e411eff8fe13","observation_id":"97d1f20d-0495-4b15-89de-d1f43726281c","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Elementary arithmetic","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:2a9f62e1145cf1ff84d71680dbb7fad40d2cc9512d1c3d14c952e5072afe8f9a","observation_id":"eebe713c-bed1-49b3-9d75-eb06b8f0a0b2","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Set theory an introduction to independence proofs , volume 102","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:66ccf32f2f5c79518c3a7cbd8ab31237dae49cc71211bfa9f4c92f41a28bbf27","observation_id":"44456488-8b3e-48cf-baa4-f383faac3d8c","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Fragments of martin's maximum in generic extensions","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:cd06396070e18e9c7262a80fdfcf9479d2b8f871d0955e23bb6ea5eb764c3163","observation_id":"7bf097ff-d9a1-4dc9-b41c-812b76446a16","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Separating stationary reflection principles","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:946fd5f5395165763ad8c94ba4d24fe90c5eb82cf56a2d8f19defa87f5225fd5","observation_id":"82a91381-c219-4e50-9b82-c845a2cc4d07","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"On the strengths and weaknesses of weak squares","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:a2efa0ea13942966394b627d8d3f7e8fae925818e84f2196f083f51ad8d645d7","observation_id":"922291e5-e60c-4a4c-8ada-104eb6041557","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"A mathematical axiom contradicting the axiom of choice","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:4758da0f0f6bdcb73843fba43de4601929596cd697102547c6ac1d409d1741cb","observation_id":"134aba3e-389e-484f-a704-85cd8335203c","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"The determinacy of long games , volume 7","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:bf37e2dd7c57bfc57eee4bb8a0d4d857e5e6ed94e5fb890fed6b0f2ddacd8e24","observation_id":"de3ada67-0944-4d56-9e22-a402f15070a9","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Combinatorial principles in the core model for one W oodin cardinal","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:4eed398e0bdcf604a96e9b8c60ccc75cdedd10dee57e4c4f9b8cb932c71b778e","observation_id":"b84488bb-e99e-4603-b599-7fca2bb50e10","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Partitioning pairs of countable ordinals","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:d557933846b3f7cc106c7fa2a15725d0b80f1c519b12e105c91377f1406fbf7c","observation_id":"0c33879b-aff1-47d4-84d6-8ad399934a45","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Combinatorial analysis in infinite sets and some physical theories","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:a62ec77d5d0601d3e2f805ecf72e64274d6a7a3209614c67986da728a1437b51","observation_id":"a7868ab5-c63e-402d-bc63-37f22bdff620","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"Playful B oolean algebras","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:f515762527abd0e613f14fd1e4084b57ab6fedc9cf8013a9fbc13c16bea544c8","observation_id":"1a4ce659-b45c-4345-80b3-0f1b39a8b0ea","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","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-07-12T02:25:31.261856Z","title":"More on the cut and choose game","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-12T02:25:31.261856Z"},"links":{"citing_paper":"/paper/2607.03444"},"observation_digest":"sha256:561208f720e8246d9bf3af712aa0e6944e9e301288272e2bfc0271b5f713be65","observation_id":"e768ba2d-0c24-4a57-9629-6a06df60548f","resolution":{"observed_at":"2026-07-12T02:25:31.261856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03444","last_updated":"2026-07-03T15:56:26Z","latest_version":1,"primary_category":"math.LO","snapshot_observed_at":"2026-08-01T15:57:03.109368Z","submitted_at":"2026-07-03T15:56:26Z","title":"On Determinacy for Cut and Choose Games of Uncountable Length"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.03444."}