{"as_of":"2026-08-16T07:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2a3dd717f3769f304e1a35ca2f088df2b5a2ebf16c1c57e08ac224afc300920f","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:18:47.940775Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03724/citation-record","integrity":"/paper/1908.03724/integrity","json":"/paper/1908.03724/citation-record.json","paper":"/paper/1908.03724"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.7994","last_updated":"2015-09-15T17:47:49Z","snapshot_observed_at":"2026-08-14T23:06:02.846640Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.7994","snapshot_observed_at":"2026-08-14T14:18:47.207353Z","title":"Solving the Shortest Vector Problem in 2^n time via Discrete Gaussian Sampling","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.207353Z"},"links":{"cited_paper":"/paper/1412.7994","citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:cb33b44c3ff462cae7534c55a2e4568c3e990de2c6a37155dfb2bea251680475","observation_id":"72edec95-a732-49b3-b6fb-005dbef43b9a","resolution":{"observed_at":"2026-08-14T14:18:47.207353Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.388842Z","title":"Generating hard instances of lattice problems","venue":null,"work_id":"28e002a3-084c-4860-9a63-1068ee198140","year":1996},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.251806Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:097f43cb7dd76432004c6954d005a55e8c99db8c811020ea66faf1fcc361ca98","observation_id":"8bf542bc-4af1-4f13-b11b-99a0ce8d9f52","resolution":{"observed_at":"2026-08-14T14:18:50.494422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.376399Z","title":"Sivakumar","venue":null,"work_id":"d0f93a67-16ae-41ef-b933-ca38368359f8","year":2001},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.298303Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:c33fc4338b8073a45377ef96cb89a76aeb5328f0e3745be78d88a40389aba06f","observation_id":"71f14670-9d9e-4edf-9eeb-a2f53a4917f4","resolution":{"observed_at":"2026-08-14T14:18:50.380887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.363053Z","title":"Albrecht, Rachel Player, and Sam Scott","venue":null,"work_id":"e46b86b3-868e-4099-9d50-5f2df16318e7","year":2015},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.304331Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:4829e359bcbbf8c521baa96fbfb5dfea532ccf9d3487e31b5a4113f3b3fe3175","observation_id":"1b775ea5-c3ab-4d83-b15d-bffe0900fbf7","resolution":{"observed_at":"2026-08-14T14:18:50.367891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.01535","last_updated":"2017-09-05T18:06:21Z","snapshot_observed_at":"2026-08-14T20:35:54.795559Z","submitted_at":"2017-09-05T18:06:21Z","title":"Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)","version":1},"cited_work":{"arxiv_id":"1709.01535","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.01535","snapshot_observed_at":"2026-08-14T14:18:47.973396Z","title":"Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)","venue":"cs.DS","work_id":"f50aa5a2-3376-4d82-ac0a-e7b54179e865","year":2017},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.310456Z"},"links":{"cited_paper":"/paper/1709.01535","citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:e88bb65137436d07493b55ee1cc092d2b8111d51a449d3e16b662cce0c9ab981","observation_id":"9e41f3de-31d7-4023-99cb-a7b7b9865b58","resolution":{"observed_at":"2026-08-14T14:18:48.023398Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.310253Z","title":null,"venue":null,"work_id":"94e291d1-bdb7-49f3-b34a-c1c7e71a2053","year":2012},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.392225Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:bec670d7a451729853c2a29f5c0f67cfeb6c246d4fe81b43f1f926b860ee8f9a","observation_id":"c0b5bd8e-a8ff-4906-8b76-a6f33de5d285","resolution":{"observed_at":"2026-08-14T14:18:50.353653Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.183234Z","title":"Enumerative lattice algorithms in any norm via M -ellipsoid coverings","venue":null,"work_id":"5fea0950-ef28-4a2e-bafa-e06ad2c19a11","year":2011},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.397579Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:a5b35b74412d7c050782bedd34135b94f4328ab3de1cf195e23577b79ec0c20c","observation_id":"e2802834-2d10-4746-a4f4-c094d6857b47","resolution":{"observed_at":"2026-08-14T14:18:50.249613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.170586Z","title":null,"venue":null,"work_id":"368948be-35b2-4893-b613-280901f5fa18","year":2006},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.401711Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:1ed34e5a08c632436b4f92c76413d77fdfe8182459b7a32b550dca4f6f5efa24","observation_id":"62f3c3e3-20b4-47e1-8bd4-51b0832a3531","resolution":{"observed_at":"2026-08-14T14:18:50.174892Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.061118Z","title":null,"venue":null,"work_id":"fcdd831e-99f1-419b-9481-ac20e91729c2","year":2006},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.486782Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:d2f6c4c7e1ae36828553eed9c0a8d12b7540610a79bade67f8786a9f4d3a9862","observation_id":"454cccfe-164b-4498-88fc-3fbea1921c6a","resolution":{"observed_at":"2026-08-14T14:18:50.106678Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:50.048492Z","title":null,"venue":null,"work_id":"70408217-6373-422c-9b37-2839cc1678e2","year":2008},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.493169Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:e71bae606c710a5fe80b2b9d1f55ad5e5936a8ec64e5418da956f7b935392e2a","observation_id":"19e402a6-85e7-484e-a79e-9bab939614a6","resolution":{"observed_at":"2026-08-14T14:18:50.053294Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.958851Z","title":"Trapdoors for hard lattices and new cryptographic constructions","venue":null,"work_id":"82d223b5-fb58-48a1-9f6e-9349b265c3d9","year":2008},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.498084Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:f7deb635801fd5d5619d07ae1cc7e4c3db92ec77e148c0d0a04e8f64d57a2a70","observation_id":"edf4aa50-9a0c-45de-ad24-0b84010204df","resolution":{"observed_at":"2026-08-14T14:18:50.033322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.900678Z","title":"Analyzing blockwise lattice algorithms using dynamical systems","venue":null,"work_id":"68e90468-aed0-4edd-b24b-e45f02e2933d","year":2011},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.503789Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:19988190e18dd85f58f984a2cb9e850a4b1ab212b09d98d0a034a4d9fbc2f6f2","observation_id":"7969dfab-0625-464b-baf8-d33b51781e08","resolution":{"observed_at":"2026-08-14T14:18:49.905986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.860647Z","title":"Lattice reduction: A toolbox for the cryptanalyst","venue":null,"work_id":"99714621-0c7f-4f23-9697-9b55ef50a763","year":1998},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.585834Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:f334886bdbf0cc102a4747d5aeb2da28b8a296072dd814495d1156842fa98168","observation_id":"0b176817-7aba-4ff5-82e1-0effcf9d47e6","resolution":{"observed_at":"2026-08-14T14:18:49.891425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.815002Z","title":"Improved algorithms for integer programming and related lattice problems","venue":null,"work_id":"9e1f9892-aadd-4b2a-8dce-69f9125a0773","year":1983},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.590350Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:34ff29cfb6dd517041f3ca763db578fea7e0b20d1dfce3053f953c86918ce0fc","observation_id":"e50aea05-47e4-4d0f-82b2-1e0bb40bd832","resolution":{"observed_at":"2026-08-14T14:18:49.820295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.631249Z","title":"Lenstra, Jr","venue":null,"work_id":"cd7dc8d1-32ea-4775-9b95-35fe0a7696d7","year":1983},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.595173Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:876fbdbc19cdaabfa7a98a0b0fdeb27c08af1a1d2a87960f6ce9ed15310a15d2","observation_id":"eb6953cb-6f32-4b25-a29a-2605f279b2b0","resolution":{"observed_at":"2026-08-14T14:18:49.701982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.505833Z","title":"Lenstra, Hendrik W","venue":null,"work_id":"e5f44639-e7b4-422e-a438-e44eca2c7a30","year":1982},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.600529Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:9b7333613b3cd232ac3e3e8be4865ffe5b40aaa634ec39b957d7fa4ac31e74da","observation_id":"c05ce30a-f25d-4712-8d7a-7148bb57967b","resolution":{"observed_at":"2026-08-14T14:18:49.616185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.490272Z","title":null,"venue":null,"work_id":"febd926a-3cd1-4f9d-a3d4-631bc6054e3f","year":2014},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.604772Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:c905078d1aeb491432884928efab281c787db74c09b192791bed747613fd09f1","observation_id":"a93fb21d-3739-488d-9111-40ed63272874","resolution":{"observed_at":"2026-08-14T14:18:49.494663Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.359109Z","title":"An algorithmic theory of numbers, graphs and convexity","venue":null,"work_id":"41791c13-6d20-43ce-9eba-d8d3331c653d","year":1986},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.610302Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:69135043487f54d503044d6a61424d01ebd131e9e74d2d17c84aa6ec9cb522f2","observation_id":"f54e179a-ccb4-47fe-a96a-bc505e32b8fd","resolution":{"observed_at":"2026-08-14T14:18:49.363447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.318695Z","title":"Shortest lattice vectors in the presence of gaps","venue":null,"work_id":"8b28b705-7f4f-405d-a785-b244ea84ee13","year":2011},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.678666Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:31716c47051b6039d8875d07cf33cb8aee2f44b16ad5ad29f69a5b2f2c892c2d","observation_id":"5c6b425c-945f-4414-bc17-e1e45b9a36e2","resolution":{"observed_at":"2026-08-14T14:18:49.350026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.238638Z","title":"A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations","venue":null,"work_id":"dd779a8d-2f4a-4759-b092-f0f84c7915c5","year":2013},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.724627Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:812399d29cf7865d43f5c0e1ba80000b88fe1e50f350ccee8dca7067dece57cb","observation_id":"d7a19207-5a88-44d1-8b8a-41e282a45e1d","resolution":{"observed_at":"2026-08-14T14:18:49.244784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.189809Z","title":"Practical, predictable lattice basis reduction","venue":null,"work_id":"31ffbe13-83be-496b-bd9e-e9a64bfefabf","year":2016},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.730611Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:507b46cfc0dddcdbe897de04b7d88ff225cb8d3dfa4f3226284fcd9f4d694cde","observation_id":"24e80ab8-9a28-4425-873c-eebba499f7df","resolution":{"observed_at":"2026-08-14T14:18:49.227629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:49.117718Z","title":"Bounding basis reduction properties","venue":null,"work_id":"249afde8-d087-4a5b-8d2f-dd2ec2c15310","year":2017},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.736728Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:dba2e0326d59a59b585fe4f4310aa0688c8e6a2de4973532f07282786815f7c9","observation_id":"d7561ac9-ac87-4734-aa01-6609948362b8","resolution":{"observed_at":"2026-08-14T14:18:49.124380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.952919Z","title":"Post-quantum cryptography","venue":null,"work_id":"77bedef2-3317-49dc-8937-c8ddc4791696","year":2018},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.742867Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:fe706edbd055272d0ba197b3038a9a0ef2b498ceff4a893516c68493ad5e9fae","observation_id":"014e9c88-3d1e-498e-9d7e-ede3c58470ae","resolution":{"observed_at":"2026-08-14T14:18:49.040495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.915051Z","title":"Nguyen and Jacques Stern","venue":null,"work_id":"65320204-97f6-44e7-897f-086020c36f69","year":2001},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.806796Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:441b5ec2ea9bab197262d3bf8fda54bb92626985f67171a6babfbf46cf323a46","observation_id":"2d675f04-f17b-40db-843d-359f293b226c","resolution":{"observed_at":"2026-08-14T14:18:48.921247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.796637Z","title":"Nguyen and Thomas Vidick","venue":null,"work_id":"58f440ad-38b0-4fa4-b157-ad82b096a861","year":2008},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.822962Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:58bde2e691d6027bfec062b7e90c21c27da409ab73c2b08e14027b1177dedcb1","observation_id":"c553a5b3-2fd1-4166-a2e8-2ff9119fd46b","resolution":{"observed_at":"2026-08-14T14:18:48.856438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.781036Z","title":"Nguyen and Brigitte Vallée, editors","venue":null,"work_id":"d2c07dd8-24c7-4d66-aa74-6c9257cd086e","year":2010},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.827449Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:125a48360718684b3e612a70835e4c6a1757bcaf07992c6666cd48cfdc8aea46","observation_id":"0701f083-eb43-4090-a8d7-d0abe7d2f250","resolution":{"observed_at":"2026-08-14T14:18:48.785896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.727803Z","title":"The rise and fall of knapsack cryptosystems","venue":null,"work_id":"9dfe7691-b2af-4b9b-8e29-3e66e6878fff","year":1990},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.833411Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:e84d65ff1da4309b99df3f55309687e8cd5d257045f43b093de26c549da2b893","observation_id":"7ac025b3-b17d-4f90-bed0-e13543acc330","resolution":{"observed_at":"2026-08-14T14:18:48.772013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.675329Z","title":"Public-key cryptosystems from the worst-case Shortest Vector Problem","venue":null,"work_id":"57086589-5994-477d-a1bd-3ab5f74d95cf","year":2009},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.854053Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:a3808f14b1274e892882bacccffbbff4962208addbb447f01583a98670a37c64","observation_id":"83a0de1e-1261-472d-9cd2-eaa8f61f5364","resolution":{"observed_at":"2026-08-14T14:18:48.679358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.663373Z","title":"A decade of lattice cryptography","venue":null,"work_id":"c88096ef-853d-4f00-8893-2c176f0b3b1a","year":2016},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.879157Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:39520c5c73d43fb38fbc8ec5568dab23c6308be6f1716832ee36bd64b44aee17","observation_id":"d5cbfc6a-5dd7-4c57-b0ba-a3a44c0d502e","resolution":{"observed_at":"2026-08-14T14:18:48.667225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.595981Z","title":"Solving the Shortest Lattice Vector Problem in time 2^ 2.465 n , 2009","venue":null,"work_id":"d42fe3e7-099a-4650-8e51-cffb03e1dae8","year":2009},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.883059Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:6c0a7de5ab1f03e7e06f23608d52160c6314e31595103494e5a3e50dd7db51ef","observation_id":"ba759acc-6205-4032-bebb-87d9414b1a8d","resolution":{"observed_at":"2026-08-14T14:18:48.638740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.581887Z","title":"On lattices, learning with errors, random linear codes, and cryptography","venue":null,"work_id":"2fb80529-e478-4742-97ec-4a18268a7404","year":2009},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.887336Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:08fe0b7bda13d9d8ab5748f47a623d7eccb873b4222398d06d90cf8ff61db0d8","observation_id":"dff23b42-0ac8-43f3-9761-3710d8ae8cfe","resolution":{"observed_at":"2026-08-14T14:18:48.586555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.484444Z","title":"A hierarchy of polynomial time lattice basis reduction algorithms","venue":null,"work_id":"c727063e-863e-40b7-8d01-ea874c882d4e","year":1987},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.892580Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:079cd4ae906f14179fbcbbfb7511d15bc0e938fe93636182a6058a057f0113f3","observation_id":"0a2781a2-e45f-4104-8bc7-32f4fb020b13","resolution":{"observed_at":"2026-08-14T14:18:48.534341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.470939Z","title":null,"venue":null,"work_id":"4b12e008-630b-4a06-9dc7-57bc83ce593f","year":1994},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.897404Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:e815ce93dd4ccdf5426eda3fce8762582e339fd8e66d627bb1c09765a166be7f","observation_id":"f4cf8dbd-968c-4293-801b-5d3f1be2d184","resolution":{"observed_at":"2026-08-14T14:18:48.474490Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.292888Z","title":"A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem","venue":null,"work_id":"b5ce23af-f5c4-4f2c-bd2d-526420f5bd18","year":1984},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.935811Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:2563aec199ed23e7bf84ebde0adee236abcf8a4395ebc222b94b744e411bac20","observation_id":"b2fa9936-14d5-465b-a3ff-1490006b050a","resolution":{"observed_at":"2026-08-14T14:18:48.353602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:18:48.124717Z","title":"Finding shortest lattice vectors in the presence of gaps","venue":null,"work_id":"885c302b-5a74-475b-befb-bd7748c8dbec","year":2015},"citing_paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T14:18:47.940775Z"},"links":{"citing_paper":"/paper/1908.03724"},"observation_digest":"sha256:864a01e76811caab2630812f8e65c1a5933aa551826d00346e9a0021ba580d6b","observation_id":"3e509e59-4a59-4556-b73f-370874fe0462","resolution":{"observed_at":"2026-08-14T14:18:48.241213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03724","last_updated":"2019-08-10T10:43:45Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T10:52:52.419252Z","submitted_at":"2019-08-10T10:43:45Z","title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":27},"total_outbound_references":35},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:1908.03724."}