Paper Citation Record · LEDGER

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality

As of 13 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2606.14804.

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

pith.paper-citation-record.v1
2606.14804 v2

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-27T04:35:53.975397Z

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

27 of 27 outbound references displayed

verified exact2
verified fuzzy0
unresolved24
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e6b0779b-4a10-4b3a-a38a-2444ed20c8e2 · outbound

This paper cites Lemmanaid: Neuro-Symbolic Lemma Conjecturing.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Lemmanaid: Neuro-Symbolic Lemma Conjecturing

Reference 1

Resolution: verified exact; local_arxiv, observed 2026-07-03T17:08:43.373459Z

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 8dd0d6ff-17c4-4e1a-aee5-43ed23ad5f4c · outbound

This paper cites On the representation of a larger even integer as the sum of a prime and the product of at most two primes.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality On the representation of a larger even integer as the sum of a prime and the product of at most two primes

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 209f48cd-2d2c-45ab-99d6-91298c5d36e9 · outbound

This paper cites Mining Math Conjectures from LLMs: A Pruning Approach.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Mining Math Conjectures from LLMs: A Pruning Approach

Reference 3

Resolution: verified exact; arxiv_id, observed 2026-07-03T17:08:43.375958Z

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 abd11a4a-744c-4f85-8ca2-7bbd54619b14 · outbound

This paper cites Advancing mathematics by guiding human intuition with AI.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Advancing mathematics by guiding human intuition with AI

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3f41b403-26f0-41ef-a420-a3e13a75d446 · outbound

This paper cites Fel’s Conjecture on Syzygies of Numerical Semigroups.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Fel’s Conjecture on Syzygies of Numerical Semigroups

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 743edc32-0e4e-46bb-ab79-dde54f0290c8 · outbound

This paper cites Primes in Tuples I.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Primes in Tuples I

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a1d59bb-ee63-4193-8232-eed895f04e43 · outbound

This paper cites Primes in Tuples II.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Primes in Tuples II

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e483b65e-e30b-48f1-9217-f48e3e67aedf · outbound

This paper cites Primes in Tuples III: On the Difference pn+ν −p n.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Primes in Tuples III: On the Difference pn+ν −p n

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b3b1259-05ed-4181-b427-dfc1a9784c6f · outbound

This paper cites Primes in Tuples IV: Density of Small Gaps Between Consecutive Primes.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Primes in Tuples IV: Density of Small Gaps Between Consecutive Primes

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 474195c4-cbfc-4a73-b1ee-1bd71fdb554d · outbound

This paper cites Halberstam and H.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Halberstam and H

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38e02a56-5e00-4384-be4c-c5462c717e94 · outbound

This paper cites an unresolved cited work.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Unresolved cited work

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 610a51f9-fc9d-4da5-b7ab-6d5142f2fa2a · outbound

This paper cites Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59174165-f452-4c48-b7ac-001a3192f555 · outbound

This paper cites Harman.Prime-Detecting Sieves.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Harman.Prime-Detecting Sieves

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 087443ad-cd53-4255-bb49-d0203d203b58 · outbound

This paper cites Can AI make genuine theoretical discoveries?.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Can AI make genuine theoretical discoveries?

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 47b44489-3b83-4159-a374-31efea0c96bf · outbound

This paper cites Iwaniec and E.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Iwaniec and E

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a02f525d-a1e6-4266-9bef-1408cb5c073c · outbound

This paper cites Sur la distribution des nombres premiers.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Sur la distribution des nombres premiers

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db40f25f-cf42-466f-89c6-3a6bb8f6c9be · outbound

This paper cites Small Gaps between primes.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Small Gaps between primes

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6edb86a-060a-4c6d-8960-1949cf3af1cc · outbound

This paper cites The Twin Prime Conjecture.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality The Twin Prime Conjecture

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f496c4b-a3e6-4d7a-80c3-99cf0f950286 · outbound

This paper cites Twin primes and the parity problem.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Twin primes and the parity problem

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e40ca0ab-37b4-4842-9782-4586eaf1ba6d · outbound

This paper cites Nipkow, C.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Nipkow, C

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a84d777-d0b6-472b-a85c-d6b246ca60dc · outbound

This paper cites LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Proving.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Proving

Reference 21

Resolution: metadata mismatch; arxiv_id, observed 2026-07-03T17:08:43.379199Z

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 b98a3a23-4f64-4833-ae95-3855b82b6b72 · outbound

This paper cites Ueber die Anzahl der Primzahlen unter einer gegebenen Gr¨ osse.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Ueber die Anzahl der Primzahlen unter einer gegebenen Gr¨ osse

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91a6c4c5-8f88-4b99-a111-626c1881ec75 · outbound

This paper cites Annual Report.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Annual Report

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48aebde0-db07-472e-860d-2d93d8f1f962 · outbound

This paper cites Aristotle: IMO-level Automated Theorem Prov- ing.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Aristotle: IMO-level Automated Theorem Prov- ing

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6979a940-090d-44b8-8ca1-be2bcf3612c5 · outbound

This paper cites Olympiad-level formal mathematical reasoning with reinforcement learning.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Olympiad-level formal mathematical reasoning with reinforcement learning

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da2a699d-05e5-4213-a369-4809157f0f6d · outbound

This paper cites Tao.Open question: The parity problem in sieve theory.url:https : / / terrytao.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality Tao.Open question: The parity problem in sieve theory.url:https : / / terrytao

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 258ab55a-1e5f-4508-8dfc-2bc1d11d72f7 · outbound

This paper cites A Lean 4 library of formalized mathematics.

Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality A Lean 4 library of formalized mathematics

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-27T04:35:53.975397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.