{"as_of":"2026-08-17T03:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3e48e17966da54bf35a382581205a50908796cf035b23a1eaeea1854248d9b4","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:02:42.435990Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"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.08384/citation-record","integrity":"/paper/1908.08384/integrity","json":"/paper/1908.08384/citation-record.json","paper":"/paper/1908.08384"},"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-14T12:02:42.805662Z","title":"Sivakumar","venue":null,"work_id":"277649ee-ca68-48a0-bd91-4aa8ed6406cf","year":2001},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.330225Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:9e12f3b3bdc6502ec7115db860f513ef2ad54037791fd858bd612675bd548133","observation_id":"7c4ed907-4bac-48f6-8594-886ecfa3dc56","resolution":{"observed_at":"2026-08-14T12:02:42.812273Z","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-14T12:02:42.789005Z","title":"Sivakumar","venue":null,"work_id":"6965a0ae-047b-4a28-9120-993a67311065","year":2002},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.335546Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:3abfca76d249487509d295f43094afbf2adfaa9ae32b34f7f6abefe36762ea30","observation_id":"afefd5e3-d89b-491b-accb-ff0275e1da4a","resolution":{"observed_at":"2026-08-14T12:02:42.794146Z","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-14T12:02:42.773012Z","title":"Probabilistic Checking of Proofs and Hardness of Approximation Problems","venue":null,"work_id":"3e545ac0-8bc4-404e-a598-d8ed6a95c55e","year":1995},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.340540Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:1aaac6057aa2a2d1ac7303cf04005aabfc09b74aa50af8e85b3fd53dec37ca1c","observation_id":"47893f20-2b5f-40d8-80d0-76309d503bcb","resolution":{"observed_at":"2026-08-14T12:02:42.778237Z","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-14T12:02:42.756843Z","title":"Just take the average! A n embarrassingly simple 2 \\^ n-time algorithm for SVP (and CVP)","venue":null,"work_id":"6b217820-3372-4e43-863e-da55996c9bdd","year":2018},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.346022Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:2d0d786dacbf56cc8b426cf163f51696dbde7164e15f5cd7eea64705e0feaa4c","observation_id":"c8e8111b-9cb6-4344-b3ab-f39d05b7da37","resolution":{"observed_at":"2026-08-14T12:02:42.762149Z","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-14T12:02:42.739783Z","title":"Sampling methods for shortest vectors, closest vectors and successive minima","venue":null,"work_id":"614606bb-6881-4379-bf9d-d2bcc2459d21","year":2009},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.351569Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:bdfb6b21e58b792e0555e4d8ae129a57e24331d99fb45310bfd946747ab423f4","observation_id":"22da9156-0111-4c01-aacf-d35699d08e6c","resolution":{"observed_at":"2026-08-14T12:02:42.745671Z","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-14T12:02:42.723888Z","title":"A o(1/ \\( \\) 2) n -- time sieving algorithm for approximate integer programming","venue":null,"work_id":"5904bc18-5966-46ac-9b05-752607d073a3","year":2012},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.356573Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:058f0faa62b93d934600f56f1708a7fbd4506ba8b5b6f7486041e520544a7d6b","observation_id":"25606718-19a8-4f34-b1b3-4cb618565bcc","resolution":{"observed_at":"2026-08-14T12:02:42.729420Z","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":"1311.6671","last_updated":"2013-12-03T14:35:27Z","snapshot_observed_at":"2026-08-14T23:53:53.942070Z","submitted_at":"2013-11-26T14:00:52Z","title":"A Deterministic Polynomial Space Construction for eps-nets under any Norm","version":3},"cited_work":{"arxiv_id":"1311.6671","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.6671","snapshot_observed_at":"2026-08-14T12:02:42.472411Z","title":"A Deterministic Polynomial Space Construction for eps-nets under any Norm","venue":"cs.CC","work_id":"c440ce58-774c-47cc-a292-c5897a98be16","year":2013},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.363327Z"},"links":{"cited_paper":"/paper/1311.6671","citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:4cb5ab706e1f39c93402b3ded74a8cd38c2cc21c59adcaac6ac4e89d356df737","observation_id":"50ab13f0-6f30-4f56-868c-c0aa53dafbd0","resolution":{"observed_at":"2026-08-14T12:02:42.479877Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:02:42.368556Z","title":"Dyer, Alan M","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.368556Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:80051895cb42c8bd9d122c5a1a10cf3ffda9bee5b93b66b64b986d81a9327065","observation_id":"5fa70f80-048e-4ad1-8749-465220038059","resolution":{"observed_at":"2026-08-14T12:02:42.368556Z","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-14T12:02:42.698592Z","title":"Lattice sparsification and the approximate closest vector problem","venue":null,"work_id":"f6b8b2ba-2ece-4d9f-b8a8-28aac5b90253","year":2016},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.373525Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:acedc33deacadf9972aa57c1dc0e5ba55370b66b7f6decfda3a1679d60cb0d93","observation_id":"a7b984d5-43b5-4f93-89df-fa6f34c1350c","resolution":{"observed_at":"2026-08-14T12:02:42.703644Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:02:42.378259Z","title":"Approximating CVP to within almost-polynomial factors is NP -hard","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.378259Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:c099b8bdc4c6988d96652ff041d8be8efc5022f206f33ca5b3b848f49e816bc4","observation_id":"b910c3f4-983e-4bd7-9203-022253b54f74","resolution":{"observed_at":"2026-08-14T12:02:42.378259Z","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-14T12:02:42.671339Z","title":"Enumerative lattice algorithms in any norm via m-ellipsoid coverings","venue":null,"work_id":"dd09d30e-cdaf-4d27-a2d9-910881ff4a3b","year":2011},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.383140Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:d9d2c25b1a765f6649270c4d589f649a58b2a2dc9503a295655097aae7220a5c","observation_id":"3428acb8-b364-4b26-8cc2-eb5d1561a1ae","resolution":{"observed_at":"2026-08-14T12:02:42.676285Z","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-14T12:02:42.655434Z","title":"Covering cubes and the closest vector problem","venue":null,"work_id":"75262ec9-fd90-49ef-985c-6f02c048968b","year":2011},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.388026Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:d13d1ed60e847288dabdbb57e143baf841b3092b74bd35c93a38ee105521108b","observation_id":"b4c27e88-18d9-4847-9531-50244e1c56c4","resolution":{"observed_at":"2026-08-14T12:02:42.660411Z","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-14T12:02:42.639609Z","title":"Geometric Algorithms and Combinatorial Optimization , volume 40","venue":null,"work_id":"e05ab975-90dc-41a8-93de-df61e62ab4a1","year":1988},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.393279Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:961e7f3384c95186faf05983bc7f12a4ccaae2f40e14d928f9200c44c670ed0e","observation_id":"b5405363-82c3-4091-b54f-4b82fd94e9d8","resolution":{"observed_at":"2026-08-14T12:02:42.644615Z","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-14T12:02:42.623859Z","title":"On compact representations of voronoi cells of lattices","venue":null,"work_id":"dcc04de2-5075-4116-a739-223abae49ecd","year":2019},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.398180Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:0dfab049da02cd5ea2a4fb77f1ae1bd9844b2cf1451c74a4ded95fbef8ba46dc","observation_id":"d57f62d0-9739-4b2e-bca1-e03993915bba","resolution":{"observed_at":"2026-08-14T12:02:42.629127Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:02:42.403162Z","title":"Minkowski's convex body theorem and integer programming","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.403162Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:9fa287b9ae46728b5b2947b03ece2ab067bad755d1cc14b0000ed8bcf6b07440","observation_id":"b921c128-d756-4375-b8f0-1288a1a45edf","resolution":{"observed_at":"2026-08-14T12:02:42.403162Z","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-14T12:02:42.596278Z","title":null,"venue":null,"work_id":"f82d9c34-0617-4b50-94d3-ae7fd9edd39d","year":1983},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.407815Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:187be1df056248c7f28085ab2586aec3e3510bd481eabc8f9ac264e68ec9d058","observation_id":"e61f31a9-c5e4-4e62-8531-b93598edb806","resolution":{"observed_at":"2026-08-14T12:02:42.601281Z","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-14T12:02:42.579501Z","title":"On the modulus of smoothness and divergent series in banach spaces","venue":null,"work_id":"2246a5a2-a12d-40d4-ae35-f56ebb3c49a1","year":1963},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.412458Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:054b8fd3c5869163e7fdd903175396b1341aaa4f070e7c6d72f584a4021d2fbb","observation_id":"c33d06e8-ba4a-4264-8257-40d5bd987505","resolution":{"observed_at":"2026-08-14T12:02:42.585178Z","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-14T12:02:42.560883Z","title":"Entropy and asymptotic geometry of non-symmetric convex bodies","venue":null,"work_id":"42e77a32-946e-401e-af3e-e3a8f16f9550","year":2000},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.417084Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:ee70f66c914bef57f0a4c8eb4af52fe32428dea3e1a5db265441a49a5cb74e3a","observation_id":"dfe3606c-e8b9-47b7-b6a0-adbfc8fd1ba7","resolution":{"observed_at":"2026-08-14T12:02:42.566883Z","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-14T12:02:42.543145Z","title":"Swanepoel, and Gunter Wei","venue":null,"work_id":"7475408f-2368-4025-a59b-c07a3ba5902a","year":2001},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.422026Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:c285f5e90811e452b50f2e527efe0613a71ca5bd33721a0e5b96046460bbfd45","observation_id":"0d59fcf7-4399-4c72-98bc-a379c6190a14","resolution":{"observed_at":"2026-08-14T12:02:42.548124Z","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-14T12:02:42.524979Z","title":"A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations","venue":null,"work_id":"4d3b412d-7fc5-4d8d-9600-c34a8f3af052","year":2010},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.426889Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:1aa37c7daa31f65744a4472fa014f6b9686dc121fef919770adfbd016a8ef574","observation_id":"44ae5292-2f63-4e43-b989-3967ff44cd8a","resolution":{"observed_at":"2026-08-14T12:02:42.530607Z","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-14T12:02:42.507988Z","title":"Approximating the centroid is hard","venue":null,"work_id":"f80f1f81-b270-4a89-9d80-e38f47aa13e7","year":2007},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.431515Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:e3edb58610a27579b1837a2a464630a878cdaaf50c32c3947bbdd8af68b95564","observation_id":"ea6d8f1d-5e03-4513-9f31-95de2584bb32","resolution":{"observed_at":"2026-08-14T12:02:42.512972Z","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-14T12:02:42.491556Z","title":"van Emde Boas","venue":null,"work_id":"14535cb5-ca6c-4458-b70c-9fb7dfb1cfe5","year":1981},"citing_paper":{"arxiv_id":"1908.08384","last_updated":"2021-11-01T20:52:20Z","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T12:02:42.435990Z"},"links":{"citing_paper":"/paper/1908.08384"},"observation_digest":"sha256:b0e48ba23ff3c4077d64b366f25f05a66615b1d115362c8eebe28d557cf2fa17","observation_id":"2741cc35-ab63-4abe-95ee-16eb59ce6f54","resolution":{"observed_at":"2026-08-14T12:02:42.496744Z","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.08384","last_updated":"2021-11-01T20:52:20Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T11:38:09.561653Z","submitted_at":"2019-08-22T13:58:33Z","title":"Covering convex bodies and the Closest Vector Problem"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":17},"total_outbound_references":22},"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 17 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:1908.08384."}