{"as_of":"2026-08-22T14:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94eb908d68a20bb58d4c703af76b81f1ce0b438b68c8d463585d8464a57475bb","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:27:58.892309Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1909.01986/citation-record","integrity":"/paper/1909.01986/integrity","json":"/paper/1909.01986/citation-record.json","paper":"/paper/1909.01986"},"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-14T05:27:59.752349Z","title":null,"venue":null,"work_id":"846df76f-b3dd-4738-963f-1a696cc98331","year":1997},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.528924Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:3d999ebc910e0dbdef3dcc155ab51778f405920a509bc1cd6fd23a3413559410","observation_id":"7b6b61db-b769-4636-b3e2-05c76716034e","resolution":{"observed_at":"2026-08-14T05:27:59.757238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.737858Z","title":"A public-key cryptosystem with worst-case/average-case equivalence","venue":null,"work_id":"e4a92c45-a049-4c6c-b0bc-1759bf6b661f","year":1997},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.534148Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:4dd79fd71540705ed810894900b62dcbd3e5b6df6a53289c81bfdbefb7a84566","observation_id":"c2a69da5-c6c1-41ff-991f-1b1cd6144996","resolution":{"observed_at":"2026-08-14T05:27:59.742761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.722688Z","title":"Generating hard instances of lattice problems (extended abstract)","venue":null,"work_id":"1baa3a12-3cac-4605-ac65-f15bd60cf9a3","year":1996},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.538922Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:244888c41f13c78480f8774e57d8bd3dbb99dbcfc2c489b7b7ac43de2c38e25a","observation_id":"c3fbb0ec-826c-47a1-b31c-a1268eb316bb","resolution":{"observed_at":"2026-08-14T05:27:59.727775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.707150Z","title":"The shortest vector problem in _2 is NP -hard for randomized reductions (extended abstract)","venue":null,"work_id":"b386f5f3-510d-4763-b496-68fffbe8d2df","year":1998},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.544069Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:1af6aff495226c7513d2620dd56ea6649b75b34a2490fc957e951def6397b557","observation_id":"c8de7b86-7507-46e5-b8e2-b3403e6f205f","resolution":{"observed_at":"2026-08-14T05:27:59.712167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.690681Z","title":"A simple deterministic reduction for the gap minimum distance of code problem","venue":null,"work_id":"06c8d984-b2f6-4559-869f-df6a72e6fb31","year":2014},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.548858Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:17b73e949e2a0ee49542ac47291dd849581cd4989a89cd1b6be316c54860c132","observation_id":"e090b02c-d97b-472e-8bd6-5ba2194d6e7b","resolution":{"observed_at":"2026-08-14T05:27:59.696333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.674532Z","title":"(gap/s)eth hardness of SVP","venue":null,"work_id":"e6a7bb8e-3a9e-4bf6-b4d8-43c24475468d","year":2018},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.553536Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:b7ad59a20882bab0a472c290f68076ba2d579d1150441ee4436f6750418f704e","observation_id":"db9ece87-a910-43fa-b3c0-1443bdbaa778","resolution":{"observed_at":"2026-08-14T05:27:59.679771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.656742Z","title":"On the hardness of learning sparse parities","venue":null,"work_id":"ef8691ca-1e7a-4b55-8223-a118f85f2871","year":2016},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.558628Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:730db01c8a8209e071dc570910489f3da48738e14c8903849659e01a06813a94","observation_id":"a0dba9df-0e81-4ee2-a522-73ed79f4fd53","resolution":{"observed_at":"2026-08-14T05:27:59.662095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.640737Z","title":"On the quantitative hardness of CVP","venue":null,"work_id":"aac66a76-1bfe-4a8f-bea6-63df4269ca86","year":2017},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.563127Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:694ae3da7a2876ff1a583eb93443ce1c41c821defc1fbeae2917431116621195","observation_id":"d04d8ab7-2ead-4fb2-9a36-fc4562529fb3","resolution":{"observed_at":"2026-08-14T05:27:59.645659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.624749Z","title":"Berlekamp, Robert J","venue":null,"work_id":"c98c294b-ad0f-4300-910d-272250d921c9","year":1978},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.567632Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:ce051beacaf02d6680c45ad3b48f3a273abc91718a28ea61db22e7eaeaa160fe","observation_id":"38872dd0-c9e9-499c-b1b1-261fb6e84acb","resolution":{"observed_at":"2026-08-14T05:27:59.629814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.605910Z","title":null,"venue":null,"work_id":"41e22db4-b795-46a4-ab3e-fec3d7f3b6f9","year":1960},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.571899Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:cae7f77320009d28d69bb34090a848bbe60c1b250fcb2c209182ef9a999e1db8","observation_id":"fd4ab5e0-328c-41ff-a0cf-f053285cd347","resolution":{"observed_at":"2026-08-14T05:27:59.612515Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.590220Z","title":"Fomin, Danny Hermelin, and Magnus Wahlstr \\\" o m","venue":null,"work_id":"f5746f08-71ef-4f91-91a4-e9eba23c4570","year":2017},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.576302Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:c17386e234f912bed0b55380e26a36e2a430a0a4c1c0c9d605bdbee44effe479","observation_id":"bd0859aa-8d52-4b03-8764-92c1ff64328d","resolution":{"observed_at":"2026-08-14T05:27:59.595358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.573605Z","title":"Open problems for fpt school 2014","venue":null,"work_id":"1adb0368-8609-440c-a775-c187d52fe331","year":2014},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.580954Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:3045da579fa91aca5858de23d5e914be8e2659921f70b9e6a663a51c1f44fe7f","observation_id":"a70f5554-9500-4b32-8303-424110f7ee72","resolution":{"observed_at":"2026-08-14T05:27:59.578619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:58.585888Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.585888Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:3d2bdccbe92aef27b41c158d908eb3c9536d57c6e8746087179f2960c361e720","observation_id":"87449922-be6e-4dfe-b60d-0e0ac83007a2","resolution":{"observed_at":"2026-08-14T05:27:58.585888Z","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-14T05:27:59.548813Z","title":"Approximating the SVP to within a factor (1+1/ dim ^ ) is NP -hard under randomized reductions","venue":null,"work_id":"72b24a02-4845-4c84-8756-88a6b234d831","year":1999},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.590282Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:6fdb2eb358833e42cf4d73315b17ba318a510119ca97ea10b3388df959738681","observation_id":"35312e72-df36-400f-86dd-b497320bbe7c","resolution":{"observed_at":"2026-08-14T05:27:59.554028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.533025Z","title":"A deterministic reduction for the gap minimum distance problem","venue":null,"work_id":"1cdc3ed3-a7ad-4fdb-871e-0f7ee0917ac9","year":2012},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.594603Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:4dcb573e5facc3ec74348a4f81e222975e8270f1808cfad7789f51b19b064eef","observation_id":"cc0ead37-cd04-4980-9aca-1c9795c189f1","resolution":{"observed_at":"2026-08-14T05:27:59.538413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.516805Z","title":"Downey and Michael R","venue":null,"work_id":"194abba2-4dc0-4bf6-9b27-2d125df30f04","year":1999},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.598948Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:9e0ae0bf79f794dc645f4c76daecc40364c2b36f2c5a40e8cf3142a7a8bc505f","observation_id":"04882ea6-a7cd-4b7c-a456-0f08b591c825","resolution":{"observed_at":"2026-08-14T05:27:59.521903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:58.603198Z","title":"Downey and Michael R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.603198Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:8d10901f924fb79f105dc820f86c9e80d411db7338c886299599880548e3266f","observation_id":"5866e9f9-2f09-4532-9385-e54a685dbb83","resolution":{"observed_at":"2026-08-14T05:27:58.603198Z","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-14T05:27:59.491544Z","title":"Downey, Michael R","venue":null,"work_id":"0c3ddab3-2709-4091-b642-78e5eea29ba3","year":1999},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.607426Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:2e429c6adb06cef2049e497ee3264b3f6f09f259ddb7bb8aa73c6319c7d46b19","observation_id":"8a979f56-a73a-485d-ab21-0e5ad12b16e1","resolution":{"observed_at":"2026-08-14T05:27:59.496225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.476001Z","title":"Demaine, Gregory Gutin, D \\' a niel Marx, and Ulrike Stege","venue":null,"work_id":"c2bf54a4-0338-4fd7-a046-cd727706daa8","year":2007},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.611925Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:5a555b81e44eb907d0f633204b14baf200e5aff38ed03153ba748ced70fb1ebd","observation_id":"4be076a9-9d00-4c3c-bdc3-73a26ea04c27","resolution":{"observed_at":"2026-08-14T05:27:59.480822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.461892Z","title":"Approximating SVP _ to within almost-polynomial factors is NP -hard","venue":null,"work_id":"bfc4fdf8-58b8-499d-8606-7acc99f7222e","year":2002},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.616582Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:a9fdf37a2e0a526635360352b2ca29ce59d42cdecf1d586b27578fbadc2f0e5f","observation_id":"8b10b51d-9369-4ce0-8bb0-11e41ff73857","resolution":{"observed_at":"2026-08-14T05:27:59.466442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.447538Z","title":"Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover","venue":null,"work_id":"cb64e9cf-c617-4b46-9101-41b35d313292","year":2016},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.620906Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:b350776ada85be7f89784d8bd778eb3502c222be5e5ba95e65fe224225ca1e92","observation_id":"10b9ecaf-e735-4262-ac08-01240b9751d8","resolution":{"observed_at":"2026-08-14T05:27:59.452245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.432739Z","title":"Approximating CVP to within almost-polynomial factors is NP -hard","venue":null,"work_id":"bfdd5bcf-004a-461c-ab4b-476a2e4f18ac","year":2003},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.625263Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:3e9c5c2a9c9fe3a3fe507e5c3df4f2866a3af052ba6853f026522f27bd750927","observation_id":"7f537d0d-1198-4c46-b3a6-3b3d9cd12899","resolution":{"observed_at":"2026-08-14T05:27:59.437837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.418020Z","title":"Hardness of approximating the minimum distance of a linear code","venue":null,"work_id":"9dcb5c41-da48-4664-aede-85ee560f883e","year":2003},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.629610Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:d2562a331929fcb97ebce9c9800463304545be2ab541f8b1045e74a39d1da449","observation_id":"8e2d8914-e938-4b26-ae54-6b1193d99808","resolution":{"observed_at":"2026-08-14T05:27:59.422771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.402298Z","title":"Fellows, Jiong Guo, D \\' a niel Marx, and Saket Saurabh","venue":null,"work_id":"5157480c-24e9-4c7b-9cd2-2ddc6a0493e0","year":2012},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.633982Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:ad4e7440462f82ad34a53abb1ed3aaae3963d83f240c8e01ed0a511d3db13fac","observation_id":"0e764cd7-7839-46f7-924c-80f058e555ed","resolution":{"observed_at":"2026-08-14T05:27:59.407788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.386710Z","title":"Fomin and D \\' a niel Marx","venue":null,"work_id":"1bbaed1c-a66e-459e-b6b2-215e1f257c6f","year":2012},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.638285Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:a9d84d4e40f6b61e989b0245c541041bf3b1c1337068bd355fbc398371d7f632","observation_id":"3ceb464c-4003-4e69-9bad-f048e0f283f7","resolution":{"observed_at":"2026-08-14T05:27:59.391608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.372196Z","title":"Golovach, Jan Kratochv \\' l, and Ondrej Such \\' y","venue":null,"work_id":"053bbc9e-6d5f-47d4-96c1-24421e5d008e","year":2012},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.642512Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:0c137b6127bf38f9fe2bd148853d21c9328ad524e3f681ebf8cb3898cb06639b","observation_id":"d5a06541-36a2-4f96-adac-df90e76b27f6","resolution":{"observed_at":"2026-08-14T05:27:59.376757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.357670Z","title":"Approximating shortest lattice vectors is not harder than approximating closest lattice vectors","venue":null,"work_id":"55a38878-4bd2-4919-8350-4305505c6e81","year":1999},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.646848Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:8f340e0c9aa96e088d36247a77582cc404ca92265f61a75ed535b12760b01288","observation_id":"e1724473-23ea-452b-9c2c-8343d0d8e3e2","resolution":{"observed_at":"2026-08-14T05:27:59.362566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.343165Z","title":"On promise problems: A survey","venue":null,"work_id":"37e8f064-a1a6-4610-a06e-9cf5ed8ebaad","year":2006},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.652609Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:3eecf8386d305dad74f7cbb89e0bba75ec9c1992a26791ecdc8b237ce6ace718","observation_id":"7f088704-a9e4-4244-81ef-265e84a94ade","resolution":{"observed_at":"2026-08-14T05:27:59.347786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.328599Z","title":"Codes correcteurs d’erreurs","venue":null,"work_id":"759053f0-86b3-46f9-8978-3ed7ce147d2a","year":1959},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.656998Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:09641b5e43d55e76551751d1a61dc8a39dca332e065642b8e413723083235774","observation_id":"c0c525f7-aed9-4a3e-b39c-0d96a117c9b9","resolution":{"observed_at":"2026-08-14T05:27:59.333267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.313416Z","title":"Tensor-based hardness of the shortest vector problem to within almost polynomial factors","venue":null,"work_id":"045e2204-4365-453b-978f-5cb22d37c37d","year":2007},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.661421Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:5bafd27710661e443230f11de51aa962aea31497a6e572c38da8b9df6914e0f2","observation_id":"f5872615-f9c3-4e5f-a25d-a41ee8f68849","resolution":{"observed_at":"2026-08-14T05:27:59.318515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.298421Z","title":null,"venue":null,"work_id":"89a5870c-0b40-4cf1-a70a-06841e702767","year":1990},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.666022Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:4c1ce60dc66ff539a9e7461ca5afe24c8cb5f92aebacd2fe1999f4d3591131f3","observation_id":"3d1c3cd2-5bec-4972-9742-1ecc41580191","resolution":{"observed_at":"2026-08-14T05:27:59.303314Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.281844Z","title":"Hardness of approximating the shortest vector problem in lattices","venue":null,"work_id":"196b0bab-411d-4f34-a40f-e80e794377b3","year":2005},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.670846Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:6cf0f76be1cddcf919704b70e247401820ac3793e1abbcc67049f69ae7138e84","observation_id":"6998ea9a-50ab-41a5-90c4-2d84c38366e9","resolution":{"observed_at":"2026-08-14T05:27:59.286742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.266882Z","title":null,"venue":null,"work_id":"6cb2c3bc-d89c-4d5b-b2f7-d5a13a7ac054","year":2019},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.675191Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:79ee85ba124edd91be37558ba8092b90bd3b77bde33827d8f6e9e2806fe38026","observation_id":"93007e04-d91b-4ecd-a2f9-a5b6ee230583","resolution":{"observed_at":"2026-08-14T05:27:59.271758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.251467Z","title":"Integer programming with a fixed number of variables","venue":null,"work_id":"546e0723-205f-4f41-bdf5-288debd17020","year":1983},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.679708Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:30597c076411c9930649e8ff086b4106a5f13b08f012b0ec34426d29ef4ca9d5","observation_id":"1b58dc17-5295-4832-9cde-47f1812ccb68","resolution":{"observed_at":"2026-08-14T05:27:59.256486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.237357Z","title":"The parameterized complexity of the k-biclique problem","venue":null,"work_id":"e0d523f7-c41b-4332-8ded-e41e7d932e27","year":2018},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.685054Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:9a5931f946e3673f5983221d67670b5a15aa1084743995a31409b168580a7bdc","observation_id":"d141bb2f-201c-4428-aebf-25818e170466","resolution":{"observed_at":"2026-08-14T05:27:59.242142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.222220Z","title":"Factoring polynomials with rational coefficients","venue":null,"work_id":"3e4dacf9-4a0c-45e8-b0cd-d7a143aa9b91","year":1982},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.803173Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:cacd13a8817e2ae2d76c7936c4c72421bd046a6faceb7bd77390da0c19a6b1a0","observation_id":"94fecc4e-bddb-4599-aff0-37a3d59a5ac3","resolution":{"observed_at":"2026-08-14T05:27:59.226915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.10153","last_updated":"2017-08-09T12:51:07Z","snapshot_observed_at":"2026-08-14T20:50:34.271053Z","submitted_at":"2017-06-30T11:49:41Z","title":"Parameterized Complexity of CSP for Infinite Constraint Languages","version":4},"cited_work":{"arxiv_id":"1706.10153","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.10153","snapshot_observed_at":"2026-08-14T05:27:58.947513Z","title":"Parameterized Complexity of CSP for Infinite Constraint Languages","venue":"cs.CC","work_id":"992072a8-194c-4d1e-a804-5f7977c3f4bd","year":2017},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.808353Z"},"links":{"cited_paper":"/paper/1706.10153","citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:ea8a83b18c6dfabb804b195a539d3dcb2e5497f1812587e32a6602d49e25b6cc","observation_id":"b8c92cd6-7ab2-465a-996b-22903808e9ef","resolution":{"observed_at":"2026-08-14T05:27:58.954667Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.207854Z","title":"Complexity of lattice problems: a cryptographic perspective , volume 671","venue":null,"work_id":"70816534-e56b-409b-9dc0-8ba2ce6c10e5","year":2012},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.813558Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:942ba127bfdb40bafd6a06d3a244334ff1578615aabac156083dce480fe1bd00","observation_id":"942f1c35-836e-472b-9ff7-c1411c8e401d","resolution":{"observed_at":"2026-08-14T05:27:59.212416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.193033Z","title":"The shortest vector in a lattice is hard to approximate to within some constant","venue":null,"work_id":"72879276-c968-42ec-b7c9-28dbf4107348","year":2008},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.818556Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:fc6f742137ad25973558619073c89a349c17fbbc75a84a9d8bd4c8b294f5c797","observation_id":"381ff4a6-8fcc-45cd-82e8-31dc088450e3","resolution":{"observed_at":"2026-08-14T05:27:59.198141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.177793Z","title":"The hardness of the closest vector problem with preprocessing","venue":null,"work_id":"4fce396c-b666-4030-9f0d-5e13d8c6d4ac","year":2001},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.823191Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:11313e3b3059c6764c03dbe8a04c9525e3b41291463e0a14ea35a490a4cf31da","observation_id":"ff86e915-69e6-44a4-8cdb-9d90c643aa28","resolution":{"observed_at":"2026-08-14T05:27:59.182664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.162925Z","title":"Inapproximability of the shortest vector problem: Toward a deterministic reduction","venue":null,"work_id":"0a0d3e31-620c-4c6e-ba3f-2b17552a5c70","year":2012},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.827590Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:2e0bbe69c05149c9cc827886e833fa1eb566a5fa9ff9c0ae334b3a05c8e1eddd","observation_id":"579722ab-b995-478e-94e0-8a7fdcefe51a","resolution":{"observed_at":"2026-08-14T05:27:59.167913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.148278Z","title":"Locally dense codes","venue":null,"work_id":"f83fd1c6-57ee-45a3-b44d-5c46b1a6e3fd","year":2014},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.832222Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:83f5c6cff82af24b63b01891c77b2ce50f78e127a9ff242f3f867a6927a3f7ac","observation_id":"acbe06fd-35c3-4adc-aab6-538ef59da888","resolution":{"observed_at":"2026-08-14T05:27:59.152993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.133637Z","title":"Lattice-based cryptography","venue":null,"work_id":"a1b8c3ce-6481-4668-b007-4753fa64567c","year":2009},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.836555Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:6469f994651784ec647f5a49ac1743d709af42a62fe77e0f4f844e8bfe9049bd","observation_id":"15027f60-b3e3-4f2b-814f-6bcd43f48b85","resolution":{"observed_at":"2026-08-14T05:27:59.138481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02986","last_updated":"2016-07-11T14:54:04Z","snapshot_observed_at":"2026-08-20T06:21:09.900678Z","submitted_at":"2016-07-11T14:54:04Z","title":"A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02986","snapshot_observed_at":"2026-08-14T05:27:58.841154Z","title":"A birthday repetition theorem and complexity of approximating dense CSP s","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.841154Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:e478a366d439d646ce28de7cbdb1d26d633326d7407d48bc5a04fd8c61a23e36","observation_id":"e0f145de-e02b-44fd-aa62-10185aea6347","resolution":{"observed_at":"2026-08-14T05:27:58.841154Z","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-14T05:27:59.118580Z","title":"Schulman, and Aravind Srinivasan","venue":null,"work_id":"91a43727-d5dd-4fb4-810c-1953475abfed","year":1995},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.846019Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:8f30c24bc74546c2120deb067d041f951deaf59987987f5261c4f68903517a5d","observation_id":"f4cc6efd-5dbe-41c9-8d47-30f6dd897db7","resolution":{"observed_at":"2026-08-14T05:27:59.123385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.102808Z","title":"Nguyen and Brigitte Vall \\' e e, editors","venue":null,"work_id":"0e3f7272-621f-4f9a-a866-c14b6b4bbc3a","year":2010},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.850444Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:08d8c803944be14e411784546616d5943c9631e0f8f0627f297d748b145df02b","observation_id":"28c75d85-a2a4-4ecb-a42b-540e17b09809","resolution":{"observed_at":"2026-08-14T05:27:59.107755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.087666Z","title":"New lattice based cryptographic constructions","venue":null,"work_id":"2aa7b143-0820-488b-963f-12dd7ea7ea63","year":2003},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.854948Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:606829828a529755d8ef39eeb079fc2d13ea102db073f0265cf4f0faa1763809","observation_id":"e49ae642-7969-428f-8f6e-f5af1f632ba8","resolution":{"observed_at":"2026-08-14T05:27:59.092349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.072043Z","title":"On lattices, learning with errors, random linear codes, and cryptography","venue":null,"work_id":"0d56f925-a3b8-40fc-a7c0-f3edc5208c4e","year":2005},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.859464Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:5e9599bdb9840a1d361758e34a932bf5942ccb6ea87272441845a8a897512199","observation_id":"e0539f8c-f15f-4abc-b583-92074996b022","resolution":{"observed_at":"2026-08-14T05:27:59.077373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.056639Z","title":"Lattice-based cryptography","venue":null,"work_id":"d2f416ac-cdcb-4a6a-abc9-1fb58acadf2f","year":2006},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.863986Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:9194e5e0309194d01e7428585926870d8b2facf7d6ad199e20e65d8026dd6aa3","observation_id":"0c640aec-1105-433e-aa3c-3841e3b97c63","resolution":{"observed_at":"2026-08-14T05:27:59.061700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.041505Z","title":"The learning with errors problem (invited survey)","venue":null,"work_id":"f04a0064-e9d9-44f6-a338-918655fcdb37","year":2010},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.868507Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:6cf9fb115ce58278f3ad15b379fde57c23533983d146bec70e4b452959f36463","observation_id":"ed7f2596-379c-449f-b97d-115a9708a5a0","resolution":{"observed_at":"2026-08-14T05:27:59.046132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.025956Z","title":"Lattice problems and norm embeddings","venue":null,"work_id":"d8727363-2675-4517-99d0-70276eefce4f","year":2006},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.872825Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:8aef9e8c7e0d1adbef011d810fc35330ca7896f07a8529ed2d74d88e26fa79ff","observation_id":"b2d67dab-4a05-4977-b6d0-fc15d825a189","resolution":{"observed_at":"2026-08-14T05:27:59.030851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:59.009029Z","title":"Approximating the number of error locations within a constant ratio is NP -complete","venue":null,"work_id":"c8c29bb7-e9c2-4cf8-a6f5-08c423dd8ced","year":1993},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.877964Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:2015851405723721e48adfdf999d8650b79b78ae6fccd16b609de438b8f25d56","observation_id":"fe241b8e-3b55-494d-904a-e40dc6db70a9","resolution":{"observed_at":"2026-08-14T05:27:59.015014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:58.992039Z","title":"Algorithmic complexity in coding theory and the minimum distance problem","venue":null,"work_id":"2296bdcc-2e6c-4806-8e9d-ab50fab41849","year":1997},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.882424Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:182aea96c20c2380ce155ede1fe351f205ec83b6dcfb6230afa512d91907b884","observation_id":"33700f5c-41f8-4e5d-a13f-64ccac9458b2","resolution":{"observed_at":"2026-08-14T05:27:58.997559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:58.975828Z","title":"The intractability of computing the minimum distance of a code","venue":null,"work_id":"f44115aa-4ef5-46fe-a8e0-d46d165b48db","year":1997},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.887206Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:2df514c868dffd0956cea37c939280a7642c41f3e610fb230bbb0022dcec0817","observation_id":"d17b3da1-c1ad-43cc-b1fc-20ba747a68a0","resolution":{"observed_at":"2026-08-14T05:27:58.980962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:27:58.892309Z","title":"Another NP -complete partition problem and the complexity of computing short vectors in a lattice","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-14T05:27:58.892309Z"},"links":{"citing_paper":"/paper/1909.01986"},"observation_digest":"sha256:6fc1cd490b3cad5630b09c5842fdc93d7ec03abbeb1b1bbdf11ec2aef546f0da","observation_id":"9570d72b-2d76-421d-a005-80a6c5e79935","resolution":{"observed_at":"2026-08-14T05:27:58.892309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1909.01986","last_updated":"2019-09-04T10:18:08Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-20T06:21:21.228340Z","submitted_at":"2019-09-04T10:18:08Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":46},"total_outbound_references":55},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:1909.01986."}