{"as_of":"2026-08-17T02:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d18aeca102e9386696361bf6242a22f9bf0b0758c4cbef043df5fbffe317e9b1","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:27:03.737886Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03509/citation-record","integrity":"/paper/1908.03509/integrity","json":"/paper/1908.03509/citation-record.json","paper":"/paper/1908.03509"},"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-14T14:27:04.132698Z","title":null,"venue":null,"work_id":"141fe452-f76e-407e-8da8-128a4d9b16c0","year":1987},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.609162Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:682af1be4cf326f8eeb738be5238d08d1ff725f675414a5b6fec72054d045335","observation_id":"b6c8d1fa-b1f5-4b0a-889b-4c7a5420da4b","resolution":{"observed_at":"2026-08-14T14:27:04.136514Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.121851Z","title":null,"venue":null,"work_id":"b7af13a5-3936-4576-a63c-b962efec7cc0","year":1981},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.613843Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:7ecf808e8704a57e573656998db44153114b714be240f98d045350ae4ffde54f","observation_id":"eefc75ac-48d0-4c0f-b960-9011f2d30996","resolution":{"observed_at":"2026-08-14T14:27:04.125392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.111644Z","title":null,"venue":null,"work_id":"56468a0a-794b-4081-bf82-2738fda3938b","year":1976},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.617863Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:a29ee14a3f35cbfc67c73bd12061a44582c770dd3b03763acff0bbaedb0d5d7e","observation_id":"9a17224f-3a58-4e8b-a08a-a1a7ed1922af","resolution":{"observed_at":"2026-08-14T14:27:04.115105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.101153Z","title":null,"venue":null,"work_id":"083e6377-da9b-4d3c-ae52-d3eec17967fb","year":1999},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.621598Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:c8b0c2c7cf6ec4bf2c99a52b8ca68c49d667bdd9b2e61254f2354e7f33a59771","observation_id":"88beadb4-c361-4a1b-a9ba-92e2861ff92b","resolution":{"observed_at":"2026-08-14T14:27:04.104871Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.091414Z","title":"Dabrowski, L","venue":null,"work_id":"89594aac-5027-487c-81a5-e26c6230cb67","year":1996},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.626094Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:dc7233cf095cbb97d29de42ed9f9e6ea35ebdbfcafb2a90ce4a126322a30e8ca","observation_id":"3a05b98a-6393-45c8-9513-56a400e27490","resolution":{"observed_at":"2026-08-14T14:27:04.094796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.081204Z","title":"Heinemann","venue":null,"work_id":"572b7047-ef46-4a69-959f-0bfe2fb7222c","year":2016},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.630347Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:eb3d16ad168998346f73d1b7f16792a5a32c7aae55a1aaf424cbddadf21096ed","observation_id":"4736bb7e-feb3-4414-ae3b-c77921844c2d","resolution":{"observed_at":"2026-08-14T14:27:04.084952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.070443Z","title":"Heinemann","venue":null,"work_id":"6aeb2c75-fd3a-4b8e-bf6c-fd8ea097de1b","year":2016},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.634854Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:4495be0924e3ff2d6bba04755e3620d83ead546ecf2da9e7765b253ccb388a96","observation_id":"d28bbc7c-e7a7-406e-aff1-f1368cd40a7e","resolution":{"observed_at":"2026-08-14T14:27:04.074083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.059422Z","title":"Hertling and G","venue":null,"work_id":"03fa3934-4b7d-4706-9925-8386dc2193a1","year":2019},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.638546Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:ba9aee9ddd12606f10087c7a45b0e0efc7038386d18eb1590efc8a7ea9576fdb","observation_id":"7d04760c-9301-4f2f-8561-835264492b89","resolution":{"observed_at":"2026-08-14T14:27:04.062917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.049243Z","title":null,"venue":null,"work_id":"d006161c-faaa-43bd-a6a0-1f6eb26ecbb9","year":1988},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.642220Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:d01d616722aa6d5a50425ec0c9467cecaf606bba4b8355f1315c82e9e17efa84","observation_id":"60763da2-70c1-472f-a2bd-ce8d91ba6fb2","resolution":{"observed_at":"2026-08-14T14:27:04.052769Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.038821Z","title":null,"venue":null,"work_id":"1d2e1239-9fd6-4bc8-9cf5-13de1f97fa95","year":1976},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.645748Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:4622272284bf5f6b0e18cd4f95d018088996c023de5e40b1e5c04c5d01ba3bf6","observation_id":"e456e1e7-fbba-4326-a4e0-30a81a4f7541","resolution":{"observed_at":"2026-08-14T14:27:04.042402Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.028668Z","title":null,"venue":null,"work_id":"f23e94ea-acc7-4bbc-9028-42771ca2e5fb","year":2003},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.650906Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:f0b0017d760b630f418742c3ccb372b7273aebc1881f3469f90ab1dc2eaca748","observation_id":"15f6692f-817c-48bc-b5e6-f25eb27b19f5","resolution":{"observed_at":"2026-08-14T14:27:04.032241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.017217Z","title":null,"venue":null,"work_id":"665f094b-d2b5-404f-9d27-ba4254cc9e24","year":2003},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.655145Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:845f4739c9312829c6194c3018f257f83a34848d8ccc8c986cb5bf82fedbf883","observation_id":"e33f879e-e3bf-4eec-a24c-9abcc42966d7","resolution":{"observed_at":"2026-08-14T14:27:04.021314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:04.007413Z","title":"Kurucz, F","venue":null,"work_id":"3bd8330e-210f-4276-9f44-3cc1b04fbcb3","year":2003},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.659423Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:2e0cc6c74fa7397dfb3ff98fc337c98188c692025ddec94a7a2f4c1999d6883d","observation_id":"4fa05b4e-d6fa-4d4f-a952-c20c15022dd1","resolution":{"observed_at":"2026-08-14T14:27:04.011222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.996910Z","title":"Lange and C","venue":null,"work_id":"ef5781d4-6692-4ba5-825f-f34aa044e3d7","year":2005},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.663977Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:19e502808cfe07bae3af3baaa4001624b2ea63d1af47aeab198b6d1f51be76ad","observation_id":"bdf74bb5-1363-4aac-8b42-03ae59debefe","resolution":{"observed_at":"2026-08-14T14:27:04.000767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.986037Z","title":null,"venue":null,"work_id":"efd67428-4da9-455f-ae0e-e0047f7ceec4","year":1999},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.667484Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:12b0c3b75263bbe642de03f9b2b6733dd5d6a83cc7e29a5d0b9a9c40b330dbc4","observation_id":"c52e3a21-1489-4262-b720-2a5d02701c13","resolution":{"observed_at":"2026-08-14T14:27:03.989689Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.975352Z","title":null,"venue":null,"work_id":"149a6618-f17f-4443-9a64-7354778577c9","year":1994},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.670963Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:3d13a3be70690f5b9f7420295bc807af5964fd3a2c64a77a0666e3eeb6ad5062","observation_id":"69954da4-0488-47fc-ac42-9151482639a9","resolution":{"observed_at":"2026-08-14T14:27:03.979050Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.965021Z","title":"Parikh, L","venue":null,"work_id":"c6968c4e-c691-453c-b4b2-5d448809ad51","year":2007},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.674456Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:fa4df5804e332d455ca8642e4447c55439e5d376cea1f895928bc5417891e8d0","observation_id":"3e7ebd9d-70dd-49c5-b3b9-4ab85c8c18bf","resolution":{"observed_at":"2026-08-14T14:27:03.968956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.952708Z","title":"shared variables","venue":null,"work_id":"c7caf814-da5c-4837-985b-d6d0ee7e3759","year":1980},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.678515Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:c66a5f936f9dd202287c5a85ebf1f633a6a3f2cf001fd01934b043387ec32ff9","observation_id":"b0e4a1ec-6554-4d8d-90e3-c0218e0b0638","resolution":{"observed_at":"2026-08-14T14:27:03.956913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.941468Z","title":null,"venue":null,"work_id":"7b9bdeb8-8427-4342-9641-a545c47b5366","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.682425Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:d02ad19927331dec5e9393b45111d6fec8f54e7edbe2eb8b47d83508588afdda","observation_id":"ebf7d1ab-c267-4da9-9aee-508db5dadcdb","resolution":{"observed_at":"2026-08-14T14:27:03.945400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.927943Z","title":"Note that the value ofX is copied fromp′ i to its ♦ →-successorpi+1 because by the formula persistent(X) we force the vectorX of propositional variables to be persistent","venue":null,"work_id":"da3e5c0e-287a-4e73-ae1a-8ac550db6804","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.686248Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:5b8241732a1ca5296e0da7732f8e7c2e4abb52842d745bff6368a447d2bfa3d4","observation_id":"fb1bd509-6460-4d9f-8a5c-ed2a58bb9811","resolution":{"observed_at":"2026-08-14T14:27:03.932811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.915879Z","title":null,"venue":null,"work_id":"37326c63-5692-4a0f-b37f-7193bbf83b34","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.690642Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:f192417fcefc0915b78d8fffca3dfd44d12a0bd5555682388f7d68bcc1fb3378","observation_id":"8ed8394e-a37e-4c91-ba54-ee4a29610679","resolution":{"observed_at":"2026-08-14T14:27:03.919465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.903991Z","title":"We define an S4-frame(W1,R ♦) by W1 :={0,..., 2n− 1} and, fori,i′∈W1, iR♦i′ :⇐⇒ i≤i′","venue":null,"work_id":"485e6f0b-c7a0-45b0-8641-4bd36f660fa1","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.694668Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:553a7109a62f24328c558a92a63b874f660fd4de76cf18e41820f64f7d1316b3","observation_id":"5d191d34-f38d-4f1a-b7f1-f607dd7ae147","resolution":{"observed_at":"2026-08-14T14:27:03.907785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.892398Z","title":"staircase","venue":null,"work_id":"8e003392-9ca9-479e-90d2-b42bce6cd3d4","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.698697Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:3856be8fb5d1a60a1ad421aee9877547b90b370c534c296a59ad7dbee08e2a27","observation_id":"efc4f3b7-0dd2-4990-81ea-00e92ee66227","resolution":{"observed_at":"2026-08-14T14:27:03.896023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.880732Z","title":null,"venue":null,"work_id":"d637ff04-a915-4f8a-8437-971247634079","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.703714Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:0e58b1d3773390a075e368b3935eb81c8f115261c121ff4cba349df065bd6730","observation_id":"40c87fb8-22ff-490d-b545-57ad7db796d1","resolution":{"observed_at":"2026-08-14T14:27:03.884458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.868569Z","title":"can be mapped to","venue":null,"work_id":"c021db1d-fd14-4fac-875d-70b5a526872f","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.707746Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:8ea246bdc1e597daf925aa9be9618f4db00515e85b2d84c9e50364bfa47f4a37","observation_id":"ee393f9b-c58e-4036-9ac0-f9e3f0b747fa","resolution":{"observed_at":"2026-08-14T14:27:03.872589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.857099Z","title":"So, we shall assume thatr1 ♦ →x, for allv∈W1, andRL =W2×W2","venue":null,"work_id":"4e518b0e-9ba3-44d1-a8ec-bae3c4716d72","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.712104Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:a74c0a07d96ae8965adbcb390848c8d727b16601bda7c9d05eaea0f12625bf94","observation_id":"c9aee480-0832-4917-a9bb-57db1d5ab08d","resolution":{"observed_at":"2026-08-14T14:27:03.861023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.845804Z","title":"2.{(π(v),π (v′)) : v,v′∈V and vEv′}⊆ R♦","venue":null,"work_id":"44ea55e1-374d-48aa-884e-9d5099dd55aa","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.716348Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:5e7a671e1df2e38fa66dc3b548ccfbf7ad34a8ea19373938c55358e8cbde0fe4","observation_id":"7b775f9c-d060-4a93-9eb6-8233590a6ab2","resolution":{"observed_at":"2026-08-14T14:27:03.849604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.832991Z","title":"A Reduction of ATMs Working in Exponential Time to S4× S5 72","venue":null,"work_id":"a0e5dfc3-84e2-468c-a226-1d7360d27b7f","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.720470Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:e2418d70e2092bfdfb3f4d34817abdfdea891d8abea5997562391bb5c92191e3","observation_id":"1c1c1056-25a3-4dfa-bff2-1dd1cf9a9850","resolution":{"observed_at":"2026-08-14T14:27:03.838143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.821750Z","title":"partial tree ofM on inputw","venue":null,"work_id":"1e32d940-ee22-4b4e-9a0c-eb592af91b15","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.724098Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:142bab2a21a6c0a521ac1e9f354c39dd11484b5ac896b96179637edf4bfac916","observation_id":"e7a43fb8-dad2-47a9-93bb-1178d138922e","resolution":{"observed_at":"2026-08-14T14:27:03.825400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.810178Z","title":null,"venue":null,"work_id":"ec73cade-7fef-460f-b2ee-6c98341d244d","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.727708Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:a6e4aec1a0274f927149bcf0c4495f5b3676dc9089ae81d63d45c8d517a3bcc0","observation_id":"9c969b4f-fae0-40dd-abaa-91fec108f2b4","resolution":{"observed_at":"2026-08-14T14:27:03.814390Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.796715Z","title":"So, the second condition is satisfied","venue":null,"work_id":"4e7b131b-c162-4a76-971a-2a68f7c563ff","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.731134Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:043c0c0607c6f338b6200f4356d4c09d1a6dc8d1362e9f9c4b762f0bd4b3c2ff","observation_id":"6bbc4635-f677-433f-9608-efd70de49d92","resolution":{"observed_at":"2026-08-14T14:27:03.801326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.785051Z","title":null,"venue":null,"work_id":"2e758f16-6daa-4772-9c58-26c85afa5f69","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.734551Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:d3329af0c624c3916a320ee394d6a3adf5214f3bd42b00b3305509422b5b346c","observation_id":"a0daa93f-ad7b-4633-8053-588e4fc7acc0","resolution":{"observed_at":"2026-08-14T14:27:03.789212Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T14:27:03.770947Z","title":"a partial tree ofM on inputw","venue":null,"work_id":"0c77f3e0-1693-4704-8caa-bca397646e45","year":null},"citing_paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:27:03.737886Z"},"links":{"citing_paper":"/paper/1908.03509"},"observation_digest":"sha256:30e1bcafad92059463256138f57010ff646f39de4729efcdff449236164205d2","observation_id":"e11118c3-f613-430d-912f-62b8d0fa04fd","resolution":{"observed_at":"2026-08-14T14:27:03.776836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03509","last_updated":"2019-08-09T15:57:36Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-16T15:50:43.574033Z","submitted_at":"2019-08-09T15:57:36Z","title":"EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":33},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:1908.03509."}