{"as_of":"2026-08-12T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2413ea0f7059b78930f2893b8cc09c902dda71ed10c59d6fd68cdf63c85cc71a","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:12:45.470550Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2509.10188/citation-record","integrity":"/paper/2509.10188/integrity","json":"/paper/2509.10188/citation-record.json","paper":"/paper/2509.10188"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:12:41.778582Z","title":"Aho, John E","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:41.778582Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:df1a828bb5a9357335ca05b1fe8436238081ad9741a445b33538dd7578a0ada0","observation_id":"756a7869-d5aa-41a2-8a5e-4f917f7afb7e","resolution":{"observed_at":"2026-08-04T18:12:41.778582Z","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-04T18:12:41.884286Z","title":"A circuit-based ap- proach to efficient enumeration","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:41.884286Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:03f57026d703ee7f655c3365f79354dfe2933cff3bcf11433f32d9a3b2bd23be","observation_id":"49acad91-ab9c-446d-bf10-dc442d2f8337","resolution":{"observed_at":"2026-08-04T18:12:41.884286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07728","last_updated":"2021-06-04T09:34:07Z","snapshot_observed_at":"2026-08-08T22:26:53.467063Z","submitted_at":"2021-02-15T18:25:48Z","title":"Dynamic Membership for Regular Languages","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07728","snapshot_observed_at":"2026-08-04T18:12:42.064412Z","title":"Dynamic membership for regular languages.CoRR, abs/2102.07728, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.064412Z"},"links":{"cited_paper":"/paper/2102.07728","citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:58f0acfa023cccad27b7cb172d88b7f81a90300cb02cce25b19613ea95e2d96c","observation_id":"f0d5482e-29d6-4b5e-9749-003508fad086","resolution":{"observed_at":"2026-08-04T18:12:42.064412Z","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-04T18:12:42.185987Z","title":"Static dictionaries on ac 0 rams: Query time theta(sqrt(log n/log log n)) is necessary and sufficient","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.185987Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:79af6490040836fd9c36ec93e6c2358fb46dd6f113f818eaa791855f323a91b8","observation_id":"b7a7fb4e-20ad-4a0a-a967-278ee32ce0b0","resolution":{"observed_at":"2026-08-04T18:12:42.185987Z","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-04T18:12:42.364403Z","title":"Fusion trees can be implemented with ac0 instructions only.Theor","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.364403Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:34937af4635bb1447d1d722a8a49a0c6a87f071d275ca31e1fd76a88a828cfc6","observation_id":"16487aaf-b255-48f5-8f5b-4047bc337f3a","resolution":{"observed_at":"2026-08-04T18:12:42.364403Z","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-04T18:12:42.495300Z","title":"On acyclic conjunctive queries and constant delay enumeration","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.495300Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:70a4863dae0e1cfc1a17d2947fe7f5c22c58c63e89324ba7fc036482ff89089f","observation_id":"8999c78d-3dbe-4ed2-aba0-fe6e01646401","resolution":{"observed_at":"2026-08-04T18:12:42.495300Z","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-04T18:12:42.577472Z","title":"Computing the jth solution of a first-order query.ITA, 42(1):147–164, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.577472Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:f65d3f49a93ce5afa855a94857ba7a71bfd226f56bc388035fa01bf3dd92899a","observation_id":"9ca308f4-c190-471c-a5f3-ffd7dd61c7b8","resolution":{"observed_at":"2026-08-04T18:12:42.577472Z","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-04T18:12:42.641431Z","title":"Constant delay enumeration for conjunctive queries: a tutorial.ACM SIGLOG News, 7(1):4–33, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.641431Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:44faa569da9c8238e02aa0f5f850ba6e10ad922d1dbad7674af57910c29af89d","observation_id":"0b54c6e6-38fa-45f7-833d-191ad63ef54f","resolution":{"observed_at":"2026-08-04T18:12:42.641431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1702.06370","last_updated":"2017-02-21T13:15:27Z","snapshot_observed_at":"2026-08-11T23:24:48.671069Z","submitted_at":"2017-02-21T13:15:27Z","title":"Answering Conjunctive Queries under Updates","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.06370","snapshot_observed_at":"2026-08-04T18:12:42.743675Z","title":"Answering conjunctive queries under updates.CoRR, abs/1702.06370, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.743675Z"},"links":{"cited_paper":"/paper/1702.06370","citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:8c2066f75ba2b57f5adc7fb98b0c865672b6aebf4b1007890aa1d14df17b7046","observation_id":"ead32efd-1209-4e78-9f6d-a88133dd3e32","resolution":{"observed_at":"2026-08-04T18:12:42.743675Z","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-04T18:12:42.828760Z","title":"Answering FO+MOD queries under updates on bounded degree databases.ACM Trans","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.828760Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:329c812c7ca8616a92059f2d56de9533f7ed80690aa1e6a4cd6e59cb9c9c05b0","observation_id":"39e2fd55-4373-4ded-ae91-e2c9d54c3740","resolution":{"observed_at":"2026-08-04T18:12:42.828760Z","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-04T18:12:42.924797Z","title":"Tight fine-grained bounds for direct access on join queries","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.924797Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:f7d5cae924ef5eaaf58cf362c0fad157c84df1ba271dd2945c4743be7beaf2f9","observation_id":"bdcecab3-a0ab-460a-ba59-8377a51782f7","resolution":{"observed_at":"2026-08-04T18:12:42.924797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.02401","last_updated":"2024-12-12T14:50:34Z","snapshot_observed_at":"2026-08-09T09:28:39.359429Z","submitted_at":"2022-01-07T11:22:44Z","title":"Tight Fine-Grained Bounds for Direct Access on Join Queries","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.02401","snapshot_observed_at":"2026-08-04T18:12:42.984222Z","title":"Tight fine-grained bounds for direct access on join queries.CoRR, abs/2201.02401, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:42.984222Z"},"links":{"cited_paper":"/paper/2201.02401","citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:aabb2f0a780a5a812ee23253536524b917ef3496b64c6d34ac551b49d51e605a","observation_id":"86789dcb-a9c0-4d77-be80-bf0c5c5da67f","resolution":{"observed_at":"2026-08-04T18:12:42.984222Z","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-04T18:12:43.076351Z","title":"Enumeration complexity of conjunctive queries with func- tional dependencies","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.076351Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:40d817db8c932c216014ec7c9f9c5d1872953894919b8e614f731f3835e75a63","observation_id":"277b5ec5-3030-42ea-ace4-3e6c7ada6c17","resolution":{"observed_at":"2026-08-04T18:12:43.076351Z","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-04T18:12:43.140489Z","title":"Tractable orders for direct access to ranked answers of conjunctive queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.140489Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:c50216b50713da37a1019f6e49f3fd705484ba1a22627c5d8dd142d5c66582c8","observation_id":"7c84c4d3-40ff-4c20-b3d2-aa1ded309928","resolution":{"observed_at":"2026-08-04T18:12:43.140489Z","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-04T18:12:43.211454Z","title":"Cook and Robert A","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.211454Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:e37c74c00c3a8b03d24b79247954e1b4acffc64a88ebcdf9132bb569bdb16345","observation_id":"090215d1-ddd3-48fe-be53-1cd0848be81f","resolution":{"observed_at":"2026-08-04T18:12:43.211454Z","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-04T18:12:43.310194Z","title":"Cormen, Charles E","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.310194Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:c11f90d50a391465aeae524baf27326a45be1e99ad30d95580e0f2c1dc7c2e64","observation_id":"8e1483aa-a8a3-4711-826b-f652658d5b90","resolution":{"observed_at":"2026-08-04T18:12:43.310194Z","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-04T18:12:43.392047Z","title":"A knowledge compilation map.J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.392047Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:ec723d8e74ff6cb6b55d18e33df748f27be6c43a878a3d77da3eeb2eb990d991","observation_id":"21e8ef49-4aa5-4403-af25-08aac743f174","resolution":{"observed_at":"2026-08-04T18:12:43.392047Z","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-04T18:12:43.478380Z","title":null,"venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.478380Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:430acbae5ec08169751e98def16bc05d3929c767de9fa26dc9c881392f4cedd7","observation_id":"48727351-e4e4-4cf9-aeea-2365b379b5c7","resolution":{"observed_at":"2026-08-04T18:12:43.478380Z","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-04T18:12:43.560701Z","title":"Dexter, Patrick Doyle, and Yuri Gurevich","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.560701Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:b3c29505dac30a9b61af235ec887734adf1aeb3a7dec44ce102c532614dcc9a0","observation_id":"2377a432-2f34-41b8-80f4-5baba01195db","resolution":{"observed_at":"2026-08-04T18:12:43.560701Z","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-04T18:12:43.662570Z","title":"Fine-grained complexity analysis of queries: From decision to counting and enumeration","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.662570Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:70ce04360a039a49f79bff24078d2332056d4775a117949c1b811e40185b8009","observation_id":"ce0bc0b4-028f-4607-afff-f088aeca05b5","resolution":{"observed_at":"2026-08-04T18:12:43.662570Z","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-04T18:12:43.744691Z","title":"First-order queries on structures of bounded degree are computable with constant delay.ACM Trans","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.744691Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:f718bd55c4f1e2205f8dfe0907e7292e71f6b1c5ad59d1f84803f77851ee0f4f","observation_id":"91616e07-0e02-413a-b0f7-cb69614e294d","resolution":{"observed_at":"2026-08-04T18:12:43.744691Z","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-04T18:12:43.788353Z","title":"Direct access for answers to conjunctive queries with aggregation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.788353Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:915842ea73f5252bebd06f829f5fe147159c68593b713e92a84d9b9a76495d4a","observation_id":"8a1eadd3-7de9-4f46-b8c6-1f65df9e8b11","resolution":{"observed_at":"2026-08-04T18:12:43.788353Z","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-04T18:12:43.833761Z","title":"Linear functional classes over cel- lular automata","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.833761Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:87d9acbc2709b349d8fa998dde2cdfb0aa85be4f6f9e892cc370026c218ef8d9","observation_id":"c2863319-efaf-4c6e-a951-098cdac8be22","resolution":{"observed_at":"2026-08-04T18:12:43.833761Z","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-04T18:12:43.898739Z","title":"Sorting, linear time and the satisfiability problem.Ann","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.898739Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:df4c05e672a33faf103fbe73c921f9a0f1734dcb23a954348458320e8b7bce0c","observation_id":"cbb83b0b-39f5-40a0-b219-bae571617c71","resolution":{"observed_at":"2026-08-04T18:12:43.898739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13851","last_updated":"2023-02-21T08:37:26Z","snapshot_observed_at":"2026-08-12T08:33:14.948495Z","submitted_at":"2022-06-28T09:30:08Z","title":"Which arithmetic operations can be performed in constant time in the RAM model with addition?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13851","snapshot_observed_at":"2026-08-04T18:12:43.961313Z","title":"Which arithmetic operations can be performed in constant time in the RAM model with addition?CoRR, abs/2206.13851, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:43.961313Z"},"links":{"cited_paper":"/paper/2206.13851","citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:13deca44c7d3fa799ed76ef926cdfc397f3abd85ecf957f13168f1a790315ea0","observation_id":"25e80e80-c220-4365-a6e6-70a391f749f6","resolution":{"observed_at":"2026-08-04T18:12:43.961313Z","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-04T18:12:44.054950Z","title":"Machine-independent characterizations and complete problems for deterministic linear time.SIAM J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.054950Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:ba3aaffe86ac8efbf4e4f7bcb3596c4a15397ca3e1f907aa248e069642e59fc2","observation_id":"72ccdd39-b55c-4d7a-a17d-3d5b34183085","resolution":{"observed_at":"2026-08-04T18:12:44.054950Z","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-04T18:12:44.125216Z","title":"Evolving algebras: an attempt to discover semantics","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.125216Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:ae9d3baec06d34b08264de0d24445fb2a632814abdcb8ab392006ac96456dbeb","observation_id":"9bc04c1c-50ef-46bb-88a2-e694733502f3","resolution":{"observed_at":"2026-08-04T18:12:44.125216Z","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-04T18:12:44.202874Z","title":"Pitman, 1984","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.202874Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:1a7757ac345613c8b251afa021790c19da01f64db12ad1099d4ec2591c444aca","observation_id":"b949103c-8bcf-4b4b-b93f-bf4e6ed84904","resolution":{"observed_at":"2026-08-04T18:12:44.202874Z","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-04T18:12:44.303657Z","title":"Johnson, Christos H","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.303657Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:a6d35fa89ee113f6fe22b2f6cb8426c1d4a233b717befea022da59380fd71745","observation_id":"45742995-8a68-4f0c-a421-0f7efa6d94ca","resolution":{"observed_at":"2026-08-04T18:12:44.303657Z","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-04T18:12:44.386805Z","title":"Knuth.The Art of Computer Programming, Volume II: Seminumerical Algo- rithms","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.386805Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:0bf816d1aa461dde7788f8bd21a9ac0ea751d75ed70311f61830d684f3aa9b8f","observation_id":"00171056-0afe-402c-847b-6919c045b72c","resolution":{"observed_at":"2026-08-04T18:12:44.386805Z","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-04T18:12:44.461040Z","title":"Compile! In Blai Bonet and Sven Koenig, editors,Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA, pages 4112–4118","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.461040Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:88771b39f23af649398507b12c8e42ab665456fab92ffb02998ced6003748da8","observation_id":"4e2d9b0a-616c-4d37-afb9-a77348b5853e","resolution":{"observed_at":"2026-08-04T18:12:44.461040Z","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-04T18:12:44.549868Z","title":"Papadimitriou.Computational complexity","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.549868Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:076383a8599898e83f8bf8a4ef99022ae7d95d03433e4cf53fe1ac9cde5ce611","observation_id":"d47c15d4-0b85-4e58-a3e3-b72206939bb4","resolution":{"observed_at":"2026-08-04T18:12:44.549868Z","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-04T18:12:44.624514Z","title":"Pope and Marvin L","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.624514Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:5c67aefa4bdab3ea85c96d52ccacb7b6a4881a4643beca7199df159d5ac0652a","observation_id":"58ac78ea-689b-45f5-a7e4-26beb974b3df","resolution":{"observed_at":"2026-08-04T18:12:44.624514Z","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-04T18:12:44.717699Z","title":"Springer, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.717699Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:b145aa3403b5bccf3f57182effaecd8b49d80e4641cf0f8a1bd3482004303e30","observation_id":"82a111ec-b4a1-4fe9-952f-f2f32ab62e37","resolution":{"observed_at":"2026-08-04T18:12:44.717699Z","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-04T18:12:44.810301Z","title":"Algebraic and logical characterizations of deterministic linear time classes","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.810301Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:6c10129f12a2a92f39fc4f2d2e279936de9ee09b6ced3e048f05f96dd2927a2a","observation_id":"7ff25841-d7bb-4f54-b9a8-d01b60c8fbbe","resolution":{"observed_at":"2026-08-04T18:12:44.810301Z","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-04T18:12:44.889932Z","title":"A glimpse on constant delay enumeration (invited talk)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.889932Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:5190cf9fcb04b0ef81e9bcde8d3e3e3f41fc98b3315ce499f07cc66975128022","observation_id":"ccc5f3e7-1e3c-4bee-adfa-19fa7edc7312","resolution":{"observed_at":"2026-08-04T18:12:44.889932Z","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-04T18:12:44.989144Z","title":"Shepherdson and Howard E","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:44.989144Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:4fd4e271c40ccf3dd06fdefb52007cfb90e3885d75355cf695660a21d6ef78c2","observation_id":"dfe18bfe-e086-4f50-82fa-c6b3d46b8e2e","resolution":{"observed_at":"2026-08-04T18:12:44.989144Z","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-04T18:12:45.049821Z","title":"Enumeration complexity.Bull","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.049821Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:2048ca97bd5020ab954e5cff068c76fdee17a77f945969c296ed419a5ade8ec2","observation_id":"dc6046be-3f28-4168-852f-2c61102ff301","resolution":{"observed_at":"2026-08-04T18:12:45.049821Z","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-04T18:12:45.123327Z","title":"Language recognition by cellular automata","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.123327Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:8f97f0acc6dcafd22bd069a5f27a55260d7a2da382521a84c2c9e491a33e2a4b","observation_id":"bc751fa3-4125-4735-b326-d3fef6570c80","resolution":{"observed_at":"2026-08-04T18:12:45.123327Z","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-04T18:12:45.198473Z","title":"On RAM priority queues.SIAM J","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.198473Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:287a475fadddafabdfaf7fa6bd4e960412bfbf4485a705ec2052f728346a398f","observation_id":"cb1427a9-c023-4fcc-951b-6893578c96a7","resolution":{"observed_at":"2026-08-04T18:12:45.198473Z","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-04T18:12:45.263216Z","title":"Ullman and Jennifer Widom.A First Course in Database Systems","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.263216Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:4d075027ed5010dba63500fedf22ed26cf374baebaadda47611be81d16aaf680","observation_id":"0394c7fa-f32a-4404-9287-fe22ba5f12ff","resolution":{"observed_at":"2026-08-04T18:12:45.263216Z","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-04T18:12:45.335273Z","title":"Constant time enumeration by amortization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.335273Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:c27558e25a64a4cd409dcc60d254425dfddc852fd79d20efa01d94ed051a88b3","observation_id":"abc4c423-5d09-46bd-a94d-e39f8fe0a52b","resolution":{"observed_at":"2026-08-04T18:12:45.335273Z","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-04T18:12:45.382059Z","title":"Texts in Theoretical Computer Science","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.382059Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:c2c048af6192d59bf293a7873a9877c75b60bd398dc215696c49163f682a480d","observation_id":"dced38e8-517c-432e-8c29-814546e66cbf","resolution":{"observed_at":"2026-08-04T18:12:45.382059Z","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-04T18:12:45.470550Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T18:12:45.470550Z"},"links":{"citing_paper":"/paper/2509.10188"},"observation_digest":"sha256:50f71f1bb361407a03ee63260715182252b950f8574850ea3fd6079b354ca811","observation_id":"9fd1246c-4a8b-45dc-96cb-976b9bc48b99","resolution":{"observed_at":"2026-08-04T18:12:45.470550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10188","last_updated":"2025-09-12T12:28:23Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T18:12:39.623528Z","submitted_at":"2025-09-12T12:28:23Z","title":"Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2509.10188."}