Pith. sign in

Paper Citation Record · LEDGER

On the Complexity of Random Satisfiability Problems with Planted Solutions

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

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

pith.paper-citation-record.v1
1311.4821 v8

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+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-07T13:10:03.604208Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T06:11:00.593343Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation bca273e7-8639-4353-b4f8-a62d467b46c1 · inbound

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

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood On the Complexity of Random Satisfiability Problems with Planted Solutions

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-07T13:10:03.604208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T13:10:03.604208Z digest=sha256:9113d434460852cead2db8a11b7e8151da4fd324771e5618731675caa98f971d

Observation 5991f15e-521f-42de-a277-eec71320ebb4 · inbound

Planted-solution SAT and Ising benchmarks from integer factorization cites this paper.

Planted-solution SAT and Ising benchmarks from integer factorization On the Complexity of Random Satisfiability Problems with Planted Solutions

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-07-04T22:35:34.759044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-05-10T17:46:21.888150Z digest=sha256:af673d448943930cbf44021de4bd6c35b7d12715d5838731a2fa002f3ca1a4c4