Paper Citation Record · LEDGER

Strong Low Degree Hardness for the Number Partitioning Problem

As of 17 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 2 inbound Pith citation observations for arXiv:2505.20607.

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

pith.paper-citation-record.v1
2505.20607 v1

Coverage vector

measured 2 of 2 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T14:01:06.727099Z

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T04:24:26.512685Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T21:11:20.703620Z

Reference resolution

2 of 2 outbound references displayed

verified exact0
verified fuzzy0
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7c90cd0d-e43b-47bd-a79b-0183754b622f · outbound

This paper cites Symmetric Perceptrons, Number Partitioning and Lattices.

Strong Low Degree Hardness for the Number Partitioning Problem Symmetric Perceptrons, Number Partitioning and Lattices

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T14:01:06.727099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 299d53d6-65a5-45fb-9c0e-3523e829b188 · outbound

This paper cites Tensor principal component analysis via sum-of-square proofs,.

Strong Low Degree Hardness for the Number Partitioning Problem Tensor principal component analysis via sum-of-square proofs,

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-07T14:01:06.652048Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation ed35b9c8-630c-4115-abc9-fcae816b3e19 · inbound

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

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials Strong Low Degree Hardness for the Number Partitioning Problem

Reference 39

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 744948e4-93fb-410d-b985-8ba7dd3a4f74 · inbound

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs cites this paper.

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs Strong Low Degree Hardness for the Number Partitioning Problem

Reference 89

Resolution: verified exact; arxiv_id, observed 2026-05-11T21:11:20.706047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.