{"as_of":"2026-08-14T12:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:243fa3f8ae2e10bda449fd347b83f41ad5c78dce25d7fb8534639733318b4c39","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:53:02.391259Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2607.29453/citation-record","integrity":"/paper/2607.29453/integrity","json":"/paper/2607.29453/citation-record.json","paper":"/paper/2607.29453"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539704443793","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator","venue":"SIAM Journal on Computing","work_id":"a9b15c8a-e3bb-4abd-9886-68bbee2fe00c","year":2007},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:00.346527Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:f8b6c783fdbfbdd11de73c61f4d7cf323a553c4c7c166da9b0410acc38e43fc7","observation_id":"edd37d49-a5f8-47fe-bf19-98f606aa1482","resolution":{"observed_at":"2026-08-03T06:53:23.758080Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:41.609576+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:41.609576+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/s0025-5718-2014-02800-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Search for Wilson Primes","venue":"Mathematics of Computation","work_id":"ca372c32-81e5-4794-bfb9-e02050c5eae0","year":2014},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:00.445948Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:61a2c83aedc7810ef68b3a455422eb73e14ec6c3fe537ba2a66efd8733a8c1ee","observation_id":"c1679e10-8317-4268-9ad9-a7de6d261a28","resolution":{"observed_at":"2026-08-03T06:53:23.617722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:41.791531+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:41.791531+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1006/jnth.1995","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:53:23.397861Z","title":"On Jacobi Sums, Multinomial Coefficients, andp-adic Hypergeometric Func- tions","venue":null,"work_id":"4e8866dd-3852-4a78-831d-e0f850a1ee0a","year":1995},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:00.590327Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:f8deb458757b4abaf7f46ac36bdba215a7c38f27524246ae203bd9e0de822c9c","observation_id":"21c92883-f665-4826-8cb5-4be9d3647dac","resolution":{"observed_at":"2026-08-03T06:53:23.479002Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:41.958241+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:41.958241+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0207131","last_updated":"2002-07-23T00:53:31Z","snapshot_observed_at":"2026-08-13T13:49:50.341495Z","submitted_at":"2002-07-23T00:53:31Z","title":"Efficient Quantum Algorithms for Estimating Gauss Sums","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0207131","snapshot_observed_at":"2026-08-03T06:53:00.715200Z","title":"van Dam and G","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:00.715200Z"},"links":{"cited_paper":"/paper/quant-ph/0207131","citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:9210060ca55506d2a9891cc456f29be4ef3e5ac8b4202ab2fe5e25983a5f8abb","observation_id":"1692f3f0-28a0-4b38-8653-0055b0d260c4","resolution":{"observed_at":"2026-08-03T06:53:00.715200Z","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.1017/s000497270003207x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lattice Basis Reduction, Jacobi Sums and Hyperelliptic Cryp- tosystems","venue":"Bulletin of the Australian Mathematical Society","work_id":"75c82413-54c9-448f-98fc-70c886d5ac5d","year":1998},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:00.818237Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:948350974404c34d344df7f17f374e08d6b51265119751ed11a08567bf74140d","observation_id":"83e1691d-c7c7-4e29-8684-7df5d54559ee","resolution":{"observed_at":"2026-08-03T06:53:23.393666Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:42.092924+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:42.092924+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-03T06:53:00.909170Z","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:00.909170Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:83d4a6481985990808167376a42b6369d349a2d011f8484dd2d5f6e1f65aff8b","observation_id":"7a69162d-2262-4620-b854-05b8941b983c","resolution":{"observed_at":"2026-08-03T06:53:00.909170Z","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-08-03T06:53:01.014434Z","title":"Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.014434Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:2b24c5b4646a252d3a0993a5d17ffcfd4723628392435537f3adc4feabaaddc7","observation_id":"2093c5ab-e976-4db6-bcc3-9a5e7cbf9c11","resolution":{"observed_at":"2026-08-03T06:53:01.014434Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/imrn/rnq045","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Divisors of Shifted Primes","venue":"International Mathematics Research Notices","work_id":"bcbec8d1-9152-4b31-83ae-0949a2a4c28c","year":2010},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.093989Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:6dae4434dfc4540ce4d1a0a884f069ca905ca7f271349caf3157a6e6074b3ab7","observation_id":"d017a500-221a-423d-a8dc-5f83b3e50a62","resolution":{"observed_at":"2026-08-03T06:53:23.098279Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:42.390571+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:42.390571+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-03T06:53:01.177584Z","title":"Einige Resultate über Berechnungskomplexität","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.177584Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:8b8a7dc582f755e5126e3caee28634007511ef3d8892532a0a8c97315a700515","observation_id":"de20ba0a-33bb-4a0a-bcac-2c166c48088c","resolution":{"observed_at":"2026-08-03T06:53:01.177584Z","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-1-4419-7155-5_33","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Factoring and Factorials","venue":null,"work_id":"83186777-f753-457c-adbc-b7c0e508bc34","year":2010},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.265704Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:e0db48d45e7e0e9111de362d0f11f4e7d12963d6613bc07d121db2da083bf354","observation_id":"3b027c45-afe8-4fd0-bb64-07aedf74ae72","resolution":{"observed_at":"2026-08-03T06:53:22.752864Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:42.579086+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:42.579086+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/s0273-0979-1989-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:53:22.514140Z","title":"On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines","venue":null,"work_id":"910c4b02-7b0a-47f4-957f-9c0b1d595c98","year":1989},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.358152Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:042c0cef9cdd47afb2fa8961072bf55275554691002f35d3e7baaf1fcef479c9","observation_id":"a77d7644-d9e2-4503-9d9d-1b39a8063e33","resolution":{"observed_at":"2026-08-03T06:53:22.632646Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-03T06:53:01.435478Z","title":"On the Intractability of Hilbert’s Nullstellensatz and an Algebraic Version of “NP̸=P?","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.435478Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:c5675daef8d300003fb9692e58ae113d31ffcbd5fbabea902cfba459c5ad6b3b","observation_id":"1eb41454-8d7f-4e6b-a3be-4e2ed3c8a04b","resolution":{"observed_at":"2026-08-03T06:53:01.435478Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/1971363","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Factoring Integers with Elliptic Curves","venue":"Annals of Mathematics","work_id":"1287ce57-4eae-4be1-b03a-bd4fc2e5087c","year":1987},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.581039Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:4fdb336e785f054928df7114f13c1b8b5dbe48481e068317c1972e485efc1cbb","observation_id":"60723031-9727-4ca7-a9c2-3ed4352beef8","resolution":{"observed_at":"2026-08-03T06:53:22.364722Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:42.714821+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:42.714821+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.06.020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the Ultimate Complexity of Factorials","venue":"Theoretical Computer Science","work_id":"5cdcc535-fbb9-4115-9a58-45a331ffb492","year":2004},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.685378Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:bbc9472a9191f7d61ab87e07a62d3e69d1cf0b3e13345d0a03f51c1a8b4aecb2","observation_id":"898abc74-7e22-4cec-a42b-e80b59df8f2d","resolution":{"observed_at":"2026-08-03T06:53:22.230108Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:42.851466+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:42.851466+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-03T06:53:01.781874Z","title":"Gauss–Jacobi Sums and Stickelberger’s Theorem","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.781874Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:7ad784d0ccb1b9be89011affd7f2e66f3b56c8e0133f14de8471cc7c225d0c19","observation_id":"00421be6-a34f-47a5-9738-8b016c9b42b6","resolution":{"observed_at":"2026-08-03T06:53:01.781874Z","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-08-03T06:53:01.882251Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.882251Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:67bce4101195a7575c2305fdc7ca462fa71f4b1496e52677e8f65d9d22ce529e","observation_id":"8c8e4454-af3b-4a58-8d53-c6800755f7f7","resolution":{"observed_at":"2026-08-03T06:53:01.882251Z","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-08-03T06:53:01.986490Z","title":"A Quantum Algorithm for Computing the Unit Group of an Arbitrary Degree Number Field","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:01.986490Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:d67b72f9fb8839769af032e6329c8936529c65ddee7edee4a4dc1cad2b20d085","observation_id":"2fbc801c-e273-4e52-95fc-91525087546d","resolution":{"observed_at":"2026-08-03T06:53:01.986490Z","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.1137/1.9781611974331.ch64","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Quantum Algorithms for Computing Class Groups and Solving the Principal Ideal Problem in Arbitrary Degree Number Fields","venue":null,"work_id":"d8a3e0f4-1136-4070-91c2-e7d0facfda38","year":2016},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:02.072854Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:010cf968eb76e100d30218825349fb017e8d20bf33a748e1185f8d9ff81e67cc","observation_id":"55ae52e4-957e-43ce-9077-33552cf800e7","resolution":{"observed_at":"2026-08-03T06:53:22.012027Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-11T00:08:43.161073+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-11T00:08:43.161073+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-03T06:53:02.198872Z","title":"Biasse and F","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:02.198872Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:0761bfb5ded67b8c8f69ad18436083be99e018552e0171da2f92568b36e780d4","observation_id":"8a9d7442-17de-49d0-af33-f698d8c0efaa","resolution":{"observed_at":"2026-08-03T06:53:02.198872Z","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-08-03T06:53:02.306277Z","title":"Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:02.306277Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:291597223561e5c5d00678e1f26b5094119a294ae43bb18ed0b2ee1606f4986b","observation_id":"59e3e4ec-87b6-4a29-b567-46a440fad67c","resolution":{"observed_at":"2026-08-03T06:53:02.306277Z","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-08-03T06:53:02.391259Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T06:53:02.391259Z"},"links":{"citing_paper":"/paper/2607.29453"},"observation_digest":"sha256:4a2988063553b6dd6d82453e101339c469a826d8c9feb1af36df3125de0fadc0","observation_id":"b4f3f0d4-e896-44e2-8f4c-b7077e040246","resolution":{"observed_at":"2026-08-03T06:53:02.391259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.29453","last_updated":"2026-07-31T14:15:12Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-07T21:54:46.567849Z","submitted_at":"2026-07-31T14:15:12Z","title":"Quantum Algorithms for Modular Factorials"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":21},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2607.29453."}