{"as_of":"2026-08-17T20:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ee6198a13b9f22f55e81ff388e9ca37948adc43ca73d511a77fc59ad76de3d6","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:01:37.480510Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T03:09:42.968897Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T21:11:20.707993Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"cited_work":{"arxiv_id":"2508.20785","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.20785","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","venue":null,"work_id":"e6b569be-ce3e-4382-bf01-2130b757bc83","year":2025},"citing_paper":{"arxiv_id":"2604.19712","last_updated":"2026-04-21T17:36:33Z","snapshot_observed_at":"2026-07-06T23:06:16.972438Z","submitted_at":"2026-04-21T17:36:33Z","title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T03:09:42.968897Z"},"links":{"cited_paper":"/paper/2508.20785","citing_paper":"/paper/2604.19712"},"observation_digest":"sha256:4566cc9009ee78f0f68854ff9a573838e041f6497e28c312c804942dea7b7dc9","observation_id":"92c35697-5d12-4469-b609-ff0877a02aef","resolution":{"observed_at":"2026-05-11T12:41:05.018272Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"cited_work":{"arxiv_id":"2508.20785","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.20785","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","venue":null,"work_id":"e6b569be-ce3e-4382-bf01-2130b757bc83","year":2025},"citing_paper":{"arxiv_id":"2605.05618","last_updated":"2026-05-07T03:17:33Z","snapshot_observed_at":"2026-08-14T18:29:33.852224Z","submitted_at":"2026-05-07T03:17:33Z","title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-08T06:21:23.923750Z"},"links":{"cited_paper":"/paper/2508.20785","citing_paper":"/paper/2605.05618"},"observation_digest":"sha256:8f50e48b60438e1988d61b71e652be4fa41d6ecb461135ca21ac96cc948b4845","observation_id":"48291f4b-8a6a-437a-9c81-7ed0ed0b9e16","resolution":{"observed_at":"2026-05-11T21:11:20.710617Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.20785/citation-record","integrity":"/paper/2508.20785/integrity","json":"/paper/2508.20785/citation-record.json","paper":"/paper/2508.20785"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.11132","last_updated":"2018-04-20T04:10:11Z","snapshot_observed_at":"2026-08-14T19:31:03.434773Z","submitted_at":"2018-03-29T16:10:04Z","title":"Notes on computational-to-statistical gaps: predictions using statistical physics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.11132","snapshot_observed_at":"2026-08-15T17:01:37.438027Z","title":"Algorithmic barriers from phase transi- tions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:01:37.438027Z"},"links":{"cited_paper":"/paper/1803.11132","citing_paper":"/paper/2508.20785"},"observation_digest":"sha256:a5e4ed55ab97508ca3ade16c40ad325aaf97fd431db47edf2bd99e6186e2f11f","observation_id":"3a8d1078-723e-4ae2-b05f-03d29d8568d3","resolution":{"observed_at":"2026-08-15T17:01:37.438027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02129","last_updated":"2021-10-29T23:58:41Z","snapshot_observed_at":"2026-08-16T18:19:49.427801Z","submitted_at":"2021-06-03T21:01:02Z","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02129","snapshot_observed_at":"2026-08-15T17:01:37.450011Z","title":"The Algorithmic Phase Transition of Randomk-SAT for Low Degree Polynomials","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:01:37.450011Z"},"links":{"cited_paper":"/paper/2106.02129","citing_paper":"/paper/2508.20785"},"observation_digest":"sha256:313eedb6088c92e71d6dd5b29434e982b288e82ca008276e211b71d2477d065d","observation_id":"9c8784d5-28e7-4378-9fa7-4c4d1b7d90b7","resolution":{"observed_at":"2026-08-15T17:01:37.450011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15312","last_updated":"2025-01-25T19:51:38Z","snapshot_observed_at":"2026-08-16T00:45:34.428696Z","submitted_at":"2025-01-25T19:51:38Z","title":"Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15312","snapshot_observed_at":"2026-08-15T17:01:37.460195Z","title":"On the independence number of random graphs","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:01:37.460195Z"},"links":{"cited_paper":"/paper/2501.15312","citing_paper":"/paper/2508.20785"},"observation_digest":"sha256:c66f0105d4649b91387e2612cac89d44b0d6c1c20ea4614fb306ce5cbbbbd9ac","observation_id":"c59ee4bc-e5bc-427f-8dea-5c50f0774637","resolution":{"observed_at":"2026-08-15T17:01:37.460195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04632","last_updated":"2025-04-06T22:01:47Z","snapshot_observed_at":"2026-08-16T12:43:32.959338Z","submitted_at":"2025-04-06T22:01:47Z","title":"Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04632","snapshot_observed_at":"2026-08-15T17:01:37.469497Z","title":"Problem List","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:01:37.469497Z"},"links":{"cited_paper":"/paper/2504.04632","citing_paper":"/paper/2508.20785"},"observation_digest":"sha256:ae34bbf609cccd88da79458f60497463e7dd00e6ce0ecacbbcc605d3c262417c","observation_id":"34691695-03b0-4c6c-9ea0-d3fcea742f6f","resolution":{"observed_at":"2026-08-15T17:01:37.469497Z","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-15T17:01:37.606095Z","title":"Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2024, 123:1–123:20 (cit","venue":null,"work_id":"4ba7c538-d2b0-49a5-8ac7-edbe8ebd62f0","year":2024},"citing_paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets","version":2},"reference_index":297,"source":"pdf_text","source_observed_at":"2026-08-15T17:01:37.480510Z"},"links":{"citing_paper":"/paper/2508.20785"},"observation_digest":"sha256:929935fa95225b58c4b3cf2a5fd8f161554d328879d2241c256ca2b7bbd42659","observation_id":"4a18b6a4-9954-46d1-962f-9e6a4130a545","resolution":{"observed_at":"2026-08-15T17:01:37.614048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.20785","last_updated":"2025-09-10T22:33:22Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T00:45:43.446731Z","submitted_at":"2025-08-28T13:47:54Z","title":"Sharp Online Hardness for Large Balanced Independent Sets"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":5},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 2 inbound Pith citation observations for arXiv:2508.20785."}