{"as_of":"2026-08-05T17:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9062c9b014aa53d0de2f5e313a3831fbad8941d066fe7becf963122ac24a86ee","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-05T06:32:48.257954+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-02T16:26:06.915394Z","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-22T20:12:03.709902Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.06617","last_updated":"2024-09-19T13:57:53Z","snapshot_observed_at":"2026-07-30T17:59:02.182120Z","submitted_at":"2024-08-13T04:06:23Z","title":"Towards an optimal hypergraph container lemma","version":2},"cited_work":{"arxiv_id":"2408.06617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Campos and W","venue":null,"work_id":"b254b61e-9ae5-4adb-a9ab-8de4811521e2","year":2024},"citing_paper":{"arxiv_id":"2504.08715","last_updated":"2026-05-13T12:59:35Z","snapshot_observed_at":"2026-08-02T18:01:38.954572Z","submitted_at":"2025-04-11T17:26:29Z","title":"Counting independent sets in percolated graphs via the Ising model","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T20:07:39.121497Z"},"links":{"cited_paper":"/paper/2408.06617","citing_paper":"/paper/2504.08715"},"observation_digest":"sha256:707ca551e876600338076462113cc862dfd52a8f26ec1f4e46d4556719ee8704","observation_id":"cbb708ca-c503-4ab1-8704-549a992e5511","resolution":{"observed_at":"2026-05-22T20:12:03.712942Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06617","last_updated":"2024-09-19T13:57:53Z","snapshot_observed_at":"2026-07-30T17:59:02.182120Z","submitted_at":"2024-08-13T04:06:23Z","title":"Towards an optimal hypergraph container lemma","version":2},"cited_work":{"arxiv_id":"2408.06617","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.06617","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Campos and W","venue":null,"work_id":"b254b61e-9ae5-4adb-a9ab-8de4811521e2","year":2024},"citing_paper":{"arxiv_id":"2604.15031","last_updated":"2026-07-19T15:32:28Z","snapshot_observed_at":"2026-08-05T04:39:17.566455Z","submitted_at":"2026-04-16T14:01:49Z","title":"A Hypergraph Container Method for Spread SAT: Approximation and Speedup","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T10:58:33.718104Z"},"links":{"cited_paper":"/paper/2408.06617","citing_paper":"/paper/2604.15031"},"observation_digest":"sha256:3d38726385861d0d43f5aa66af82e62353d75b0ff9c7958c04a5c5b5f29c8401","observation_id":"16717175-45bd-4195-a219-dc90e56b7c42","resolution":{"observed_at":"2026-05-10T11:00:04.015183Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06617","last_updated":"2024-09-19T13:57:53Z","snapshot_observed_at":"2026-07-30T17:59:02.182120Z","submitted_at":"2024-08-13T04:06:23Z","title":"Towards an optimal hypergraph container lemma","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06617","snapshot_observed_at":"2026-08-02T16:26:06.915394Z","title":"Towards an optimal hypergraph container lemma.arXiv preprint arXiv:2408.06617,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.15031","last_updated":"2026-07-19T15:32:28Z","snapshot_observed_at":"2026-08-05T04:39:17.566455Z","submitted_at":"2026-04-16T14:01:49Z","title":"A Hypergraph Container Method for Spread SAT: Approximation and Speedup","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T16:26:06.915394Z"},"links":{"cited_paper":"/paper/2408.06617","citing_paper":"/paper/2604.15031"},"observation_digest":"sha256:747c350241fffc316ef04135ced9edefd9739179d49cb377656ed893554764c1","observation_id":"83d483a2-b853-4224-bab9-4d370d291d17","resolution":{"observed_at":"2026-08-02T16:26:06.915394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.06617/citation-record","integrity":"/paper/2408.06617/integrity","json":"/paper/2408.06617/citation-record.json","paper":"/paper/2408.06617"},"outbound":[],"paper":{"arxiv_id":"2408.06617","last_updated":"2024-09-19T13:57:53Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-30T17:59:02.182120Z","submitted_at":"2024-08-13T04:06:23Z","title":"Towards an optimal hypergraph container lemma"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.06617."}