{"as_of":"2026-08-09T15:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19918ea2a04197b25ce122bebe21d7dc45fdd240aa2fecfae0b2aa7fa8ab6bfb","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:26.026517Z","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.721115Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.01836","last_updated":"2025-06-24T04:51:07Z","snapshot_observed_at":"2026-07-06T19:44:38.954993Z","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01836","snapshot_observed_at":"2026-08-07T04:24:26.026517Z","title":"Some easy optimization problems have the overlap-gap property","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-07T21:46:25.184559Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.026517Z"},"links":{"cited_paper":"/paper/2411.01836","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:15d3ff573e5c4013ff73e74aa3e36202586cbc7081155cf4f98a4501d7af8bbd","observation_id":"e0354515-e6f9-4d70-9316-9389ca1a0e59","resolution":{"observed_at":"2026-08-07T04:24:26.026517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01836","last_updated":"2025-06-24T04:51:07Z","snapshot_observed_at":"2026-07-06T19:44:38.954993Z","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01836","snapshot_observed_at":"2026-08-06T01:06:13.609144Z","title":"Some easy optimization problems have the overlap-gap property","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.04133","last_updated":"2025-08-06T06:58:51Z","snapshot_observed_at":"2026-08-08T03:02:17.526361Z","submitted_at":"2025-08-06T06:58:51Z","title":"Polynomial-time sampling despite disorder chaos","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T01:06:13.609144Z"},"links":{"cited_paper":"/paper/2411.01836","citing_paper":"/paper/2508.04133"},"observation_digest":"sha256:f416360e1174da7e3a681b7165634a196cdd9aa02bcd41ef56cb7040703eb0c0","observation_id":"74a73f24-8a51-41b5-bac9-e87b095f5699","resolution":{"observed_at":"2026-08-06T01:06:13.609144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01836","last_updated":"2025-06-24T04:51:07Z","snapshot_observed_at":"2026-07-06T19:44:38.954993Z","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property","version":3},"cited_work":{"arxiv_id":"2411.01836","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01836","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Some easy optimization problems have the overlap-gap property","venue":null,"work_id":"4fd6e687-d683-47eb-bb10-9a096a8557e3","year":2024},"citing_paper":{"arxiv_id":"2605.05618","last_updated":"2026-05-07T03:17:33Z","snapshot_observed_at":"2026-08-04T07:55:18.584452Z","submitted_at":"2026-05-07T03:17:33Z","title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-05-08T06:21:23.923750Z"},"links":{"cited_paper":"/paper/2411.01836","citing_paper":"/paper/2605.05618"},"observation_digest":"sha256:74cb325226b7ac407c45751acaf206ec974a2ba04ebb36554740422ace8dae37","observation_id":"e2ea4ba0-957a-46a7-a632-c75bd836283b","resolution":{"observed_at":"2026-05-11T21:11:20.723972Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.01836/citation-record","integrity":"/paper/2411.01836/integrity","json":"/paper/2411.01836/citation-record.json","paper":"/paper/2411.01836"},"outbound":[],"paper":{"arxiv_id":"2411.01836","last_updated":"2025-06-24T04:51:07Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T19:44:38.954993Z","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2411.01836."}