Paper Citation Record · LEDGER

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.10188 v1

Coverage vector

measured 44 of 44 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T18:12:45.470550Z

measured 44 of 44 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

44 of 44 outbound references displayed

verified exact0
verified fuzzy0
unresolved44
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 756a7869-d5aa-41a2-8a5e-4f917f7afb7e · outbound

This paper cites Aho, John E.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Aho, John E

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:41.778582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49acad91-ab9c-446d-bf10-dc442d2f8337 · outbound

This paper cites A circuit-based ap- proach to efficient enumeration.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class A circuit-based ap- proach to efficient enumeration

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:41.884286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0d5482e-29d6-4b5e-9749-003508fad086 · outbound

This paper cites Dynamic Membership for Regular Languages.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Dynamic Membership for Regular Languages

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.064412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7a7fb4e-20ad-4a0a-a967-278ee32ce0b0 · outbound

This paper cites Static dictionaries on ac 0 rams: Query time theta(sqrt(log n/log log n)) is necessary and sufficient.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Static dictionaries on ac 0 rams: Query time theta(sqrt(log n/log log n)) is necessary and sufficient

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.185987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16487aaf-b255-48f5-8f5b-4047bc337f3a · outbound

This paper cites Fusion trees can be implemented with ac0 instructions only.Theor.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Fusion trees can be implemented with ac0 instructions only.Theor

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.364403Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8999c78d-3dbe-4ed2-aba0-fe6e01646401 · outbound

This paper cites On acyclic conjunctive queries and constant delay enumeration.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class On acyclic conjunctive queries and constant delay enumeration

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.495300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ca308f4-c190-471c-a5f3-ffd7dd61c7b8 · outbound

This paper cites Computing the jth solution of a first-order query.ITA, 42(1):147–164, 2008.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Computing the jth solution of a first-order query.ITA, 42(1):147–164, 2008

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.577472Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b54c6e6-38fa-45f7-833d-191ad63ef54f · outbound

This paper cites Constant delay enumeration for conjunctive queries: a tutorial.ACM SIGLOG News, 7(1):4–33, 2020.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Constant delay enumeration for conjunctive queries: a tutorial.ACM SIGLOG News, 7(1):4–33, 2020

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.641431Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ead32efd-1209-4e78-9f6d-a88133dd3e32 · outbound

This paper cites Answering Conjunctive Queries under Updates.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Answering Conjunctive Queries under Updates

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.743675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 39e2fd55-4373-4ded-ae91-e2c9d54c3740 · outbound

This paper cites Answering FO+MOD queries under updates on bounded degree databases.ACM Trans.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Answering FO+MOD queries under updates on bounded degree databases.ACM Trans

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.828760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bdcecab3-a0ab-460a-ba59-8377a51782f7 · outbound

This paper cites Tight fine-grained bounds for direct access on join queries.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Tight fine-grained bounds for direct access on join queries

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.924797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 86789dcb-a9c0-4d77-be80-bf0c5c5da67f · outbound

This paper cites Tight Fine-Grained Bounds for Direct Access on Join Queries.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Tight Fine-Grained Bounds for Direct Access on Join Queries

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:42.984222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 277b5ec5-3030-42ea-ace4-3e6c7ada6c17 · outbound

This paper cites Enumeration complexity of conjunctive queries with func- tional dependencies.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Enumeration complexity of conjunctive queries with func- tional dependencies

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.076351Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c84c4d3-40ff-4c20-b3d2-aa1ded309928 · outbound

This paper cites Tractable orders for direct access to ranked answers of conjunctive queries.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Tractable orders for direct access to ranked answers of conjunctive queries

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.140489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 090215d1-ddd3-48fe-be53-1cd0848be81f · outbound

This paper cites Cook and Robert A.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Cook and Robert A

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.211454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e1483aa-a8a3-4711-826b-f652658d5b90 · outbound

This paper cites Cormen, Charles E.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Cormen, Charles E

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.310194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 21e8ef49-4aa5-4403-af25-08aac743f174 · outbound

This paper cites A knowledge compilation map.J.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class A knowledge compilation map.J

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.392047Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48727351-e4e4-4cf9-aeea-2365b379b5c7 · outbound

This paper cites an unresolved cited work.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.478380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2377a432-2f34-41b8-80f4-5baba01195db · outbound

This paper cites Dexter, Patrick Doyle, and Yuri Gurevich.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Dexter, Patrick Doyle, and Yuri Gurevich

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.560701Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce0bc0b4-028f-4607-afff-f088aeca05b5 · outbound

This paper cites Fine-grained complexity analysis of queries: From decision to counting and enumeration.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Fine-grained complexity analysis of queries: From decision to counting and enumeration

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.662570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91616e07-0e02-413a-b0f7-cb69614e294d · outbound

This paper cites First-order queries on structures of bounded degree are computable with constant delay.ACM Trans.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class First-order queries on structures of bounded degree are computable with constant delay.ACM Trans

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.744691Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a1eadd3-7de9-4f46-b8c6-1f65df9e8b11 · outbound

This paper cites Direct access for answers to conjunctive queries with aggregation.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Direct access for answers to conjunctive queries with aggregation

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.788353Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2863319-efaf-4c6e-a951-098cdac8be22 · outbound

This paper cites Linear functional classes over cel- lular automata.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Linear functional classes over cel- lular automata

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.833761Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbb83b0b-39f5-40a0-b219-bae571617c71 · outbound

This paper cites Sorting, linear time and the satisfiability problem.Ann.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Sorting, linear time and the satisfiability problem.Ann

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.898739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25e80e80-c220-4365-a6e6-70a391f749f6 · outbound

This paper cites Which arithmetic operations can be performed in constant time in the RAM model with addition?.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Which arithmetic operations can be performed in constant time in the RAM model with addition?

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:43.961313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72ccdd39-b55c-4d7a-a17d-3d5b34183085 · outbound

This paper cites Machine-independent characterizations and complete problems for deterministic linear time.SIAM J.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Machine-independent characterizations and complete problems for deterministic linear time.SIAM J

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.054950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9bc04c1c-50ef-46bb-88a2-e694733502f3 · outbound

This paper cites Evolving algebras: an attempt to discover semantics.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Evolving algebras: an attempt to discover semantics

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.125216Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b949103c-8bcf-4b4b-b93f-bf4e6ed84904 · outbound

This paper cites Pitman, 1984.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Pitman, 1984

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.202874Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45742995-8a68-4f0c-a421-0f7efa6d94ca · outbound

This paper cites Johnson, Christos H.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Johnson, Christos H

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.303657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00171056-0afe-402c-847b-6919c045b72c · outbound

This paper cites Knuth.The Art of Computer Programming, Volume II: Seminumerical Algo- rithms.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Knuth.The Art of Computer Programming, Volume II: Seminumerical Algo- rithms

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.386805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e2d9b0a-616c-4d37-afb9-a77348b5853e · outbound

This paper cites 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.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class 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

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.461040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d47c15d4-0b85-4e58-a3e3-b72206939bb4 · outbound

This paper cites Papadimitriou.Computational complexity.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Papadimitriou.Computational complexity

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.549868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 58ac78ea-689b-45f5-a7e4-26beb974b3df · outbound

This paper cites Pope and Marvin L.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Pope and Marvin L

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.624514Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82a111ec-b4a1-4fe9-952f-f2f32ab62e37 · outbound

This paper cites Springer, 2019.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Springer, 2019

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.717699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7ff25841-d7bb-4f54-b9a8-d01b60c8fbbe · outbound

This paper cites Algebraic and logical characterizations of deterministic linear time classes.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Algebraic and logical characterizations of deterministic linear time classes

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.810301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ccc5f3e7-1e3c-4bee-adfa-19fa7edc7312 · outbound

This paper cites A glimpse on constant delay enumeration (invited talk).

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class A glimpse on constant delay enumeration (invited talk)

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.889932Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dfe18bfe-e086-4f50-82fa-c6b3d46b8e2e · outbound

This paper cites Shepherdson and Howard E.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Shepherdson and Howard E

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:44.989144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc6046be-3f28-4168-852f-2c61102ff301 · outbound

This paper cites Enumeration complexity.Bull.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Enumeration complexity.Bull

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.049821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc751fa3-4125-4735-b326-d3fef6570c80 · outbound

This paper cites Language recognition by cellular automata.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Language recognition by cellular automata

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.123327Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb1427a9-c023-4fcc-951b-6893578c96a7 · outbound

This paper cites On RAM priority queues.SIAM J.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class On RAM priority queues.SIAM J

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.198473Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0394c7fa-f32a-4404-9287-fe22ba5f12ff · outbound

This paper cites Ullman and Jennifer Widom.A First Course in Database Systems.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Ullman and Jennifer Widom.A First Course in Database Systems

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.263216Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation abc4c423-5d09-46bd-a94d-e39f8fe0a52b · outbound

This paper cites Constant time enumeration by amortization.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Constant time enumeration by amortization

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.335273Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dced38e8-517c-432e-8c29-814546e66cbf · outbound

This paper cites Texts in Theoretical Computer Science.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Texts in Theoretical Computer Science

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.382059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fd1246c-4a8b-45dc-96cb-976b9bc48b99 · outbound

This paper cites an unresolved cited work.

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class Unresolved cited work

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-04T18:12:45.470550Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.