{"as_of":"2026-08-13T07:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:affa410882ceaec85001eed653aaa7b7179787d94aa603081c73174b22748c88","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:43:03.782070Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.14067/citation-record","integrity":"/paper/2411.14067/integrity","json":"/paper/2411.14067/citation-record.json","paper":"/paper/2411.14067"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:03.687276Z","title":"Transformational design an d implementation of a new efficient solution to the ready sim- ulation problem","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.687276Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:406bc4234cbe4ff95fc8262d8122cb2295374032a6df57700bb94dccf0a9e972","observation_id":"547994a6-67ef-4e18-b7ac-67738377b30c","resolution":{"observed_at":"2026-08-12T15:43:03.687276Z","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":"5499.63550","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:04.231030Z","title":"Simulation-based minim azation","venue":null,"work_id":"d85e904a-e2f6-4510-a651-ce749a738366","year":2003},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.692445Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:2f60d98d1196f7e0ed2679214298c8a74256583d6440a7282a223ef016e8dbc4","observation_id":"d6a10fba-4170-46ef-8c13-f50081d294e1","resolution":{"observed_at":"2026-08-12T15:43:04.238818Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:04.332480Z","title":"Saving space in a time efficient simulation algorithm","venue":null,"work_id":"6f896452-6605-43b2-bb61-76494408bc44","year":null},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.696691Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:840a3034cf8bea5cd9837137d860d9319449fdce4cac12d151620338e86762ff","observation_id":"bc43c097-7b19-4ae2-ae18-bc195305e6bd","resolution":{"observed_at":"2026-08-12T15:43:04.336984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:03.705929Z","title":"On the fine grained com- plexity of finite automata non-emptiness of intersection","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.705929Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:3fb1e4ff913e2cc7c6ba20ea8bef464d09d37ec91bf594147481ead57957a2a5","observation_id":"f296ea69-ead9-463d-83f8-e88cefcea144","resolution":{"observed_at":"2026-08-12T15:43:03.705929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:04.318911Z","title":"Problems on finite auto mata and the exponential time hypothesis","venue":null,"work_id":"908e3414-39aa-4ba1-bc9f-423e64a26e98","year":2017},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.711032Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:2567a3a216bedc9b6ca756349ee191bcddc808fe35195a427efc8dffbfd47791","observation_id":"37ed064a-ac67-47b1-8946-bd8dff4501ec","resolution":{"observed_at":"2026-08-12T15:43:04.323370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:03.715648Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.715648Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:d9dc0b5406a05b5b64b74d017b6066cd092286abfe2b0708fe9f78ea679158cb","observation_id":"198a27ae-cc3e-4c4d-a756-caa8c54da47c","resolution":{"observed_at":"2026-08-12T15:43:03.715648Z","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-12T15:43:03.720860Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.720860Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:60ad0db705f5a6187baa0fe276795b81afc6db224d188c4527b900c54854a6e5","observation_id":"812be3c8-1a23-4430-845b-9222e6fdd07b","resolution":{"observed_at":"2026-08-12T15:43:03.720860Z","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":"1995.49257","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:04.129186Z","title":"Henzinger, and Peter W","venue":null,"work_id":"de6d0e63-b692-46af-80fe-f57e418a0a3f","year":1995},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.725262Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:bb9e56a5299d939e79e687ae6d04ae77eb78c76b0503b35d310221ce8f9f67c7","observation_id":"be5d107a-2d74-4015-9b3c-267a142b2dc9","resolution":{"observed_at":"2026-08-12T15:43:04.136343Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:04.304935Z","title":"Hopcroft and Richard M","venue":null,"work_id":"47e4ecfe-bc38-4017-8b03-772c1c1b0426","year":1971},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.729611Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:6fb9bb66002dd0736c540e521ad425dc7cc6fecde9f2f993e6041a620919b7d8","observation_id":"d0d40e7f-71f3-4e27-a75a-cad569341e50","resolution":{"observed_at":"2026-08-12T15:43:04.309751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:03.733994Z","title":"On the compl ex- ity of k-SAT","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.733994Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:2c10a810bda6ba7d4cf91b807dae940ea2ccf4fd7e9a0104d4a6ad1b21c7f19b","observation_id":"57d9398e-ad51-48e6-ad7f-f8ff63417891","resolution":{"observed_at":"2026-08-12T15:43:03.733994Z","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-12T15:43:03.738340Z","title":"Lower bounds for natural proof systems","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.738340Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:edfe3bc7722fedba4be6156f7b68ec6ff3c511bcf496b6968987ae68cbae4a92","observation_id":"148faae0-19bb-4858-b67c-271b5ee95cb4","resolution":{"observed_at":"2026-08-12T15:43:03.738340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:04.291444Z","title":null,"venue":null,"work_id":"22175bba-1050-41ea-a7e0-484649f9c378","year":2002},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.743005Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:a7fcf9928d884a7b51787bb222b92680395ab4f130737e7ad9032ee46c155f5e","observation_id":"514fff24-48b4-423d-8da2-f490bb56ad3b","resolution":{"observed_at":"2026-08-12T15:43:04.295646Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:04.277339Z","title":"An algebraic definition of simulation bet ween pro- grams","venue":null,"work_id":"48946f0d-8fab-45b7-9242-6b2497d707e3","year":1971},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.752500Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:fcf9cf35a8e3b69722df78f8dba47de3c0f3783e551456e774bcc4568ee6fa7d","observation_id":"b562e89d-1a58-4e53-af82-c554ef3fa788","resolution":{"observed_at":"2026-08-12T15:43:04.281694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:04.263605Z","title":"An efficient simulation algorithm on kripke structures","venue":null,"work_id":"de677f71-2d56-4504-aeee-b06b197681a0","year":null},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.756860Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:11f8e958159ba3b0887fc5942154e676e38af99bbd8e6100f4272d7a401cd8f2","observation_id":"a98bc085-e608-4bd1-bae4-012a330848af","resolution":{"observed_at":"2026-08-12T15:43:04.268001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:03.765477Z","title":"A new efficient simulation equivalence algorithm","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.765477Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:7edaed81d4f5ea4d42251cb254b591458132662e281f86655305ad712259961e","observation_id":"b200af4f-5750-411c-9737-45c5b9cd67be","resolution":{"observed_at":"2026-08-12T15:43:03.765477Z","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-12T15:43:03.769604Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.769604Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:99c92a79cde6187517afab7b1590bdefced349e987a4b4ffc0916861d8f38623","observation_id":"c79501fb-94bb-4c76-9f96-597e8ebaa9c0","resolution":{"observed_at":"2026-08-12T15:43:03.769604Z","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.1007/978-3-540-70545-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:03.821699Z","title":"van Glabbeek and Bas Ploeger","venue":null,"work_id":"78cdf3dd-4c33-499f-aa4c-5e476773a34e","year":2008},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.773760Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:a61e346f49098c00a0df784f08a7356d7d0eb516a40d3f3e1713e5e4c0434a2d","observation_id":"b78a07ef-210e-42c9-8e58-d73270b1ef5c","resolution":{"observed_at":"2026-08-12T15:43:03.827053Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T15:43:03.777850Z","title":"Hardness of Easy Probl ems: Basing Hard- ness on Popular Conjectures such as the Strong Exponential T ime Hypoth- esis","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.777850Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:225702bc3d60a8c352a669b1848900f90c8fa1a82c1dca99e386e231fa0105f0","observation_id":"bbbaac80-e91b-4c87-92f6-b9ede0085dfc","resolution":{"observed_at":"2026-08-12T15:43:03.777850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:04.248092Z","title":"On the complexity of intersection non-emptiness problems","venue":null,"work_id":"e5422d96-eab4-4a02-aef4-a30e30e6f1d3","year":2016},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.782070Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:3c7df81e646fdb462be5045f99999559e66ed8dab7c8e521ad56f785b19e9cbf","observation_id":"6760f89a-217f-4a29-ad9d-533cf689a3c8","resolution":{"observed_at":"2026-08-12T15:43:04.253939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45694-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:03.858942Z","title":null,"venue":null,"work_id":"7af902a7-d0c7-4ace-96a3-1484d43eb2a4","year":null},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.747931Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:fe55a71540f4916e40c0a3c2f76b51176728fd39faac4d802b13faa247c2a371","observation_id":"b41b6056-30c3-4f8a-bd6c-48444d3fac98","resolution":{"observed_at":"2026-08-12T15:43:03.863701Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/fi-2011-412","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:03.907357Z","title":null,"venue":null,"work_id":"29b0f2d0-7e4e-46f1-87c7-2fa56b4599a5","year":2011},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.701091Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:246506758d50b6af8292255356101548366fa4dfd6af96d533e9c726a1b6ca0a","observation_id":"88da9f27-bce8-422e-a116-afc4b28ae5b7","resolution":{"observed_at":"2026-08-12T15:43:03.911524Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00236-014-0195-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:43:03.844955Z","title":null,"venue":null,"work_id":"ce03833f-d836-40d9-a723-f08d5b5585e1","year":null},"citing_paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-12T15:43:03.761145Z"},"links":{"citing_paper":"/paper/2411.14067"},"observation_digest":"sha256:1dda0a31441bfefd7d214e401db0fe2cae40c7325ad2e61b3ab394de7cb6dbcd","observation_id":"8f0a78ee-4384-4b45-98b2-3c70524a1dae","resolution":{"observed_at":"2026-08-12T15:43:03.849403Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.14067","last_updated":"2024-11-21T12:30:51Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-12T15:32:09.006635Z","submitted_at":"2024-11-21T12:30:51Z","title":"A Quadratic Lower Bound for Simulation"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":10,"verified_exact":4,"verified_fuzzy":6},"total_outbound_references":22},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2411.14067."}