{"as_of":"2026-08-13T02:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13afec829c1c4b9a3b810d91e3274562c089f1120b131450751b26bac189674c","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:39:43.073563Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"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/2608.03220/citation-record","integrity":"/paper/2608.03220/integrity","json":"/paper/2608.03220/citation-record.json","paper":"/paper/2608.03220"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:39:43.485184Z","title":"Fine- grained hardness of CVP(P) – everything that we can prove (and nothing else)","venue":null,"work_id":"649d8e31-3309-4e29-aafb-b9ec96d53007","year":2021},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:42.893369Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:36afc9497077049a96d70b7b5981006c1ffe9acb3dd92ccfe273cdb9c84032ff","observation_id":"77e8a09d-7d70-40cc-8532-cef12c859960","resolution":{"observed_at":"2026-08-05T23:39:43.489779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"10.1109/focs.2015","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T23:39:43.224837Z","title":null,"venue":null,"work_id":"25be8cf9-f308-4a0b-a519-5994b6e28fab","year":2015},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:42.907868Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:b6954ec805afb266e8b0c663f6b60a9060c71cb25147b65a9155121fb9f6aee7","observation_id":"aef1b63d-3915-4d73-b9db-dc4e5d02a6af","resolution":{"observed_at":"2026-08-05T23:39:43.229197Z","resolver_source":"doi","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":"10.1137/1.9781611978315","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"3c18f978-4d7c-44f6-a2fc-41777f910df9","year":null},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.016924Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:1bcf70f31af8a394b5ce797ea49671ca2a31967f949e43f38864936830c2aad9","observation_id":"4f30122b-2b5f-4996-8bd5-e5ad508216ba","resolution":{"observed_at":"2026-08-05T23:39:43.212820Z","resolver_source":"doi","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":"10.4086/toc.2016.v012a002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[DRS14] Daniel Dadush, Oded Regev, and Noah Stephens-Davidowitz","venue":"Theory of Computing","work_id":"621213ba-7e6d-4a67-a0cc-21d19ee35de3","year":2016},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.040878Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:1b63bc701f8e110a4a3416b35904c07bce78851fef94271c1d5938ff102f4651","observation_id":"1092c05d-ca54-44e3-8184-c922b943609b","resolution":{"observed_at":"2026-08-05T23:39:43.167932Z","resolver_source":"doi","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-08-05T23:39:43.051164Z","title":"26 [GPV08] Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.051164Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:50c10066499e5422a17a3b6f9ee69afadfc0b7beab241eed2e2d47f496f3f164","observation_id":"5a8bff85-ace6-4ac3-b8c9-cb22bd1c403f","resolution":{"observed_at":"2026-08-05T23:39:43.051164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2608.02478","last_updated":"2026-08-04T03:43:30Z","snapshot_observed_at":"2026-08-12T13:01:41.378579Z","submitted_at":"2026-08-03T16:46:49Z","title":"Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian","version":2},"cited_work":{"arxiv_id":"2608.02478","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.02478","snapshot_observed_at":"2026-08-05T23:39:43.269461Z","title":"Solving the Shortest Vector Problem in $2^{0.6039n}$ Time via Mid-point Hessian","venue":"cs.DS","work_id":"d8bf2bbb-66f5-4bb8-84d7-b6199be679a4","year":2026},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.055614Z"},"links":{"cited_paper":"/paper/2608.02478","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:71bd66ebc5ed18872e1b54b5b8d5a35f45f56b8654892d1a20c0ec7f18703b19","observation_id":"52bacc4f-30f7-4f28-943a-e727016061c6","resolution":{"observed_at":"2026-08-05T23:39:43.274323Z","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":"10.4230/oasics.sosa.2018.12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Just take the average! an embarrassingly simple 2 n-time algorithm for SVP (and CVP)","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"07f9b1dc-14a5-4a7f-b8de-49f06420d6ce","year":2018},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.021889Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:c64211a1d80456225d9d0d64fa7b0b5b431c37bcc1c62dba7967b59ca4cc52fa","observation_id":"7194fe4f-994a-48f2-8986-66c396e98029","resolution":{"observed_at":"2026-08-05T23:39:43.198630Z","resolver_source":"doi","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-08-05T23:39:43.059873Z","title":"[MV13] Daniele Micciancio and Panagiotis Voulgaris","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.059873Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:cff106ab9d2078f83a736c19b5b9ad0aca72d18c2f5078f8179c7e5bd98efb50","observation_id":"9acb4076-1a0d-40cf-b0f0-92316fc22122","resolution":{"observed_at":"2026-08-05T23:39:43.059873Z","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-3-032-25327-9_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T11:07:33.414567Z","title":"[PS26] Amaury Pouly and Yixin Shen","venue":"Lecture notes in computer science","work_id":"313003a8-7653-448c-ac7e-74517f80e0ae","year":2009},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.069142Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:ef04e874df15c8939ba37b0256bfa055b99796e83f71d16d2ad84389e9165f35","observation_id":"2a43a848-fd65-48df-a6d0-8c367f3cce46","resolution":{"observed_at":"2026-08-05T23:39:43.127920Z","resolver_source":"doi","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":{"arxiv_id":"1306.0281","last_updated":"2013-06-03T03:04:57Z","snapshot_observed_at":"2026-08-12T21:30:25.584832Z","submitted_at":"2013-06-03T03:04:57Z","title":"Classical Hardness of Learning with Errors","version":1},"cited_work":{"arxiv_id":"1306.0281","doi":null,"metadata_source":"pith","pith_arxiv_id":"1306.0281","snapshot_observed_at":"2026-08-05T23:39:43.425917Z","title":"Classical Hardness of Learning with Errors","venue":"cs.CC","work_id":"e24a7dcb-3119-405b-92e3-cd705a63cdbf","year":2013},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.026716Z"},"links":{"cited_paper":"/paper/1306.0281","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:38fbaec69b935f0306468a414915f599980a96ca0669a17c30902f35a161c971","observation_id":"fc9ab3e1-4c7b-4695-928a-c932d7490164","resolution":{"observed_at":"2026-08-05T23:39:43.430965Z","resolver_source":"local_arxiv","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":{"arxiv_id":"1412.7994","last_updated":"2015-09-15T17:47:49Z","snapshot_observed_at":"2026-07-06T04:04:45.963762Z","submitted_at":"2014-12-26T21:36:03Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","version":5},"cited_work":{"arxiv_id":"1412.7994","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.7994","snapshot_observed_at":"2026-08-05T23:39:43.449005Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","venue":"cs.DS","work_id":"4a51279a-e721-414f-8e7e-0cafe68f095c","year":2014},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:42.903360Z"},"links":{"cited_paper":"/paper/1412.7994","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:0bbd2b7aea729565820fff7747e8def65174e727745df057b61db059365131e4","observation_id":"ffbd6501-d373-43ce-b6aa-b8e0e83d2dc7","resolution":{"observed_at":"2026-08-05T23:39:43.454744Z","resolver_source":"local_arxiv","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":"10.1137/1.9781611974331.ch121","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[SZ24] Naser Talebizadeh Sardari and Masoud Zargar","venue":null,"work_id":"370165ef-9267-4245-980f-9a11c4092b88","year":2024},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.073563Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:c9dd1e55223086b3b747f6f2e6e42308532ae3e8f2c1b365b0282bf15cc5ffc5","observation_id":"1990094a-ea3d-4b86-99bd-373a8c1be3eb","resolution":{"observed_at":"2026-08-05T23:39:43.112213Z","resolver_source":"doi","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":"10.26421/qic18.3-4-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[CDLP13] Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, and Chris Peikert","venue":"Quantum Information and Computation","work_id":"5c08144b-afe3-4359-9568-ea38d1607a4c","year":2013},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.031417Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:0d73756809cfe9d261beec4ccbcb113d6693ff30d3c3af486ee4a705a62b8356","observation_id":"23c855f7-6ba3-4530-a7fe-4c92fdfd5e30","resolution":{"observed_at":"2026-08-05T23:39:43.183484Z","resolver_source":"doi","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":{"arxiv_id":"2002.02633","last_updated":"2020-02-07T06:02:52Z","snapshot_observed_at":"2026-07-06T08:55:29.383108Z","submitted_at":"2020-02-07T06:02:52Z","title":"On the extreme zeros of Jacobi polynomials","version":1},"cited_work":{"arxiv_id":"2002.02633","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.02633","snapshot_observed_at":"2026-08-05T23:39:43.246764Z","title":"On the extreme zeros of Jacobi polynomials","venue":"math.CA","work_id":"f06a9703-3994-4d23-97fe-3b8fcbde9224","year":2020},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.064145Z"},"links":{"cited_paper":"/paper/2002.02633","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:139354c374d0fa30e23874fbab067f322810c1780db42ee1a432a4c6a2d29921","observation_id":"d4ece076-837b-4632-95d5-50aca4c9eaef","resolution":{"observed_at":"2026-08-05T23:39:43.252432Z","resolver_source":"local_arxiv","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":"10.1007/978-981-99-8739-9_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"[GFH26] Yiming Gao, Yansong Feng, and Honggang Hu","venue":"Lecture notes in computer science","work_id":"3099818d-d8cf-4594-925d-d333c389bdb5","year":2026},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.046443Z"},"links":{"citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:de5fbffbd9f39b027e47c645915807d4ca538bec4cb5e92585da8c7dc5bbc570","observation_id":"ed0b84dd-9c1d-4261-a2eb-52d2a76b7767","resolution":{"observed_at":"2026-08-05T23:39:43.153218Z","resolver_source":"doi","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":{"arxiv_id":"2002.07955","last_updated":"2025-08-17T11:17:31Z","snapshot_observed_at":"2026-08-12T23:31:52.976915Z","submitted_at":"2020-02-19T01:38:34Z","title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07955","snapshot_observed_at":"2026-08-05T23:39:42.898145Z","title":"[ADRS15] Divesh Aggarwal, Daniel Dadush, Oded Regev, and Noah Stephens-Davidowitz","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:42.898145Z"},"links":{"cited_paper":"/paper/2002.07955","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:2e1636de073b4843dff02cdec1b6bff753f1acc5e8e10e3da401c2f3915e4006","observation_id":"77658ccd-ad4a-4c2f-9129-39698c686470","resolution":{"observed_at":"2026-08-05T23:39:42.898145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.20133","last_updated":"2026-05-19T17:17:29Z","snapshot_observed_at":"2026-08-08T01:12:26.236960Z","submitted_at":"2026-05-19T17:17:29Z","title":"Quantum algorithm for Discrete Gaussian Sampling","version":1},"cited_work":{"arxiv_id":"2605.20133","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.20133","snapshot_observed_at":"2026-08-05T23:39:43.400655Z","title":"Quantum algorithm for Discrete Gaussian Sampling","venue":"quant-ph","work_id":"abe86baa-70f9-480e-98df-a6a18ce19d41","year":2026},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:43.036060Z"},"links":{"cited_paper":"/paper/2605.20133","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:0693e24211d84abb17cce655936f12a5937b343e73cc250580f33512406f663a","observation_id":"82319287-fa41-4363-b054-eea12ee299e0","resolution":{"observed_at":"2026-08-05T23:39:43.406715Z","resolver_source":"local_arxiv","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"}}],"paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":3,"verified_exact":9,"verified_fuzzy":1},"total_outbound_references":17},"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 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2608.03220."}