{"as_of":"2026-08-21T11:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d74b7c482d912d144a771c1f3aba64a5c1c66cc59597b3a237785c3917b36d0","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:57:25.829179Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.10248/citation-record","integrity":"/paper/1908.10248/integrity","json":"/paper/1908.10248/citation-record.json","paper":"/paper/1908.10248"},"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-14T10:57:26.164352Z","title":"Sivakumar","venue":null,"work_id":"f5254e18-07b7-4028-9488-0fbd832e68cc","year":1999},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.739392Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:8307a743f8b61f99433d7b1b98e9c943701869ce82fd8d347c6e8811eff98070","observation_id":"1b8e0dc6-377f-4a39-a4aa-b229cd82b9c0","resolution":{"observed_at":"2026-08-14T10:57:26.169249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.148452Z","title":"Chan and Ryan Williams","venue":null,"work_id":"5364c7b7-2ac8-4b41-80a6-6f610e7b6044","year":2016},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.744576Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:02d581a737ffa25d9015ec6f17791bc4f3c3774bc400116b678ccd3f6a60cf11","observation_id":"022fda50-ecc5-4af0-80ea-f25a402787ed","resolution":{"observed_at":"2026-08-14T10:57:26.153477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.116364Z","title":"Papadimitr iou","venue":null,"work_id":"f951acc1-b9be-4adc-8962-85f92e9a9678","year":2011},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.754146Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:c6cb0a76416c4644adc46b3c2de849850a463997ab0e47873cf1a7dbaf4fee48","observation_id":"d39f7286-e483-43c5-8e00-9de8259d70ff","resolution":{"observed_at":"2026-08-14T10:57:26.121336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.082003Z","title":"Relations between average case comple xity and approxima- tion complexity","venue":null,"work_id":"8104e354-a98e-4933-9bf1-3a2d8332da2a","year":2002},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.764521Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:e492c1191fc87c24066a6e4834d4cb66d80c3e1b40e04a39f250fd30ebb30d0d","observation_id":"3f5142e7-17c9-47bb-9a1b-f1719d50f0e3","resolution":{"observed_at":"2026-08-14T10:57:26.087496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.065699Z","title":"Levin, R amarathnam V enkatesan, and David Zuckerman","venue":null,"work_id":"a9231590-2d88-4966-a70d-7f5909da333e","year":1990},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.774555Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:17ec397072e466dbcfb058671e2219bc046373130da2e83b1597ef4359891daa","observation_id":"241c13cf-0a7b-4ecb-a5bf-4540d0ce73f0","resolution":{"observed_at":"2026-08-14T10:57:26.071071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.031417Z","title":"Hardness of continu ous local search: Query complexity and cryptographic lower bounds","venue":null,"work_id":"c3761a2c-b8f0-4d0e-b6f2-7a4a45b08f5e","year":2017},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.783788Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:062d7331c92fc835b07641001bbfbfe76f794e23d37882838dc833015d6ab762","observation_id":"907923b9-7502-4d4e-a44e-43815aaa0e41","resolution":{"observed_at":"2026-08-14T10:57:26.037241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:25.929606Z","title":"List-decoding using the XOR lemma","venue":null,"work_id":"8d8adc73-d133-4bc5-9e81-29edc13e23cb","year":2003},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.819515Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:deb1935b6801f142089b8c3b50295a2da3a9767453a81a7f705b6dc77bff8003","observation_id":"fd5c3bea-58cf-4c33-b2a1-8fa21c9e6b7c","resolution":{"observed_at":"2026-08-14T10:57:25.936568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:25.893328Z","title":"Theory and applications of tra pdoor functions (ex- tended abstract)","venue":null,"work_id":"df3f05f5-1493-4f90-9fae-f601fca93e32","year":1982},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.829179Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:e372aa202e4941a0610058bfbfee0999e6e7d135e42ef54937c2d4178ff58ec6","observation_id":"acc8dd91-9e0c-4e89-a022-4c3f3c3a9e80","resolution":{"observed_at":"2026-08-14T10:57:25.900444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:25.980511Z","title":"On nondeterministic derandomi zation of freivalds’ algorithm: Consequences, avenues and algorithmic progres s","venue":null,"work_id":"fc4be301-588b-4ec7-b3cf-e8c3818b8242","year":2018},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.798104Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:baa7e0c003dc6b84c36e7ed7f1918c5b558861e6b9c3de6c52935f3dd0691c5d","observation_id":"61dde472-7af8-432b-999e-94098b2df747","resolution":{"observed_at":"2026-08-14T10:57:25.986734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:25.809107Z","title":"A birthday re petition theorem and complexity of approximating dense CSPs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":1989,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.809107Z"},"links":{"cited_paper":"/paper/1607.02986","citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:66541195a3db836056c87795209ffad4d10f3cbc6df61b82e6ae95ff14b6f235","observation_id":"9b653bba-16f9-48e6-83d0-1b1cda740446","resolution":{"observed_at":"2026-08-14T10:57:25.809107Z","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-14T10:57:25.948059Z","title":"Settling the complexity of compu ting approximate two- player nash equilibria","venue":null,"work_id":"740fbc2c-2496-4481-980a-e9a43a8fa4a3","year":2016},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.814618Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:6d033625fa3ea6eb978f17a4d31ddbb6463de9dea5f0c3fc788ccbf7a41b618b","observation_id":"97c9a466-b5e9-4247-8cb5-190c601f160e","resolution":{"observed_at":"2026-08-14T10:57:25.953150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.249182Z","title":"Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made","venue":null,"work_id":"ab037174-d920-4436-b9dd-54f3138118d1","year":2016},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.711305Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:3edfc9061289d4f3270ecd1be9f6b6b3526a924f430b1fb1197c4f45410705e0","observation_id":"45f5109d-7f86-495d-83fb-0ea88efce438","resolution":{"observed_at":"2026-08-14T10:57:26.254114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:25.999360Z","title":"[IW97] Russell Impagliazzo and Avi Wigderson","venue":null,"work_id":"125f4196-193f-4847-b9c8-c3fb886ad212","year":1997},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.793244Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:2db2003dc6f2891d50100562c3e800b314a77b103356dea33e5f99e353b3d2ab","observation_id":"8508f1e4-c02e-48c7-a64e-bcba41a52f54","resolution":{"observed_at":"2026-08-14T10:57:26.004429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.03841","last_updated":"2018-11-09T10:06:17Z","snapshot_observed_at":"2026-08-14T18:01:44.232345Z","submitted_at":"2018-11-09T10:06:17Z","title":"Unique End of Potential Line","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.03841","snapshot_observed_at":"2026-08-14T10:57:25.769251Z","title":"Unique end of potential line","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.769251Z"},"links":{"cited_paper":"/paper/1811.03841","citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:6ba13183cd64b5fbbd154e4f0a604221801dc9b82a26c418f463bdb4196dc8d0","observation_id":"57c47a3b-169c-49b9-8724-f6069f5f4795","resolution":{"observed_at":"2026-08-14T10:57:25.769251Z","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-14T10:57:25.911611Z","title":"On uniform amplification of hardness i n NP","venue":null,"work_id":"ee5ea199-e3ab-4521-b75d-795879ee1bd9","year":2005},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.824403Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:70e24c530ef16485b5d3e5bb2ec57f3d1efebd3e023c11d626655c255dd4a266","observation_id":"62b83912-d22a-4fc1-897d-ce97fec48998","resolution":{"observed_at":"2026-08-14T10:57:25.917154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.233887Z","title":"Papadimitriou, and A viad Rubinstein","venue":null,"work_id":"5335df45-099d-4b9f-b01f-8275e948834b","year":2016},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.717524Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:63a6f81216db64fc68c773fcbfca49f51631a227ac1c6f5f15d194020501759a","observation_id":"506fefe8-e588-4d15-ae80-737084cbb433","resolution":{"observed_at":"2026-08-14T10:57:26.238890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.179826Z","title":"A duality between clause width and clause density for SAT","venue":null,"work_id":"154e4012-1dbb-463d-be61-565677e9f2d0","year":2006},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.733792Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:df3bd34c7cda555a246e02555ba3263878c67c7bd6b18d131a6c1a4540b59c19","observation_id":"5eef462b-7204-4664-9770-81dff65b2a17","resolution":{"observed_at":"2026-08-14T10:57:26.184907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.098272Z","title":"Direct product testing","venue":null,"work_id":"41573b13-2270-462c-a406-e83a525e95f9","year":2014},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.759447Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:1990ea28171ec816b84f19fbf3aa1bb35d3e7d153cffa24f97d85ec7e1304020","observation_id":"f515e080-c56b-4c01-b5dc-735a9421fe01","resolution":{"observed_at":"2026-08-14T10:57:26.103394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.015728Z","title":"Hard-core distributions for somewhat hard problems","venue":null,"work_id":"4fe9a817-c364-42f5-9c41-f593d0aa6122","year":1995},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.788660Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:8799cc8c63a7f65a0d803ade38fe78e801dbd1cbffae550467d7be0751cdd1ac","observation_id":"df27eb04-a98f-46f3-a45d-590f5e1907d0","resolution":{"observed_at":"2026-08-14T10:57:26.020690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.216334Z","title":"Why walking the dog takes time: Frech et distance has no strongly subquadratic algorithms unless SETH fails","venue":null,"work_id":"55ff32ea-4bf4-4b93-b5a4-7aa11e320aa4","year":2014},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.722736Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:b097e6074ccf94e01c5271263f8b5bea1bb4936ed6a81b98fe3b5197aef3e642","observation_id":"584903f4-98e6-40b4-9487-38e6b9386cdd","resolution":{"observed_at":"2026-08-14T10:57:26.223017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.197395Z","title":"Average-case fine-grained hardness","venue":null,"work_id":"1090ff16-d255-47dc-93c7-a2d44a631de0","year":2017},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.728607Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:74acabf9dfcf8306419cee4b41694c4643b1f109ed5134cbf9402a96ac321fd9","observation_id":"9cea4753-9f5b-433f-8f4d-22218dd2b815","resolution":{"observed_at":"2026-08-14T10:57:26.203920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.132192Z","title":"Locally testing di rect product in the low error range","venue":null,"work_id":"50462fd2-693f-49d9-83ef-7da70082ee52","year":2008},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.749334Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:66215a75865bd1611552b51ba9d2226ce45f1e09cd1083a47753593be20ed7bd","observation_id":"add4cf36-f8af-4d0f-b89c-73e1ea342925","resolution":{"observed_at":"2026-08-14T10:57:26.137657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.049506Z","title":"Rothblum","venue":null,"work_id":"c60fe99e-1818-4b31-b648-2debcff8219c","year":2018},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.779230Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:4a74d2379e40830ed7757102573e23f4cbceb77d486872a41e4680be77b0b05e","observation_id":"9f5563d3-3461-4d51-8e24-edf9d241d25a","resolution":{"observed_at":"2026-08-14T10:57:26.055032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:25.964054Z","title":null,"venue":null,"work_id":"dd1f52c7-87d2-4270-bdc8-d7792e7b510f","year":1989},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.803897Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:cd6d3c3d8c0cfaf69ce9c81879c9f259c695440e981dcfc49c2a9edffdb59f52","observation_id":"b8f1468e-5b61-49de-b32b-22bb28ea37a1","resolution":{"observed_at":"2026-08-14T10:57:25.969020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-14T10:57:26.265557Z","title":"Tight hardness results for LCS and other sequence similarity meas ures","venue":null,"work_id":"14e2046c-61bc-4198-9c0a-9071b071242d","year":2015},"citing_paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T10:57:25.703846Z"},"links":{"citing_paper":"/paper/1908.10248"},"observation_digest":"sha256:6fdb6d0c490257487f11c95b667fd9f2f1d83a2576420388b614eba2ce19bd22","observation_id":"639ff4b3-4b30-435d-bcc4-23e0b00f988a","resolution":{"observed_at":"2026-08-14T10:57:26.272138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.10248","last_updated":"2019-08-27T14:56:12Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-21T06:39:10.942130Z","submitted_at":"2019-08-27T14:56:12Z","title":"Hardness Amplification of Optimization Problems"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":25},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:1908.10248."}