{"as_of":"2026-08-13T03:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:54fb029dc0e09220804bfd63bc7c5103ca05a21b1d3c949283bc0d99bcc623b3","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T04:35:53.975397Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.14804/citation-record","integrity":"/paper/2606.14804/integrity","json":"/paper/2606.14804/citation-record.json","paper":"/paper/2606.14804"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.04942","last_updated":"2026-06-02T13:29:28Z","snapshot_observed_at":"2026-08-08T13:30:59.720984Z","submitted_at":"2025-04-07T11:30:36Z","title":"Lemmanaid: Neuro-Symbolic Lemma Conjecturing","version":6},"cited_work":{"arxiv_id":"2504.04942","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.04942","snapshot_observed_at":"2026-07-03T17:08:43.372259Z","title":"Lemmanaid: Neuro-Symbolic Lemma Conjecturing","venue":"cs.AI","work_id":"568206f2-f162-49e4-9749-418c58b665b6","year":2025},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"cited_paper":"/paper/2504.04942","citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:99af35d6fb8baa86b601e27ba5443163f8c29635c652fe0090e52e5f93830c35","observation_id":"e6b0779b-4a10-4b3a-a38a-2444ed20c8e2","resolution":{"observed_at":"2026-07-03T17:08:43.373459Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"On the representation of a larger even integer as the sum of a prime and the product of at most two primes","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:1076ae0cb416f7d187c5c377b01d9f5f107f4cf0c156ea8d2a878ea6e7aa5e82","observation_id":"8dd0d6ff-17c4-4e1a-aee5-43ed23ad5f4c","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16177","last_updated":"2024-12-09T19:00:38Z","snapshot_observed_at":"2026-08-11T19:16:08.508668Z","submitted_at":"2024-12-09T19:00:38Z","title":"Mining Math Conjectures from LLMs: A Pruning Approach","version":1},"cited_work":{"arxiv_id":"2412.16177","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.16177","snapshot_observed_at":"2026-07-03T17:08:43.374528Z","title":"Mining Math Conjectures from LLMs: A Pruning Approach","venue":null,"work_id":"7908223e-0b38-48e8-8bff-cc97f57e0133","year":2024},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"cited_paper":"/paper/2412.16177","citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:b2d98cb7ad49577fe19c0865f3e63f2365cfff381e487348de08cfcbbcc323a6","observation_id":"209f48cd-2d2c-45ab-99d6-91298c5d36e9","resolution":{"observed_at":"2026-07-03T17:08:43.375958Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Advancing mathematics by guiding human intuition with AI","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:4f9cd25b5d6fda29a14400a0c036f40f8c878b8d9e701e4cc7781dc597a710c5","observation_id":"abd11a4a-744c-4f85-8ca2-7bbd54619b14","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Fel’s Conjecture on Syzygies of Numerical Semigroups","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:18344223c9af13e017410db4d1b8347a5a0e4ebb9e00fc478343670619bad745","observation_id":"3f41b403-26f0-41ef-a420-a3e13a75d446","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Primes in Tuples I","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:8d2dcb6f924b4403d125126b2f2dae637807018878cea53d28d1e3a1f85bbef6","observation_id":"743edc32-0e4e-46bb-ab79-dde54f0290c8","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Primes in Tuples II","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:ebfb394c08bac61338dc2ba84c6810fe8a6e8ff2b3e2439f77976a7aec7d8bfc","observation_id":"4a1d59bb-ee63-4193-8232-eed895f04e43","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Primes in Tuples III: On the Difference pn+ν −p n","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:d3869c63e0c60eb31073e278b889ad2f6ea7edf7b58c5f07e3d6d9b5f58eca5a","observation_id":"e483b65e-e30b-48f1-9217-f48e3e67aedf","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Primes in Tuples IV: Density of Small Gaps Between Consecutive Primes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:7dad583d81d7a5b0753b9227390eb53f7345c4444633a4cfd223d1d7b30105f6","observation_id":"5b3b1259-05ed-4181-b427-dfc1a9784c6f","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Halberstam and H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:d4fed8fc42ade47b97165570c6c8294fe514df57cbd90d76295a4d96dcbd580c","observation_id":"474195c4-cbfc-4a73-b1ee-1bd71fdb554d","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:bc72b97ac7216be329d2725606b1e6a1cfc7177bd5d6db27e3d2c98b82cabcb6","observation_id":"38e02a56-5e00-4384-be4c-c5462c717e94","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes","venue":null,"work_id":null,"year":1923},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:c532ae898b85809174dad879df09bc7b4cbc504ac6119e6ef4ac372666baba7d","observation_id":"610a51f9-fc9d-4da5-b7ab-6d5142f2fa2a","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Harman.Prime-Detecting Sieves","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:6c3e2e2c8f3cb5dbeb91eaf15633f0b0a1f638c6f9a16167b16ca8f9ce98eaec","observation_id":"59174165-f452-4c48-b7ac-001a3192f555","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Can AI make genuine theoretical discoveries?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:b40ec8f067e9f9b8ec58c7e127f514d1531696436911dd9526d6718684831e1b","observation_id":"087443ad-cd53-4255-bb49-d0203d203b58","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Iwaniec and E","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:4d6765130d3fd52235f2a9b5910a7de831a9fa50f54acd45eea4779bb735ad61","observation_id":"47b44489-3b83-4159-a374-31efea0c96bf","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Sur la distribution des nombres premiers","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:45825db6c0d10a29489423e7ca166f1757da388237209537eed62c69406dbc7b","observation_id":"a02f525d-a1e6-4266-9bef-1408cb5c073c","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Small Gaps between primes","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:5f28a0174a86621d9cf8a7959f3432a370aedfe6c61afe2ed042900e80abec27","observation_id":"db40f25f-cf42-466f-89c6-3a6bb8f6c9be","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"The Twin Prime Conjecture","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:0a3e3e81703ed3c70f91752f7c264a376d5717c8ff0e950d840c1d229628c2bc","observation_id":"c6edb86a-060a-4c6d-8960-1949cf3af1cc","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Twin primes and the parity problem","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:516e4f62033513f144926dbc53a8ef0cca4f06099a98c90e0e74583156d86eda","observation_id":"4f496c4b-a3e6-4d7a-80c3-99cf0f950286","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Nipkow, C","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:b76dabfcec307dd9341f27efbb102bd5f44900ac451cf0722f6d403236f821c0","observation_id":"e40ca0ab-37b4-4842-9782-4586eaf1ba6d","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.22005","last_updated":"2025-06-27T08:17:18Z","snapshot_observed_at":"2026-08-12T13:08:39.712616Z","submitted_at":"2025-06-27T08:17:18Z","title":"LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Proving","version":1},"cited_work":{"arxiv_id":"2506.22005","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22005","snapshot_observed_at":"2026-07-04T00:09:14.869018Z","title":"arXiv preprint arXiv:2506.22005 , year =","venue":null,"work_id":"01e099ac-ae5e-488c-b9e7-8fef6f3fd753","year":2025},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"cited_paper":"/paper/2506.22005","citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:5d03f8279017f3c7ead0806738a1c34a1eaf194f9100a08735a4da0f5ede7fca","observation_id":"0a84d777-d0b6-472b-a85c-d6b246ca60dc","resolution":{"observed_at":"2026-07-03T17:08:43.379199Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Ueber die Anzahl der Primzahlen unter einer gegebenen Gr¨ osse","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:1e6f0b662fdf5d285aa9dee4f626ea97764a734dd27b9a47e597a675d8f414aa","observation_id":"b98a3a23-4f64-4833-ae95-3855b82b6b72","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Annual Report","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:b09ed2bf1ebf9b2535e319fcef8be1fceb62ba7e06a1c6b33712498567593d82","observation_id":"91a6c4c5-8f88-4b99-a111-626c1881ec75","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Aristotle: IMO-level Automated Theorem Prov- ing","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:f78029161da1ad351fa95332a541942db894d47b270784e7351886b4a3a69cf0","observation_id":"48aebde0-db07-472e-860d-2d93d8f1f962","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Olympiad-level formal mathematical reasoning with reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:65ba9d5d7f3d5a5197fedc7c15579c21596feaf330a9c31ff221ebba6f40f5eb","observation_id":"6979a940-090d-44b8-8ca1-be2bcf3612c5","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"Tao.Open question: The parity problem in sieve theory.url:https : / / terrytao","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:64507b7bcc61a7e64faee03118caf3f87ed118ad83253f12eb0235fab6718e4c","observation_id":"da2a699d-05e5-4213-a369-4809157f0f6d","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T04:35:53.975397Z","title":"A Lean 4 library of formalized mathematics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T04:35:53.975397Z"},"links":{"citing_paper":"/paper/2606.14804"},"observation_digest":"sha256:80f42086a50276910645b072dced9e7c064fd178782ce0399bc0af4b1e1b7f47","observation_id":"258ab55a-1e5f-4508-8dfc-2bc1d11d72f7","resolution":{"observed_at":"2026-06-27T04:35:53.975397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.14804","last_updated":"2026-06-22T21:41:00Z","latest_version":2,"primary_category":"math.GM","snapshot_observed_at":"2026-08-08T13:30:40.718601Z","submitted_at":"2026-06-11T21:23:56Z","title":"Mapping Mathematical Hardness: Machine-Assisted Conjecture Discovery and the Quantification of Non-Triviality"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":24,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}