Paper Citation Record · LEDGER

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption

As of 12 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2606.04257.

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

pith.paper-citation-record.v1
2606.04257 v2

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T12:32:39.756566Z

measured 30 of 30 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

30 of 30 outbound references displayed

verified exact0
verified fuzzy0
unresolved30
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 73c3d7d4-e6be-4ed1-81e4-b6af4593d265 · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.100634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd71eabd-d678-4e39-b4ca-a506d51003fc · outbound

This paper cites 1, 2:1–2:54.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 1, 2:1–2:54

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.184797Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fac7c37-5d52-439f-8660-6a5de6fe9512 · outbound

This paper cites Comput.35(2006), no.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Comput.35(2006), no

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.272438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a56b098b-21e1-42e3-8431-3de3a8d9d3e1 · outbound

This paper cites Oliveira,Consistency of circuit lower bounds with bounded theories, Logical Methods in Computer Science16(2020), no.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Oliveira,Consistency of circuit lower bounds with bounded theories, Logical Methods in Computer Science16(2020), no

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.393459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 81723992-0361-4c37-8257-438b5f3e7442 · outbound

This paper cites Chaitin,Information-theoretic limitations of formal systems, JACM 21(1974), no.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Chaitin,Information-theoretic limitations of formal systems, JACM 21(1974), no

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.481087Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 809f13f8-dfa1-41f3-a47c-ed3f05c47cb2 · outbound

This paper cites Oliveira,Reverse mathematics of complexity lower bounds, SIAM Journal on Computing (2024), To appear; preprint 2024.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Oliveira,Reverse mathematics of complexity lower bounds, SIAM Journal on Computing (2024), To appear; preprint 2024

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.579631Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da8fc957-90ad-4f8f-a494-d8db11c99a01 · outbound

This paper cites Cook and Jan Kraj ´ ıˇ cek,Consequences of the provability of NP⊆P/poly, Journal of Symbolic Logic72(2007), no.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Cook and Jan Kraj ´ ıˇ cek,Consequences of the provability of NP⊆P/poly, Journal of Symbolic Logic72(2007), no

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.640848Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c0d2e9c-a417-4a81-985a-b23ad8182de0 · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.739091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5df0e5ad-c91e-4f64-a44b-9ae22f74bcb4 · outbound

This paper cites 264, 2023, pp.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 264, 2023, pp

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.812975Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3fc59dd6-b1a8-4de1-ab57-20dcdec55af1 · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.902973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d1d2fb2-f550-4fa6-b3ed-dd153b6ad229 · outbound

This paper cites Math.28(1982), 191–209.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Math.28(1982), 191–209

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:36.994011Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a76582d-81da-445e-ab90-efe47f68af6e · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:37.150923Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b897cb0-2558-4e07-8522-84f13f589681 · outbound

This paper cites 1, 20–40.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 1, 20–40

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:37.343686Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ffa1c475-fa45-4d7d-9a10-ab2b85526e2b · outbound

This paper cites 3, To appear.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 3, To appear

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:37.529781Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3403bcd1-8bb8-46ca-8570-8e0f7b60a40e · outbound

This paper cites 497, Cambridge University Press, 2025.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 497, Cambridge University Press, 2025

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:37.714761Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7612c0df-46a2-4668-a669-90521d285734 · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:37.828714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d874fa9-67de-40ee-ad60-990b34ed3551 · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:37.983841Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1389bfb-558a-49bc-bc17-f2c2936f754b · outbound

This paper cites Oliveira,Unprovability of strong complexity lower bounds in bounded arithmetic, Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), 2023, pp.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Oliveira,Unprovability of strong complexity lower bounds in bounded arithmetic, Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), 2023, pp

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:38.159862Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 702c07e9-ac3a-4284-9d06-d0e01994654b · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:38.338611Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1ff2f78-2191-4eb4-bb02-14a1dcc5120f · outbound

This paper cites 1243–1254.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 1243–1254

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:38.462274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a440a2b7-8a6b-44c5-9d9d-c333be634d5b · outbound

This paper cites Colloquium Comput.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Colloquium Comput

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:38.644990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27f0365c-103b-499c-9339-046673e928c6 · outbound

This paper cites 2, 102735.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 2, 102735

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:38.770021Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c18c4f1-22f4-4d3c-8610-222d32acbbfa · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:38.923227Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2aaafc9c-e5f5-4777-91e8-926b3d65f447 · outbound

This paper cites 120, Elsevier, 1986, pp.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 120, Elsevier, 1986, pp

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.004220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f9f5fb1-50e6-418e-8d1a-af86ef2c1bf5 · outbound

This paper cites Buss, ed.), Elsevier, 1998.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Buss, ed.), Elsevier, 1998

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.154751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79d5aff6-5b74-4f68-8efa-7578865e3653 · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.275131Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff89148d-9230-46e9-a50f-0983d7ca7cc3 · outbound

This paper cites Razborov,Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic, Izvestiya: Mathematics59(1995), no.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Razborov,Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic, Izvestiya: Mathematics59(1995), no

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.398479Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b80d3f14-1926-4027-9580-cbdeed5b4889 · outbound

This paper cites Razborov and Steven Rudich,Natural proofs, STOC ’94: Proceed- ings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing,, (New York, NY: ACM Press), 1994, pp.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Razborov and Steven Rudich,Natural proofs, STOC ’94: Proceed- ings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing,, (New York, NY: ACM Press), 1994, pp

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.523265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation df701f5b-260b-4b33-9439-abfd9dc651ff · outbound

This paper cites 219, 2022, pp.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption 219, 2022, pp

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.631650Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7ecce18-c03b-4b16-9445-ab8297e2c6fa · outbound

This paper cites an unresolved cited work.

Hardness as an Information Constraint: A Unifying Meta-Complexity Assumption Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-02T12:32:39.756566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.