Paper Citation Record · LEDGER

Computational-Statistical Tradeoffs from NP-hardness

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

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

pith.paper-citation-record.v1
2507.13222 v1

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:47:07.349753Z

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

39 of 39 outbound references displayed

verified exact0
verified fuzzy36
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a07fc367-b664-491c-8240-2ef8e80f7e21 · outbound

This paper cites Computational Complexity: A Modern Approach.

Computational-Statistical Tradeoffs from NP-hardness Computational Complexity: A Modern Approach

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-06T16:47:07.253425Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 157bfbd1-4355-4825-a01a-c6e1126c74ce · outbound

This paper cites On basing lower-bounds for learning on worst-case assumptions.

Computational-Statistical Tradeoffs from NP-hardness On basing lower-bounds for learning on worst-case assumptions

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.650589Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 9da1c529-3358-4169-97b2-bc074ce1156b · outbound

This paper cites On basing one-way functions on NP -hardness.

Computational-Statistical Tradeoffs from NP-hardness On basing one-way functions on NP -hardness

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.642846Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a6be7374-fe7e-4ea5-8580-8e9afb09a8f1 · outbound

This paper cites The design and analysis of computer algorithms.

Computational-Statistical Tradeoffs from NP-hardness The design and analysis of computer algorithms

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.635338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 599f7fa3-6afa-467d-a06e-46ac572b62fe · outbound

This paper cites Trading group theory for randomness.

Computational-Statistical Tradeoffs from NP-hardness Trading group theory for randomness

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.628319Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e1280795-0bcb-4025-b622-75ed506faa15 · outbound

This paper cites Reducibility and statistical-computational gaps from secret leakage.

Computational-Statistical Tradeoffs from NP-hardness Reducibility and statistical-computational gaps from secret leakage

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.620910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d994cae9-9032-4b15-90e3-98f88e6a486a · outbound

This paper cites Learnability and the Vapnik-Chervonenkis dimension.

Computational-Statistical Tradeoffs from NP-hardness Learnability and the Vapnik-Chervonenkis dimension

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.613700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 64ce7ab0-f9bd-4d85-892d-466b03a77e9b · outbound

This paper cites Cryptographic primitives based on hard learning problems.

Computational-Statistical Tradeoffs from NP-hardness Cryptographic primitives based on hard learning problems

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.606450Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation bfa78b71-1902-47cf-8e1d-01f85185fdb7 · outbound

This paper cites Learning boolean functions in an infinite attribute space.

Computational-Statistical Tradeoffs from NP-hardness Learning boolean functions in an infinite attribute space

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.599226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 49fd2964-8226-4b6c-bb3a-e65e90b3e874 · outbound

This paper cites On worst-case to average-case reductions for NP problems.

Computational-Statistical Tradeoffs from NP-hardness On worst-case to average-case reductions for NP problems

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.592179Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 28f94c20-5329-4c79-9ae2-732cbea3befe · outbound

This paper cites The complexity of unique k - SAT : An isolation lemma for k - CNFs.

Computational-Statistical Tradeoffs from NP-hardness The complexity of unique k - SAT : An isolation lemma for k - CNFs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.584940Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a21bcc98-9da4-4150-b6ed-93b3deb5a793 · outbound

This paper cites Randomness conductors and constant-degree lossless expanders.

Computational-Statistical Tradeoffs from NP-hardness Randomness conductors and constant-degree lossless expanders

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.577644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 99a396e0-a570-4765-aa62-2604c1a3ce59 · outbound

This paper cites Computational sample complexity.

Computational-Statistical Tradeoffs from NP-hardness Computational sample complexity

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.570698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0572db8f-c17c-4cd1-bebb-87148bc27fa2 · outbound

This paper cites Exponential time complexity of the Permanent and the Tutte polynomial.

Computational-Statistical Tradeoffs from NP-hardness Exponential time complexity of the Permanent and the Tutte polynomial

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.563833Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0981f364-211b-4c2a-bcdb-5ff049c059aa · outbound

This paper cites More data speeds up training time in learning halfspaces over sparse vectors.

Computational-Statistical Tradeoffs from NP-hardness More data speeds up training time in learning halfspaces over sparse vectors

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.556614Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0de6902e-d930-4311-b2a9-64d26fa65f60 · outbound

This paper cites From average case complexity to improper learning complexity.

Computational-Statistical Tradeoffs from NP-hardness From average case complexity to improper learning complexity

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.549300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation ebaac334-7a53-4f0c-8944-2faa96a8a72a · outbound

This paper cites Hardness of proper learning.

Computational-Statistical Tradeoffs from NP-hardness Hardness of proper learning

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.542151Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 29143507-8e5d-4c4e-a131-80f674e842f0 · outbound

This paper cites Random-self-reducibility of complete sets.

Computational-Statistical Tradeoffs from NP-hardness Random-self-reducibility of complete sets

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.535075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d5802820-94d1-4a6b-8323-dacb7b7bac44 · outbound

This paper cites How to construct random functions.

Computational-Statistical Tradeoffs from NP-hardness How to construct random functions

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.527650Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation eee2aa12-794d-4db2-ab03-1936e995daf0 · outbound

This paper cites Limited nondeterminism.

Computational-Statistical Tradeoffs from NP-hardness Limited nondeterminism

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.520523Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation d74cdf61-277e-4db7-acc7-872ecd2ee1fd · outbound

This paper cites No better ways to generate hard NP instances than picking uniformly at random.

Computational-Statistical Tradeoffs from NP-hardness No better ways to generate hard NP instances than picking uniformly at random

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.512643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e40111d9-a657-469e-ba22-b857c2f244fe · outbound

This paper cites A personal view of average-case complexity.

Computational-Statistical Tradeoffs from NP-hardness A personal view of average-case complexity

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.504223Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 6d89bcdf-78a7-4ba5-be93-e403b86169e7 · outbound

This paper cites Machine learning: Trends, perspectives, and prospects.

Computational-Statistical Tradeoffs from NP-hardness Machine learning: Trends, perspectives, and prospects

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.496863Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 40f59845-bcbb-4a1e-9e85-8fd63b3b02d0 · outbound

This paper cites Computations with a restricted number of nondeterministic steps.

Computational-Statistical Tradeoffs from NP-hardness Computations with a restricted number of nondeterministic steps

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.488957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5fd11ff4-ea02-47c1-ba93-ad521612829c · outbound

This paper cites Cryptographic limitations on learning B oolean formulae and finite automata.

Computational-Statistical Tradeoffs from NP-hardness Cryptographic limitations on learning B oolean formulae and finite automata

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.480991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e494e091-caf1-4f50-8ec6-c6e7b23760c8 · outbound

This paper cites Kearns and Umesh Vazirani.

Computational-Statistical Tradeoffs from NP-hardness Kearns and Umesh Vazirani

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.473380Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation db3fd5dc-6a37-49af-890a-32056284c0aa · outbound

This paper cites Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm.

Computational-Statistical Tradeoffs from NP-hardness Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-06T16:47:07.318427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4bdacada-f9dd-4e03-937e-a1f2a0f54119 · outbound

This paper cites From on-line to batch learning.

Computational-Statistical Tradeoffs from NP-hardness From on-line to batch learning

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.460810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2a9905aa-3573-4e57-a114-073743548b91 · outbound

This paper cites Some results on relativized deterministic and nondeterministic time hierarchies.

Computational-Statistical Tradeoffs from NP-hardness Some results on relativized deterministic and nondeterministic time hierarchies

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.453162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3c1a4234-e914-45c0-9648-70716c7cf2dc · outbound

This paper cites Computational limitations on learning from examples.

Computational-Statistical Tradeoffs from NP-hardness Computational limitations on learning from examples

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.444770Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0246b9ee-5012-4382-abe1-a2497797a008 · outbound

This paper cites The strength of weak learnability.

Computational-Statistical Tradeoffs from NP-hardness The strength of weak learnability

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.436803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c57cab21-8e1e-4007-a7bf-4622075d1d98 · outbound

This paper cites Computational sample complexity and attribute-efficient learning.

Computational-Statistical Tradeoffs from NP-hardness Computational sample complexity and attribute-efficient learning

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.429264Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1d003f71-d516-468f-9108-8d49c6773872 · outbound

This paper cites https://simons.berkeley.edu/programs/computational-complexity-statistical-inference , 2021.

Computational-Statistical Tradeoffs from NP-hardness https://simons.berkeley.edu/programs/computational-complexity-statistical-inference , 2021

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.421466Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 4c8f7ad7-237e-44bc-8fe9-bd600566575f · outbound

This paper cites Expander codes.

Computational-Statistical Tradeoffs from NP-hardness Expander codes

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.413690Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 2ffd9f98-b8b4-41d3-922e-d8911348c384 · outbound

This paper cites Understanding Machine Learning: From Theory to Algorithms.

Computational-Statistical Tradeoffs from NP-hardness Understanding Machine Learning: From Theory to Algorithms

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-06T16:47:07.340219Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7ab6309-7989-40c5-8287-f3ef262ae7d1 · outbound

This paper cites Using more data to speed-up training time.

Computational-Statistical Tradeoffs from NP-hardness Using more data to speed-up training time

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.400471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 79e66f5d-041d-441f-b944-a4009f9f654f · outbound

This paper cites A theory of the learnable.

Computational-Statistical Tradeoffs from NP-hardness A theory of the learnable

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.392093Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e57d0ee4-67e2-48be-9182-21f3ca4de536 · outbound

This paper cites On the uniform convergence of relative frequencies of events to their probabilities.

Computational-Statistical Tradeoffs from NP-hardness On the uniform convergence of relative frequencies of events to their probabilities

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.384358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 21817c3e-2598-45ff-afe9-f6e318d73644 · outbound

This paper cites New perspectives on the complexity of computational learning, and other problems in theoretical computer science.

Computational-Statistical Tradeoffs from NP-hardness New perspectives on the complexity of computational learning, and other problems in theoretical computer science

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:47:07.376303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Pith citing papers

No inbound Pith citation observations are available.