{"as_of":"2026-08-15T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f1e9566853b8b026e0133efd5764a342b1ac75aa76fd652d38f807e973d83846","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:01:57.178163Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":8,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","snapshot_observed_at":"2026-08-15T07:19:35.937636Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03424","snapshot_observed_at":"2026-08-11T12:01:57.178163Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.14703","last_updated":"2026-05-23T18:20:00Z","snapshot_observed_at":"2026-08-15T03:27:53.295814Z","submitted_at":"2024-12-19T10:16:49Z","title":"A brief history of quantum vs classical computational advantage","version":2},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-08-11T12:01:57.178163Z"},"links":{"cited_paper":"/paper/1505.03424","citing_paper":"/paper/2412.14703"},"observation_digest":"sha256:1d39caac884b42310c1efd37169d496bf0b0ef417e3ec1a6703d82d2009b5a76","observation_id":"4f1190fc-3583-4c69-9716-7c9c2942d7cb","resolution":{"observed_at":"2026-08-11T12:01:57.178163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","snapshot_observed_at":"2026-08-15T07:19:35.937636Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03424","snapshot_observed_at":"2026-08-11T05:41:13.487412Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.17309","last_updated":"2024-12-23T06:04:08Z","snapshot_observed_at":"2026-08-14T21:02:56.312987Z","submitted_at":"2024-12-23T06:04:08Z","title":"Quantum Approximate Optimisation Applied to Graph Similarity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T05:41:13.487412Z"},"links":{"cited_paper":"/paper/1505.03424","citing_paper":"/paper/2412.17309"},"observation_digest":"sha256:84904a6ec3dda7c6f8241bcea11b26c5c94108968eb3fbc9ed068ab9f14c655e","observation_id":"7d106b34-20ab-45b4-a404-e4645add315d","resolution":{"observed_at":"2026-08-11T05:41:13.487412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","snapshot_observed_at":"2026-08-15T07:19:35.937636Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1505.03424","snapshot_observed_at":"2026-08-06T12:07:50.620041Z","title":"Barak, A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.22117","last_updated":"2025-07-29T18:00:01Z","snapshot_observed_at":"2026-08-13T09:15:57.883430Z","submitted_at":"2025-07-29T18:00:01Z","title":"A comprehensive benchmark of an Ising machine on the Max-Cut problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T12:07:50.620041Z"},"links":{"cited_paper":"/paper/1505.03424","citing_paper":"/paper/2507.22117"},"observation_digest":"sha256:087907bdc0ccab407afcb7fb1eefb338963c182dad6a98e53f4c3b2139683c65","observation_id":"bb93cc31-9030-4478-8ef7-969e29b44bae","resolution":{"observed_at":"2026-08-06T12:07:50.620041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","snapshot_observed_at":"2026-08-15T07:19:35.937636Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","version":2},"cited_work":{"arxiv_id":"1505.03424","doi":"10.48550/arxiv.1505.03424","metadata_source":"pith","pith_arxiv_id":"1505.03424","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","venue":"cs.CC","work_id":"399232e5-872c-4737-9123-8ae91fa858d7","year":2015},"citing_paper":{"arxiv_id":"2605.23138","last_updated":"2026-05-22T01:24:54Z","snapshot_observed_at":"2026-08-13T03:30:29.263487Z","submitted_at":"2026-05-22T01:24:54Z","title":"Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T05:00:50.557828Z"},"links":{"cited_paper":"/paper/1505.03424","citing_paper":"/paper/2605.23138"},"observation_digest":"sha256:99d2bfc8ed9844ddc6c49847a2b6e7758a19858531cbbaa82f513e7db8ca9fa0","observation_id":"8d0bb04c-5068-4e4c-8041-5c23ee7198ca","resolution":{"observed_at":"2026-05-25T05:05:21.866669Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-05-25T14:53:22.094652+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T14:53:22.094652+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","snapshot_observed_at":"2026-08-15T07:19:35.937636Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","version":2},"cited_work":{"arxiv_id":"1505.03424","doi":"10.48550/arxiv.1505.03424","metadata_source":"pith","pith_arxiv_id":"1505.03424","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree","venue":"cs.CC","work_id":"399232e5-872c-4737-9123-8ae91fa858d7","year":2015},"citing_paper":{"arxiv_id":"2607.08160","last_updated":"2026-07-09T06:53:44Z","snapshot_observed_at":"2026-08-02T06:10:19.149804Z","submitted_at":"2026-07-09T06:53:44Z","title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","version":1},"reference_index":101,"source":"arxiv_source","source_observed_at":"2026-07-10T12:07:13.584708Z"},"links":{"cited_paper":"/paper/1505.03424","citing_paper":"/paper/2607.08160"},"observation_digest":"sha256:9a86d9bb5800c956446826fca43f3f54409160e24a9ed59c376fe835cbf3317c","observation_id":"0a208f0f-7633-442a-8c85-d89201797251","resolution":{"observed_at":"2026-07-10T12:17:03.874293Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-05-25T14:53:22.094652+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T14:53:22.094652+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1505.03424/citation-record","integrity":"/paper/1505.03424/integrity","json":"/paper/1505.03424/citation-record.json","paper":"/paper/1505.03424"},"outbound":[],"paper":{"arxiv_id":"1505.03424","last_updated":"2015-08-11T14:18:26Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T07:19:35.937636Z","submitted_at":"2015-05-13T15:27:16Z","title":"Beating the random assignment on constraint satisfaction problems of bounded degree"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1505.03424."}