{"as_of":"2026-08-22T10:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bc0968188f423790dd29845b4d7014aeea648098340a2dbfb3613449a9b8a124","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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.22851/citation-record","integrity":"/paper/2606.22851/integrity","json":"/paper/2606.22851/citation-record.json","paper":"/paper/2606.22851"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/s0025-5718-03-01501-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Prime sieves using binary qua- dratic forms","venue":"Mathematics of Computation","work_id":"360415f9-3729-4726-8e67-c800bb578e8f","year":2004},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:ed97c3e3254c3ca8c78b8baba01ad96ad552d2d862ff7da45976d5b74118c032","observation_id":"0ebcc4fe-e662-4440-9eab-c64b927cae7c","resolution":{"observed_at":"2026-06-26T07:39:08.408551Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-03338-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[BCS97] Peter Bürgisser, Michael Clausen, and Mohammad Amin Shokrollahi.Algebraic Complexity Theory, volume 315 ofGrundlehren Der Mathematischen Wissenschaften","venue":"Grundlehren der mathematischen Wissenschaften","work_id":"8b35bc37-39f7-44fc-9f16-4eb9ca78c445","year":1997},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:7771b326fe670bf01ff8f1f104f443f10d78e4336b01ecaf8f7814c33d2c8776","observation_id":"faa787d4-97b1-426f-8e8b-45323eabd4c2","resolution":{"observed_at":"2026-06-26T07:39:08.400259Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-12T22:50:28.10133+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T22:50:28.10133+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-49529-2_15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An incremental primal sieve","venue":"Lecture notes in computer science","work_id":"534b1e93-226e-421d-a45b-49dae08471ee","year":2016},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:7b1714473d6ec3fd011314c62801a28d612d85885cbf93447d6d4cba560a09d5","observation_id":"98bb52ce-6949-4095-9899-26bed6106e86","resolution":{"observed_at":"2026-06-26T07:39:08.399238Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/9781139049801.011","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Factoring polynomials over large finite fields","venue":null,"work_id":"aa4ef8ca-fc73-44cd-a998-7b5d5b97df31","year":2008},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:d56871d54f51ebe9fe2081ed9635ab42f37b1df0cacd474b424c43799b98606c","observation_id":"bd2f9f54-8cec-4c69-a9d4-328126d4ce52","resolution":{"observed_at":"2026-06-26T07:39:08.404476Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511921698","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cambridge University Press, Cambridge, 2011, pp","venue":"Cambridge University Press eBooks","work_id":"ebd9016a-d2de-4bb2-82b2-9e823f9f9d2a","year":2011},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:10fcf2dd1e7674da12cfacff087addeb18387a5ffc5edb892b78f1c520265beb","observation_id":"5a647021-deaf-48ca-9e55-0f163b75d97c","resolution":{"observed_at":"2026-06-26T07:39:08.406767Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511615993","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the order of magnitude of the difference between consecutive prime numbers","venue":"Cambridge University Press eBooks","work_id":"9cb10f39-088e-4636-b5d3-eb3a817dc5fc","year":2006},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:9332afed375b0eb10c387759f070d5b6d2834e5e0fbe9f262ed1ee7232cdf403","observation_id":"883b3bd3-90ee-4441-8af2-84e2e5f6ba90","resolution":{"observed_at":"2026-06-26T07:39:08.391451Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0020-0190(96)00099-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A space-efficient fast prime number sieve","venue":"Information Processing Letters","work_id":"dcc38e70-a72b-40a0-aefc-0c9f70d71dbc","year":1996},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:d90dff95f0f7da5eb6ee4dc40b7ea962aaadc45ac97b0d893b9b871344d557ac","observation_id":"c7fb8c25-6359-4414-9dba-8f721547c7f7","resolution":{"observed_at":"2026-06-26T07:39:08.393218Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/coll/057","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Prime chains and Pratt trees","venue":"Colloquium Publications - American Mathematical Society/Colloquium Publications","work_id":"ad650ac8-4272-4d2b-828e-e9c5ed8bdc63","year":2010},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:bac1de88924d6377fc13e63e02c9d109611bb1f13a65d4924680e0581a6a2e5e","observation_id":"025cab2c-e3e1-4935-9581-0a7b983ab08b","resolution":{"observed_at":"2026-06-26T07:39:08.387835Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-26T07:36:47.640239Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:92127a764acda750eeeed30bab87ac722a1893be7adfd79f76faa8c2808583a2","observation_id":"1d4855a3-e4b4-4806-9006-6a58ddab5015","resolution":{"observed_at":"2026-06-26T07:36:47.640239Z","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-26T07:36:47.640239Z","title":"Dissecting a sieve to cut its need for space","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:ecd9df4ed3417d7d421690d3e5ccc86b181c402228fad47970f250b5fd7b1ca0","observation_id":"49a6040f-46ae-4f63-a183-0dbe7a58580a","resolution":{"observed_at":"2026-06-26T07:36:47.640239Z","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":"10.1007/10722028_17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Primes in short intervals: heuristics and calculations","venue":"Lecture notes in computer science","work_id":"7da9eff4-90ca-4559-9eed-a419a5384643","year":2000},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:44b55ee17002ecd9263db0f48f14358cfd0e787ccb66a3802e7c47337229b68f","observation_id":"b246f2ad-1d1e-46e7-a8a3-ab622536c2e2","resolution":{"observed_at":"2026-06-26T07:39:08.416397Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-04658-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An improved sieve of Eratosthenes","venue":null,"work_id":"b9b8d085-a7ef-4a6f-b6f3-805dc6871f9a","year":2001},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:a4f81c2d0feaf37d82f7959ccaeffb184308629038089a11be801a0bcbafdedc","observation_id":"03e972e9-204d-4d91-af39-c425adc9c4c1","resolution":{"observed_at":"2026-06-26T07:39:08.402296Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4007/annals.2021.193.2.4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Integer multiplication in time 𝑂 (𝑛 log 𝑛)","venue":"Annals of Mathematics","work_id":"f01c4fa2-9c84-4177-8013-c18913589124","year":2021},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:f044d028d867d328374e88ad61d6da6e2c7620368756131cbe2dec93fb2ea097","observation_id":"5e3a089c-8e90-45d5-9a47-99576c3f1807","resolution":{"observed_at":"2026-06-26T07:39:08.393387Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3505584","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Even faster integer multiplication","venue":"Journal of the ACM","work_id":"7700c3d9-e15e-481b-b862-8a9395c08742","year":2022},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:4dc6b5b3ec5e4b639299397577c33d606d88b42b084e7c236c83b073340fc617","observation_id":"6ae18e19-7a42-488a-ac96-671f7d527668","resolution":{"observed_at":"2026-06-26T07:39:08.402878Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3005344","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[IK04] H","venue":"Journal of the ACM","work_id":"255d71bf-f639-4c99-8127-d6e2fcf9596d","year":null},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:46752c671bdf5718bb8bc0c26f74dc904579df5da91186ab9646138084c4af01","observation_id":"93c72323-4e60-462f-abcf-40515f620fec","resolution":{"observed_at":"2026-06-26T07:39:08.410462Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/coll/053","metadata_source":"crossref","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Kowalski, E","venue":"Colloquium Publications","work_id":"258fb4f3-f8bf-4af8-881a-1b43fcd029f4","year":2004},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:1ac9b093cc1398c07c6f191a2f6c6d5b5f56ffcf2509cf55b249f17c5f2daae4","observation_id":"0aed0794-7bb3-4717-8ac0-964460cc33e6","resolution":{"observed_at":"2026-06-26T07:39:08.412629Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-21T19:38:11.086663+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-21T19:38:11.086663+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-26T07:36:47.640239Z","title":"Addison-Wesley, Reading, MA, 1998, pp","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:3eea0a917fed39d03684bbf7982cc0d0ad471a0dabe0a2bf0669fb25a32619ec","observation_id":"f0758ec4-d35e-4ec7-b798-47ed89fac036","resolution":{"observed_at":"2026-06-26T07:36:47.640239Z","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-26T07:36:47.640239Z","title":"Addison-Wesley, Reading, MA, 1998, pp","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:9687702feead595506afc07192bdc607ee7861917f4a4ea32ddeae26ffc181f5","observation_id":"5fb2d220-51d1-42cf-b045-beee0ce7f111","resolution":{"observed_at":"2026-06-26T07:36:47.640239Z","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":"10.1090/gsm/203","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithms in algebraic number theory","venue":"Graduate studies in mathematics","work_id":"83ddbced-f5a6-4f34-873e-6465f1531ef5","year":2019},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:aca28293611b1989d5339478ab2219d569b10f16070afc0bbff05ade3c54bb38","observation_id":"956f472e-a397-41ab-9108-d238f52f4066","resolution":{"observed_at":"2026-06-26T07:39:08.414462Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/cbo9780511618314","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Vaughan, Robert C","venue":null,"work_id":"71351109-e6c3-4780-858e-4523dca349ed","year":2007},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:eae1fb75f326b067d8100af0a14c6c65d3b23e7b45b3f243a10220f7d21fa53d","observation_id":"9fec5b9b-1796-41c0-af62-724d8fb31273","resolution":{"observed_at":"2026-06-26T07:39:08.384031Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-12T10:19:44.136577+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T10:19:44.136577+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+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-26T07:36:47.640239Z","title":"Sorting and element distinctness on one-way Turing ma- chines","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:caec47c9b79945dabe3485467c3535512234f4eeab12b4a7912d916368d14e3e","observation_id":"e8de666e-c2b0-4b46-9ea1-79f198bba1fb","resolution":{"observed_at":"2026-06-26T07:36:47.640239Z","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":"10.1007/978-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T14:16:16.764150Z","title":"In: Proc","venue":null,"work_id":"452f975d-5e1f-47e0-967f-db1ed9da0d80","year":2025},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:fd2fcc9e53ba0ac196396683ccb34588c95dd0b9e5a5c23d7132fe390ff682d6","observation_id":"d8130b16-685f-4036-ad23-329a6f3c5d69","resolution":{"observed_at":"2026-06-26T07:39:08.376973Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00264164","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A sublinear additive sieve for finding prime numbers","venue":"Acta Informatica","work_id":"5e605c89-9f1e-44b5-912a-c75ae8b0967c","year":1981},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:2d8c70095055cd4ecbd46aeb1391bc46f3952e5979f0ff606a100db56743d423","observation_id":"2cc05339-368c-476f-8b81-b0591caebcd3","resolution":{"observed_at":"2026-06-26T07:39:08.418180Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-58691-1_67","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Polynomial codes over certain finite fields","venue":"Lecture notes in computer science","work_id":"1c7735c5-246b-4df0-931d-ae7291d67835","year":1994},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:f5a205874ba27f53aa5ce6ac08779e4fc82f1990eb052bc435b4891c38d03890","observation_id":"d2987973-084e-4632-a6b2-63e02873e43c","resolution":{"observed_at":"2026-06-26T07:39:08.379234Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.01154","last_updated":"2016-04-05T07:05:21Z","snapshot_observed_at":"2026-08-14T22:03:04.038405Z","submitted_at":"2016-04-05T07:05:21Z","title":"On the complexity of computing prime tables on a Turing machine","version":1},"cited_work":{"arxiv_id":"1604.01154","doi":"10.1007/bf00289470","metadata_source":"pith","pith_arxiv_id":"1604.01154","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"On the complexity of computing prime tables on a Turing machine","venue":"cs.DS","work_id":"2394da2c-b277-4009-b293-4aa377297b55","year":2016},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/1604.01154","citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:de056aa09e8d2d6dd148ed3eee1436856685ad83feb3975f253d620d5d863b4c","observation_id":"d0fbb335-9ef3-4ad1-94c1-3756c41580d0","resolution":{"observed_at":"2026-06-26T07:39:08.382043Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/2008704","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the complexity of computing prime tables on the Turing machine","venue":"Mathematics of Computation","work_id":"6c4f606f-05e1-43e4-9eb6-959c8c7df42d","year":2016},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:ac09e951bc2c8588ef3e9f7e7d6df1854bac8a087e7f7a2298af99d3aea2997a","observation_id":"1f053679-f0a4-43ab-ae5e-4ce0e4b86080","resolution":{"observed_at":"2026-06-26T07:39:08.386156Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11792086_15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two compact incremental prime sieves","venue":"Lecture notes in computer science","work_id":"86c18100-89b1-49bf-af39-86f4ef3afe3f","year":2006},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:d8f660d39b19cad52504e2c61a5e11c4fa04babd093b363f85f91f8e3d8397c6","observation_id":"635b86ba-1dc1-4bf2-aadd-646ff3581d9a","resolution":{"observed_at":"2026-06-26T07:39:08.375299Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0054861","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two fast parallel prime number sieves","venue":"Lecture notes in computer science","work_id":"481f3db8-e7b3-467f-bb73-e1613ea9379f","year":1998},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:59b6e4db4d1acac9c5743835c20e72e5eccbe96ed975a301034df5974de60732","observation_id":"29b56ab3-3f0f-4168-9a62-4ee9a3b88c9d","resolution":{"observed_at":"2026-06-26T07:39:08.377186Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/gsm/163","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tenenbaum.Introduction to Analytic and Probabilistic Number Theory","venue":"Graduate studies in mathematics","work_id":"5c333282-1b4b-4eeb-aa2d-1e24bd7c0d74","year":2015},"citing_paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T07:36:47.640239Z"},"links":{"citing_paper":"/paper/2606.22851"},"observation_digest":"sha256:22508810007c2f885f60306ae1648383a0f6ee82b5c11a2cbf8061ce0a1ee32f","observation_id":"90590400-e0b1-4e0d-8e83-347d873eb952","resolution":{"observed_at":"2026-06-26T07:39:08.370689Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.22851","last_updated":"2026-06-22T04:54:20Z","latest_version":1,"primary_category":"math.NT","snapshot_observed_at":"2026-08-21T17:35:21.129661Z","submitted_at":"2026-06-22T04:54:20Z","title":"Faster enumeration of primes"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":1,"metadata_mismatch":6,"parse_uncertain":0,"unresolved":5,"verified_exact":17,"verified_fuzzy":0},"total_outbound_references":29},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2606.22851."}