{"as_of":"2026-08-13T01:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6eca27316eb301bbf205dcab438f656e8fe23956cfcd1d6b9e6aac1d81b54224","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:19:01.274226Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.07800/citation-record","integrity":"/paper/2608.07800/integrity","json":"/paper/2608.07800/citation-record.json","paper":"/paper/2608.07800"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0895480100380458","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.321776Z","title":"The Nonapproximability of Non-Boolean Predicates","venue":null,"work_id":"d04a207d-f0c1-45d6-a3c7-f435fa0c6962","year":2004},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.214901Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:a745990ac5761e0baa73d45b187a946d0c03b3a6824c6db289a3a0f992dc9ae3","observation_id":"e3ef3f9f-54ad-4945-aee8-7dc8b86fcb90","resolution":{"observed_at":"2026-08-11T04:19:01.325144Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.552928Z","title":"A PCP characterization of NP with optimal amortized query complexity","venue":null,"work_id":"4993c616-865b-4166-ba11-271c3f4ea774","year":2000},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.218754Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:97cd51013ef085240cbe9bf329a82cb7126f9c12088619835de2931946256606","observation_id":"dbd593a0-3872-4cc3-8f1a-e7ed7f93ec9a","resolution":{"observed_at":"2026-08-11T04:19:01.556584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.543545Z","title":"Near-optimal algorithms for unique games , year =","venue":null,"work_id":"b224b15e-8e84-475b-9394-837e90dfa146","year":null},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.222065Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:7ff0843954e4431c68a889578fb3cdaf5cc411cf39a8f379c8da09b674acf325","observation_id":"db982644-1c39-4c85-908f-09e9c5f2737e","resolution":{"observed_at":"2026-08-11T04:19:01.546860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.227053Z","title":"Gowers uniformity, influence of variables, and PCP s","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.227053Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:805c6b9439ddc67d907731c6fb4022825b58880409369a13c3d18b77edfaef5b","observation_id":"d63557cb-60d6-4965-a877-8069fa164285","resolution":{"observed_at":"2026-08-11T04:19:01.227053Z","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-11T04:19:01.535160Z","title":"2009 , doi =","venue":null,"work_id":"9851723d-e20b-48d3-8bff-e8b9674c65b2","year":2009},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.231021Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:238899db62655c8b99540c571e6e87280d3f920f51d7bfb327d44d4ba9a9e069","observation_id":"0c15eccb-04da-4d20-a0f1-3b8ddf10f59c","resolution":{"observed_at":"2026-08-11T04:19:01.538266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.525188Z","title":"Optimal algorithms and inapproximability results for every CSP ?","venue":null,"work_id":"cceec570-ba5f-4d50-99e0-db683ccaa6ca","year":null},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.234759Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:4b661ec4ff27936bceed42fdec658fa65c02b5a65d06d2f183fecd001922095a","observation_id":"a94c36cf-7eff-4dd9-b6a4-fb0533dadb08","resolution":{"observed_at":"2026-08-11T04:19:01.528909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.515396Z","title":"More Efficient Queries in PCP s for NP and Improved Approximation Hardness of Maximum CSP","venue":null,"work_id":"ac4634d7-0bce-4687-bb27-8c65d6628af4","year":null},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.238415Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:00ab6fea11d5657bca62a8f0ea23f4906711f0888c1920a4f3bb68cceaf6da8a","observation_id":"70968ea3-bc7a-4e2a-8335-d751d4fdc974","resolution":{"observed_at":"2026-08-11T04:19:01.519116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.505334Z","title":"Constraint Satisfaction over a Non- B oolean Domain: Approximation Algorithms and U nique- G ames Hardness","venue":null,"work_id":"e028648b-3dee-44fa-88c0-0963b5d6a96e","year":null},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.241774Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:6bfac115c8daf0f402db41fc16c61fcf134a594172091184cc4eec66d8b7ca0f","observation_id":"56641dd1-7661-4353-a4ff-bafd3246919c","resolution":{"observed_at":"2026-08-11T04:19:01.509088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.496217Z","title":"Approximation Resistant Predicates from Pairwise Independence","venue":null,"work_id":"0ba57e6a-1a55-4d77-8479-2796773038ce","year":2009},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.245160Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:f9c9996c41f5068cd03b82aa27214328daa94d70734b366493a5efd55bc19f35","observation_id":"450347f5-3277-4332-94e2-f6f32b839e04","resolution":{"observed_at":"2026-08-11T04:19:01.499572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.486078Z","title":"Approximating","venue":null,"work_id":"166ada2c-605e-4b7b-9428-061da0cdd612","year":2005},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.248613Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:183a69fdceae0ac6ec5393766a86b5a23062544fd73337f95b0830bd2df6e861","observation_id":"87696413-947f-4d03-9719-4842b2a203ab","resolution":{"observed_at":"2026-08-11T04:19:01.489957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/2283989","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.311277Z","title":"Journal of the American Statistical Association","venue":null,"work_id":"d6b4fa05-b06b-41b4-bb5b-931e20fc9bfe","year":null},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.252034Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:7c4a5c19f4b121a1306a5f5d3d274a0d075f53c5143e1cbe059f1b403a889753","observation_id":"e982e886-5d7b-4a2a-a784-2c0a88b5ddfe","resolution":{"observed_at":"2026-08-11T04:19:01.315410Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.476119Z","title":"Algorithmica","venue":null,"work_id":"3cb92cef-a5c8-4ac7-b1d8-5db2b65f16c2","year":null},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.255948Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:be3b68e86c79adb76da3dda7682163069a0966cf11396b663cdcab9960f781fb","observation_id":"dac7d02f-0867-4a76-bbf3-61c49b294360","resolution":{"observed_at":"2026-08-11T04:19:01.479440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.464300Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":"17274f6e-410d-426b-a474-fbfc60c2ffb7","year":2016},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.259334Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:6ef1aef0e3ec13d2718f13ec67e947fbbdd9fa58874c7504655f7ed0df755775","observation_id":"3a61772f-cd24-4004-9ef3-45bdedf726bc","resolution":{"observed_at":"2026-08-11T04:19:01.468101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.454417Z","title":"Theory of Computing , volume =","venue":null,"work_id":"6692d1d9-b996-4d81-9983-da921fed3f81","year":2014},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.262430Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:e378246f3efa4f143944841a032033394a1c9e7a02045370933ea3ca2f94c40c","observation_id":"30c35aaf-cef3-4e6d-a429-400f6ff71a5f","resolution":{"observed_at":"2026-08-11T04:19:01.457825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/dfu.vol7.15301.287","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.299145Z","title":"The Constraint Satisfaction Problem: Complexity and Approximability , editor =","venue":null,"work_id":"fb81017b-fd21-46aa-ba42-636decf10dde","year":2017},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.265842Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:71211d61bbfcae376d3cb31dd4ac1c512b908beede47c0349fab1db215258fed","observation_id":"97763c2e-b310-4c9a-908a-3cc7d648dc56","resolution":{"observed_at":"2026-08-11T04:19:01.304312Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.444479Z","title":"ACM Transactions on Computation Theory (TOCT) , volume=","venue":null,"work_id":"7feb2b64-90e8-4a30-ba9f-3a4994137d42","year":2013},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.269032Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:6205eff74878856e542a98599bcdf8b9d5d406d7d40664229f3d0abda3618628","observation_id":"60e6676a-8ef8-43d4-895e-33f9549893e7","resolution":{"observed_at":"2026-08-11T04:19:01.447865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.434477Z","title":"CoRR , volume =","venue":null,"work_id":"bf9648cb-5a36-4522-84dc-d12934825938","year":2026},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.271660Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:c92e58a2f527d2c2d3ca441bcd102fa7581a0f4ba6090dc6a10e78bac9706fce","observation_id":"f03ca5fa-b05c-4867-beb8-cdb3269d3619","resolution":{"observed_at":"2026-08-11T04:19:01.438065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T04:19:01.422702Z","title":"CoRR , volume =","venue":null,"work_id":"0e5e6e21-9bd6-4e63-9713-959fe636a9f9","year":2026},"citing_paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T04:19:01.274226Z"},"links":{"citing_paper":"/paper/2608.07800"},"observation_digest":"sha256:645c860f842daf2c9ea6214a7f6dde0026cd37cf29021dff6ae9249997977a90","observation_id":"aff51595-e9e1-4482-a3ea-564f4da04317","resolution":{"observed_at":"2026-08-11T04:19:01.426255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.07800","last_updated":"2026-08-07T22:45:27Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T01:11:31.721308Z","submitted_at":"2026-08-07T22:45:27Z","title":"Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":3,"verified_fuzzy":14},"total_outbound_references":18},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2608.07800."}