Paper Citation Record · LEDGER

The Quasi-Polynomial Low-Degree Conjecture is False

As of 13 August 2026, this Paper Citation Record lists 98 of 98 outbound references and 11 inbound Pith citation observations for arXiv:2505.17360.

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

pith.paper-citation-record.v1
2505.17360 v1

Coverage vector

measured 98 of 98 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:01:18.009131Z

measured 109 of 109 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 11 of 11 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T13:09:59.821806Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-02T06:16:43.966067Z

Reference resolution

98 of 98 outbound references displayed

verified exact6
verified fuzzy54
unresolved37
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6ebfd070-856d-46fb-966b-de361ee3d90a · outbound

This paper cites Cryptography from Planted Graphs: Security with Logarithmic-Size Messages.

The Quasi-Polynomial Low-Degree Conjecture is False Cryptography from Planted Graphs: Security with Logarithmic-Size Messages

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.151134Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c1cfa53-dafb-478e-9dce-8ba377bb94f3 · outbound

This paper cites Public-key cryptography from different assumptions.

The Quasi-Polynomial Low-Degree Conjecture is False Public-key cryptography from different assumptions

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.213760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 366ec581-e75e-4b7c-b0e8-a0215c1f4c60 · outbound

This paper cites http://admin.aimath.org/resources/lowdegreecomplexity/participantlist/ , 2024.

The Quasi-Polynomial Low-Degree Conjecture is False http://admin.aimath.org/resources/lowdegreecomplexity/participantlist/ , 2024

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.266276Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b51fbf4-34a3-4589-8a59-6d8706e853f0 · outbound

This paper cites Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.

The Quasi-Polynomial Low-Degree Conjecture is False Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.351847Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82d30d38-d053-4ff8-b6d5-1e2aeead6685 · outbound

This paper cites Graph-codes.

The Quasi-Polynomial Low-Degree Conjecture is False Graph-codes

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.438301Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18988a98-583b-4087-a5e2-d12be38d0a10 · outbound

This paper cites Statistical-computational tradeoffs in mixed sparse linear regression.

The Quasi-Polynomial Low-Degree Conjecture is False Statistical-computational tradeoffs in mixed sparse linear regression

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.519383Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c333c90f-e214-40b8-a95a-f658cf919503 · outbound

This paper cites Bandeira, Ahmed El Alaoui, Samuel B.

The Quasi-Polynomial Low-Degree Conjecture is False Bandeira, Ahmed El Alaoui, Samuel B

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.574945Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7eb908f6-f1ce-4f55-9875-c74e8f61719d · outbound

This paper cites Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness.

The Quasi-Polynomial Low-Degree Conjecture is False Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.617772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0896488-5c6a-4f0f-9e06-f9e4d26f4db9 · outbound

This paper cites Random Algebraic Graphs and Their Convergence to Erdos-Renyi.

The Quasi-Polynomial Low-Degree Conjecture is False Random Algebraic Graphs and Their Convergence to Erdos-Renyi

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:01:19.846759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 511d827e-c134-45e4-93d2-e455c74c2be0 · outbound

This paper cites On the fourier coefficients of high-dimensional random geometric graphs.

The Quasi-Polynomial Low-Degree Conjecture is False On the fourier coefficients of high-dimensional random geometric graphs

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.818281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75e57fb2-a423-4221-bbb5-6ad9c319fa95 · outbound

This paper cites Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure.

The Quasi-Polynomial Low-Degree Conjecture is False Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.863198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2547c4e9-abba-44fa-98ca-9e3440923706 · outbound

This paper cites Brennan, Guy Bresler, Samuel B.

The Quasi-Polynomial Low-Degree Conjecture is False Brennan, Guy Bresler, Samuel B

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:09.955963Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68a9f046-15b1-4e43-a75d-30dbf88e1f3a · outbound

This paper cites Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, and Alexander S.

The Quasi-Polynomial Low-Degree Conjecture is False Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, and Alexander S

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.026207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96a80f79-9046-456a-994d-d2a752d392ec · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.075676Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f0a7612-ef84-4aa5-b11f-00cf96924d70 · outbound

This paper cites Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression.

The Quasi-Polynomial Low-Degree Conjecture is False Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression

Reference 15

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:01:19.667769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 93e90fa6-d743-4689-9241-66e4b7032681 · outbound

This paper cites The algorithmic phase transition of random k-sat for low degree polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False The algorithmic phase transition of random k-sat for low degree polynomials

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.192354Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dc3b252-c778-426e-8617-4cc9fb7316ba · outbound

This paper cites The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.235925Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dec017e2-a46a-453f-b116-ed7b25f4dfbd · outbound

This paper cites Hopkins, Jonathan A.

The Quasi-Polynomial Low-Degree Conjecture is False Hopkins, Jonathan A

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.332444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9459fa3a-b331-49d3-bf98-6f4697ebd508 · outbound

This paper cites Permuted Puzzles and Cryptographic Hardness.

The Quasi-Polynomial Low-Degree Conjecture is False Permuted Puzzles and Cryptographic Hardness

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.432622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3430af1b-9761-4e41-a104-0315aa4232a9 · outbound

This paper cites Low-degree security of the planted random subgraph problem.

The Quasi-Polynomial Low-Degree Conjecture is False Low-degree security of the planted random subgraph problem

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.467997Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0fcad1be-f399-471b-8122-09c3ab0e899d · outbound

This paper cites Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.

The Quasi-Polynomial Low-Degree Conjecture is False Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:30.286921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d0c13d1c-74d6-4feb-a44c-ca8aae91c0b8 · outbound

This paper cites Kothari, and David Steurer.

The Quasi-Polynomial Low-Degree Conjecture is False Kothari, and David Steurer

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:30.203883Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 4cb760e3-06c0-4403-b9f9-f635e91ad1d0 · outbound

This paper cites Bandeira, Dmitriy Kunisky, and Alexander S.

The Quasi-Polynomial Low-Degree Conjecture is False Bandeira, Dmitriy Kunisky, and Alexander S

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:30.077028Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 157260aa-14e9-4a52-8631-501749c01802 · outbound

This paper cites Complexity Theoretic Lower Bounds for Sparse Principal Component Detection.

The Quasi-Polynomial Low-Degree Conjecture is False Complexity Theoretic Lower Bounds for Sparse Principal Component Detection

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.933057Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation aa17cf62-bc2f-41bc-b0b9-dc09d5f9d9eb · outbound

This paper cites The complexity of sparse tensor PCA.

The Quasi-Polynomial Low-Degree Conjecture is False The complexity of sparse tensor PCA

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.795653Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 8b13f078-5aaa-4214-9c49-aad5eb3b457d · outbound

This paper cites A computational transition for detecting correlated stochastic block models by low-degree polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False A computational transition for detecting correlated stochastic block models by low-degree polynomials

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:10.844506Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 312ba3ae-309a-4334-b214-594463f6f444 · outbound

This paper cites Statistical and Computational Phase Transitions in Group Testing.

The Quasi-Polynomial Low-Degree Conjecture is False Statistical and Computational Phase Transitions in Group Testing

Reference 27

Resolution: metadata mismatch; local_arxiv, observed 2026-08-07T15:01:19.382539Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 8c9aa757-1d38-44d5-bf92-eec1ed419da1 · outbound

This paper cites On the Security of Subspace Subcodes of Reed-Solomon Codes for Public Key Encryption.

The Quasi-Polynomial Low-Degree Conjecture is False On the Security of Subspace Subcodes of Reed-Solomon Codes for Public Key Encryption

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.675255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 2abd2005-c332-4b8b-a132-344d170830f3 · outbound

This paper cites Almost-Linear Planted Cliques Elude the Metropolis Process.

The Quasi-Polynomial Low-Degree Conjecture is False Almost-Linear Planted Cliques Elude the Metropolis Process

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.520380Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation cb307b8c-e127-4db4-8526-1545da52b1af · outbound

This paper cites Low-degree hardness of detection for correlated erd o s-r \' e nyi graphs.

The Quasi-Polynomial Low-Degree Conjecture is False Low-degree hardness of detection for correlated erd o s-r \' e nyi graphs

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:11.197845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75a103e5-aaf7-4a2e-8361-4de67aa2899d · outbound

This paper cites Detection and Recovery of Hidden Submatrices.

The Quasi-Polynomial Low-Degree Conjecture is False Detection and Recovery of Hidden Submatrices

Reference 31

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:01:19.154416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d65f2ca2-4482-443e-877a-4b37e439cb57 · outbound

This paper cites Low degree conjecture implies sharp computational thresholds in stochastic block model.

The Quasi-Polynomial Low-Degree Conjecture is False Low degree conjecture implies sharp computational thresholds in stochastic block model

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:11.333123Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b9376ab2-7706-4253-bdf0-c6c9cfbe1625 · outbound

This paper cites Lossy Cryptography from Code-Based Assumptions.

The Quasi-Polynomial Low-Degree Conjecture is False Lossy Cryptography from Code-Based Assumptions

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.355252Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation bee8c85d-3984-4d7d-b3b7-e175c6742573 · outbound

This paper cites Non-Gaussian Component Analysis via Lattice Basis Reduction.

The Quasi-Polynomial Low-Degree Conjecture is False Non-Gaussian Component Analysis via Lattice Basis Reduction

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.259798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7977cc21-21b0-48ac-84eb-84b5a70d0036 · outbound

This paper cites Kothari, Gleb Novikov, and David Steurer.

The Quasi-Polynomial Low-Degree Conjecture is False Kothari, Gleb Novikov, and David Steurer

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:29.131552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7dc0c1ad-d0fd-4ab3-af66-17300f8c900b · outbound

This paper cites Kane, Thanasis Pittas, and Nikos Zarifis.

The Quasi-Polynomial Low-Degree Conjecture is False Kane, Thanasis Pittas, and Nikos Zarifis

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:28.980857Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 40777ce6-de7b-49bc-a23b-4fb80354c970 · outbound

This paper cites Wein, and Afonso S.

The Quasi-Polynomial Low-Degree Conjecture is False Wein, and Afonso S

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:28.737388Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d45975c0-aaba-4633-b37c-3520fae4b8cb · outbound

This paper cites Wein, and Afonso S.

The Quasi-Polynomial Low-Degree Conjecture is False Wein, and Afonso S

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:28.496786Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b04d2f4f-df2c-4018-a8dc-4551eb3afb4d · outbound

This paper cites Detection of Dense Subhypergraphs by Low-Degree Polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False Detection of Dense Subhypergraphs by Low-Degree Polynomials

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:12.006814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3dd7ffdd-9ebd-4271-b7ed-88673176684d · outbound

This paper cites Detection of Dense Subhypergraphs by Low-Degree Polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False Detection of Dense Subhypergraphs by Low-Degree Polynomials

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:28.279985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation c21f9c5a-d637-4b0e-ba90-d5f5222561de · outbound

This paper cites The low-degree hardness of finding large independent sets in sparse random hypergraphs.

The Quasi-Polynomial Low-Degree Conjecture is False The low-degree hardness of finding large independent sets in sparse random hypergraphs

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:12.212448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31894939-865f-4c7d-9802-9ef27edc77c2 · outbound

This paper cites Vempala, and Ying Xiao.

The Quasi-Polynomial Low-Degree Conjecture is False Vempala, and Ying Xiao

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:28.022259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1f673482-b091-42ae-b6d8-4dbc6f94c764 · outbound

This paper cites Sum-of-squares lower bounds for Sherrington-Kirkpatrick via planted affine planes.

The Quasi-Polynomial Low-Degree Conjecture is False Sum-of-squares lower bounds for Sherrington-Kirkpatrick via planted affine planes

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:27.838020Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ff78e10c-d7b7-4d37-84fd-bd45934ef567 · outbound

This paper cites Low-degree hardness of random optimization problems.

The Quasi-Polynomial Low-Degree Conjecture is False Low-degree hardness of random optimization problems

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:27.608131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 3991e1cb-e97d-447b-ae86-3744d46fc642 · outbound

This paper cites Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics.

The Quasi-Polynomial Low-Degree Conjecture is False Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:27.394229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b6c89adf-dc1e-4c19-a38e-53a64ae532b6 · outbound

This paper cites Algorithms and Barriers in the Symmetric Binary Perceptron Model.

The Quasi-Polynomial Low-Degree Conjecture is False Algorithms and Barriers in the Symmetric Binary Perceptron Model

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:12.689748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3ffceaf-70b1-4b64-9392-d6f5a4fac18f · outbound

This paper cites Guruswami and M.

The Quasi-Polynomial Low-Degree Conjecture is False Guruswami and M

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:27.162867Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation a2731641-3d89-47a4-864c-b153deb8c8d3 · outbound

This paper cites The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property.

The Quasi-Polynomial Low-Degree Conjecture is False The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:12.904773Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56cbc1c7-9f42-455e-a000-de6a508a5734 · outbound

This paper cites Algorithmic Thresholds for Refuting Random Polynomial Systems.

The Quasi-Polynomial Low-Degree Conjecture is False Algorithmic Thresholds for Refuting Random Polynomial Systems

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:26.958059Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 15afa21d-6317-4f72-a667-97d428a45610 · outbound

This paper cites Rigorous Implications of the Low-Degree Heuristic.

The Quasi-Polynomial Low-Degree Conjecture is False Rigorous Implications of the Low-Degree Heuristic

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:26.855211Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7003e25b-47d4-4235-bb7b-047feae87fa2 · outbound

This paper cites The power of sum-of-squares for detecting hidden structures.

The Quasi-Polynomial Low-Degree Conjecture is False The power of sum-of-squares for detecting hidden structures

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:26.745557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 72aae434-53ee-4f0e-b24e-942e3c71b630 · outbound

This paper cites Optimal Low degree hardness for Broadcasting on Trees.

The Quasi-Polynomial Low-Degree Conjecture is False Optimal Low degree hardness for Broadcasting on Trees

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:13.329628Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a0d01e8-a864-4183-b32c-5c9d27c0b3ce · outbound

This paper cites Statistical inference and the sum of squares method.

The Quasi-Polynomial Low-Degree Conjecture is False Statistical inference and the sum of squares method

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:13.431944Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a82f4fef-d9dc-496c-8663-a16caf98aaa4 · outbound

This paper cites Efficient bayesian estimation from few samples: community detection and related problems.

The Quasi-Polynomial Low-Degree Conjecture is False Efficient bayesian estimation from few samples: community detection and related problems

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:26.635780Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation afe383b3-2343-4408-af51-fae0eb1ffbe7 · outbound

This paper cites Strong low degree hardness for stable local optima in spin glasses.

The Quasi-Polynomial Low-Degree Conjecture is False Strong low degree hardness for stable local optima in spin glasses

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:13.658532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cf818f8-4cec-4308-8aec-28b6fe695189 · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 56

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:01:26.499405Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 90b764e0-2448-45c2-8665-b8b7ed97539f · outbound

This paper cites Counterexamples to the Low-Degree Conjecture.

The Quasi-Polynomial Low-Degree Conjecture is False Counterexamples to the Low-Degree Conjecture

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:26.350632Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fdbee7ac-14da-42e0-b2a6-59162a136855 · outbound

This paper cites Computational lower bounds for community detection on random graphs.

The Quasi-Polynomial Low-Degree Conjecture is False Computational lower bounds for community detection on random graphs

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:26.197416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 0c9c57d4-99f3-440d-b40b-f7612970f285 · outbound

This paper cites Large cliques elude the Metropolis process.

The Quasi-Polynomial Low-Degree Conjecture is False Large cliques elude the Metropolis process

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:25.948842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 33c245cb-534e-42fe-9604-0639906e7042 · outbound

This paper cites Phase transition for detecting a small community in a large network.

The Quasi-Polynomial Low-Degree Conjecture is False Phase transition for detecting a small community in a large network

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:25.724071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ad122438-5a89-4730-9ee8-9d60fe5d7384 · outbound

This paper cites How to Leverage Hardness of Constant-Degree Expanding Polynomials over R to build iO.

The Quasi-Polynomial Low-Degree Conjecture is False How to Leverage Hardness of Constant-Degree Expanding Polynomials over R to build iO

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:25.562793Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 6c3428ee-d90b-4332-94e1-c69820429b2f · outbound

This paper cites Sum-of-squares lower bounds for sparse independent set.

The Quasi-Polynomial Low-Degree Conjecture is False Sum-of-squares lower bounds for sparse independent set

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:25.435553Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b9a6c11d-809f-4074-bb36-8af130b36c2a · outbound

This paper cites Sum-of-squares lower bounds for densest k-subgraph.

The Quasi-Polynomial Low-Degree Conjecture is False Sum-of-squares lower bounds for densest k-subgraph

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:25.289164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation e945e121-f76e-4587-8062-0e6246d32a84 · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 64

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:01:25.162604Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 8b226361-d0f5-4062-bd34-e3fdac8b3e33 · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 65

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:01:25.078396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 018c284f-67b3-40cf-af2b-a708eb6b5d58 · outbound

This paper cites Kothari, Aaron Potechin, and Jeff Xu.

The Quasi-Polynomial Low-Degree Conjecture is False Kothari, Aaron Potechin, and Jeff Xu

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.961847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 21661844-eb10-420e-a755-0b8f5abb1db1 · outbound

This paper cites Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing.

The Quasi-Polynomial Low-Degree Conjecture is False Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing

Reference 67

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:01:18.682144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 4d79cd57-e4cb-4316-992d-b7435b476f2d · outbound

This paper cites Is planted coloring easier than planted clique? In The Thirty Sixth Annual Conference on Learning Theory , pages 5343--5372.

The Quasi-Polynomial Low-Degree Conjecture is False Is planted coloring easier than planted clique? In The Thirty Sixth Annual Conference on Learning Theory , pages 5343--5372

Reference 68

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.859192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 66a95ed4-cd6c-4ad9-889e-a238a40b7655 · outbound

This paper cites Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio.

The Quasi-Polynomial Low-Degree Conjecture is False Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.717056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 47fd8781-537c-4f90-ab41-8f7eef2de33d · outbound

This paper cites Computational lower bounds for graphon estimation via low-degree polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False Computational lower bounds for graphon estimation via low-degree polynomials

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.558161Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7c53422a-7869-4ae1-84a2-ae80174604d3 · outbound

This paper cites Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs.

The Quasi-Polynomial Low-Degree Conjecture is False Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:15.291261Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aa571737-6ee3-4674-9ac4-ee2e1bdb3edb · outbound

This paper cites Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation.

The Quasi-Polynomial Low-Degree Conjecture is False Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.410305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 055bab6a-99c7-4542-bf34-e120b15093af · outbound

This paper cites Computationally efficient sparse clustering.

The Quasi-Polynomial Low-Degree Conjecture is False Computationally efficient sparse clustering

Reference 73

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:01:18.372131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation edc09bed-2a15-498c-b100-a324d3bac5ee · outbound

This paper cites Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model.

The Quasi-Polynomial Low-Degree Conjecture is False Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:15.667083Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 769a3b26-5585-4cdb-b1ce-8c23a1eb9a48 · outbound

This paper cites Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures , 2022.

The Quasi-Polynomial Low-Degree Conjecture is False Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures , 2022

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.295169Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation c2d7dbed-9bff-4217-8a7a-552f23637b98 · outbound

This paper cites Computational and statistical thresholds in multi-layer stochastic block models.

The Quasi-Polynomial Low-Degree Conjecture is False Computational and statistical thresholds in multi-layer stochastic block models

Reference 76

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.176906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 7bab33ca-6f28-4be4-b87f-99fc523d90ff · outbound

This paper cites McEliece.

The Quasi-Polynomial Low-Degree Conjecture is False McEliece

Reference 77

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:24.027493Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation dab8ce12-55f8-45ea-8ccc-0fad19731374 · outbound

This paper cites Lifting sum-of-squares lower bounds: degree-2 to degree-4.

The Quasi-Polynomial Low-Degree Conjecture is False Lifting sum-of-squares lower bounds: degree-2 to degree-4

Reference 78

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:23.871976Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 636c2d71-469a-4d3e-b9c8-5f5323f91542 · outbound

This paper cites On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors.

The Quasi-Polynomial Low-Degree Conjecture is False On the limitation of spectral methods: From the Gaussian hidden clique problem to rank one perturbations of Gaussian tensors

Reference 79

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:23.749792Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1e4fab24-fb2a-4571-8c17-487fc78882bb · outbound

This paper cites On -Biased Generators in NC^0.

The Quasi-Polynomial Low-Degree Conjecture is False On -Biased Generators in NC^0

Reference 80

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:23.564569Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 8048b844-b192-4e00-9aed-ffaf42b16d6f · outbound

This paper cites Precise Error Rates for Computationally Efficient Testing.

The Quasi-Polynomial Low-Degree Conjecture is False Precise Error Rates for Computationally Efficient Testing

Reference 81

Resolution: verified exact; local_arxiv, observed 2026-08-07T15:01:18.176361Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 73b451ff-9e3b-4e32-a635-edec839db0d7 · outbound

This paper cites Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation.

The Quasi-Polynomial Low-Degree Conjecture is False Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation

Reference 82

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:23.255345Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 769783be-8abc-452d-8647-a2a3c16883f6 · outbound

This paper cites Optimal spectral recovery of a planted vector in a subspace.

The Quasi-Polynomial Low-Degree Conjecture is False Optimal spectral recovery of a planted vector in a subspace

Reference 83

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:22.986693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 2b82434a-0bc7-48d5-ab28-d488fa432dd5 · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 84

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:01:22.747146Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1da2d381-a260-4c2f-b9b5-000bf7d406ae · outbound

This paper cites Detection-Recovery Gap for Planted Dense Cycles.

The Quasi-Polynomial Low-Degree Conjecture is False Detection-Recovery Gap for Planted Dense Cycles

Reference 85

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:22.554416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 73d33d65-5822-4a99-ac80-7e65dc82e223 · outbound

This paper cites Polynomial codes over certain finite fields.

The Quasi-Polynomial Low-Degree Conjecture is False Polynomial codes over certain finite fields

Reference 86

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:22.330422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 5efc2963-82ea-4c81-9f1d-0557bdda7b31 · outbound

This paper cites Is It Easier to Count Communities Than Find Them? In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023).

The Quasi-Polynomial Low-Degree Conjecture is False Is It Easier to Count Communities Than Find Them? In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)

Reference 87

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:22.044950Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 5a96348d-22cc-4b87-9290-0c433451984f · outbound

This paper cites Hanson- W right inequality and sub- G aussian concentration.

The Quasi-Polynomial Low-Degree Conjecture is False Hanson- W right inequality and sub- G aussian concentration

Reference 88

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:21.755071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 396162a0-8d72-4664-ba9d-0563a78db2b4 · outbound

This paper cites A public-key cryptosystem based on binary Reed-Muller codes.

The Quasi-Polynomial Low-Degree Conjecture is False A public-key cryptosystem based on binary Reed-Muller codes

Reference 89

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:21.513814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fada2c5c-9735-4adc-9cbb-0a7cc874b920 · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 90

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:01:21.246425Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation ee9ea962-d7fe-44b1-8e08-03e5d2e2b1b2 · outbound

This paper cites Decoding of reed solomon codes beyond the error-correction bound.

The Quasi-Polynomial Low-Degree Conjecture is False Decoding of reed solomon codes beyond the error-correction bound

Reference 91

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:21.076049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 966db273-6f2e-4807-bf35-826b5dca6016 · outbound

This paper cites Computational barriers to estimation from low-degree polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False Computational barriers to estimation from low-degree polynomials

Reference 92

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:20.856810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation f183d37c-58c2-40c2-a9a6-a34f7bfafb4d · outbound

This paper cites Sharp Phase Transitions in Estimation with Low-Degree Polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False Sharp Phase Transitions in Estimation with Low-Degree Polynomials

Reference 93

Resolution: unresolved; no resolver link, observed 2026-08-07T15:01:17.585617Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b150165d-84b3-41a6-be97-3cea9395e4cb · outbound

This paper cites Optimal low-degree hardness of maximum independent set.

The Quasi-Polynomial Low-Degree Conjecture is False Optimal low-degree hardness of maximum independent set

Reference 94

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:20.689505Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 5a6a0628-e080-4b4f-ab47-f8d127e1c883 · outbound

This paper cites Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials.

The Quasi-Polynomial Low-Degree Conjecture is False Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials

Reference 95

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:20.498243Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 222396af-d81e-49c5-b1a5-72e9f74cd171 · outbound

This paper cites On some fine-grained questions in algorithms and complexity.

The Quasi-Polynomial Low-Degree Conjecture is False On some fine-grained questions in algorithms and complexity

Reference 96

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:20.405298Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 1fbad0bc-ad23-478a-9069-511edb8ee7de · outbound

This paper cites an unresolved cited work.

The Quasi-Polynomial Low-Degree Conjecture is False Unresolved cited work

Reference 97

Resolution: unresolved; raw_fallback, observed 2026-08-07T15:01:20.205413Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 44adbe5a-4b16-4cb4-b735-252186a768b8 · outbound

This paper cites Lattice-Based Methods Surpass Sum-of-Squares in Clustering.

The Quasi-Polynomial Low-Degree Conjecture is False Lattice-Based Methods Surpass Sum-of-Squares in Clustering

Reference 98

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:01:20.012450Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Pith citing papers

Observation 95af7dc7-ac67-40f6-836c-b1cb53cefcb6 · inbound

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood cites this paper.

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood The Quasi-Polynomial Low-Degree Conjecture is False

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T13:09:59.821806Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23876183-404a-484c-b1ee-8464e13ab8b4 · inbound

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials cites this paper.

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials The Quasi-Polynomial Low-Degree Conjecture is False

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-07T04:24:23.810810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6a6194a-ebf5-4ec8-bb8f-ed5589888fd6 · inbound

Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors cites this paper.

Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors The Quasi-Polynomial Low-Degree Conjecture is False

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-05-14T23:33:16.416698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 9357eb73-4e7a-471f-baa7-be25dbd53720 · inbound

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic cites this paper.

Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic The Quasi-Polynomial Low-Degree Conjecture is False

Reference 5

Resolution: verified exact; arxiv_id, observed 2026-05-11T08:16:01.414022Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b343c42e-22ba-4c1c-bb80-0fe3d67234e5 · inbound

Public Key Encryption from High-Corruption Constraint Satisfaction Problems cites this paper.

Public Key Encryption from High-Corruption Constraint Satisfaction Problems The Quasi-Polynomial Low-Degree Conjecture is False

Reference 62

Resolution: metadata mismatch; arxiv_id, observed 2026-05-11T08:30:56.850521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 0eca63a3-eeae-4e46-9900-4db61aa0c7ac · inbound

High-Dimensional Statistics: Reflections on Progress and Open Problems cites this paper.

High-Dimensional Statistics: Reflections on Progress and Open Problems The Quasi-Polynomial Low-Degree Conjecture is False

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-11T18:36:06.387547Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d273fa7a-f7e2-49ea-aa0b-8d0b734131fd · inbound

High-Dimensional Statistics: Reflections on Progress and Open Problems cites this paper.

High-Dimensional Statistics: Reflections on Progress and Open Problems The Quasi-Polynomial Low-Degree Conjecture is False

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-06-30T23:35:08.059750Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation fbdcf518-e710-4773-aa87-4b0b9b35269f · inbound

Sharp Low-Degree Thresholds for Planted-vs-Planted Testing cites this paper.

Sharp Low-Degree Thresholds for Planted-vs-Planted Testing The Quasi-Polynomial Low-Degree Conjecture is False

Reference 4

Resolution: metadata mismatch; arxiv_id, observed 2026-07-02T06:16:43.967352Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 45c16bb3-d626-4350-910d-791466e76d7d · inbound

Strong Refutation of Random Ordering CSPs cites this paper.

Strong Refutation of Random Ordering CSPs The Quasi-Polynomial Low-Degree Conjecture is False

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-13T03:13:46.776350Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19e29b69-955d-4f3c-bcdc-1b0ba01cda5f · inbound

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths cites this paper.

Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths The Quasi-Polynomial Low-Degree Conjecture is False

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T12:53:20.077593Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bdd1def4-f06c-4561-aa90-a1bb87da72c4 · inbound

The Kikuchi Hierarchy is Sharp for $k$XOR cites this paper.

The Kikuchi Hierarchy is Sharp for $k$XOR The Quasi-Polynomial Low-Degree Conjecture is False

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-03T02:16:39.488438Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.