{"as_of":"2026-08-20T06:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0783fdbe8006647e7bd9d02c4590406b6890a5aba687c2553fc2d1b998366056","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-08-06T19:41:01.520618Z","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-11T06:25:58.217097Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.03816","last_updated":"2026-07-06T12:54:29Z","snapshot_observed_at":"2026-08-16T12:43:55.205749Z","submitted_at":"2025-04-04T15:39:40Z","title":"A short proof of Tuza's conjecture for weak saturation in hypergraphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03816","snapshot_observed_at":"2026-08-06T19:41:01.520618Z","title":"Terekhov, A short proof of Tuza’s conjecture for weak saturation in hypergraphs , arXiv preprint (2025) arXiv:2504.03816","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.05697","last_updated":"2025-07-08T06:09:01Z","snapshot_observed_at":"2026-08-14T13:00:24.969461Z","submitted_at":"2025-07-08T06:09:01Z","title":"When does a tree activate the random graph?","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T19:41:01.520618Z"},"links":{"cited_paper":"/paper/2504.03816","citing_paper":"/paper/2507.05697"},"observation_digest":"sha256:f23e7525a8f6de3bf20bf4c8336ce6469ce1cabbce2bac8a05e3fc954ae4db21","observation_id":"d208afee-2e1b-401d-8d5a-6bf3bd9b7c43","resolution":{"observed_at":"2026-08-06T19:41:01.520618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03816","last_updated":"2026-07-06T12:54:29Z","snapshot_observed_at":"2026-08-16T12:43:55.205749Z","submitted_at":"2025-04-04T15:39:40Z","title":"A short proof of Tuza's conjecture for weak saturation in hypergraphs","version":3},"cited_work":{"arxiv_id":"2504.03816","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.03816","snapshot_observed_at":"2026-07-07T02:19:37.747754Z","title":null,"venue":null,"work_id":"2703a5ff-46d7-40fb-aeba-ddc087099e4c","year":null},"citing_paper":{"arxiv_id":"2604.07104","last_updated":"2026-07-06T12:47:37Z","snapshot_observed_at":"2026-08-17T07:14:13.646482Z","submitted_at":"2026-04-08T13:56:51Z","title":"Asymptotically optimal lower bounds on weak saturation numbers for hypergraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T17:39:22.333212Z"},"links":{"cited_paper":"/paper/2504.03816","citing_paper":"/paper/2604.07104"},"observation_digest":"sha256:05014bd7d8dad87ff7b5df6f8212f1fc2ee3e85e97c70b5c6b889e772064acd7","observation_id":"1a59be44-f9d9-437a-a609-96b9bb7e8558","resolution":{"observed_at":"2026-07-07T02:19:37.747754Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.03816/citation-record","integrity":"/paper/2504.03816/integrity","json":"/paper/2504.03816/citation-record.json","paper":"/paper/2504.03816"},"outbound":[],"paper":{"arxiv_id":"2504.03816","last_updated":"2026-07-06T12:54:29Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T12:43:55.205749Z","submitted_at":"2025-04-04T15:39:40Z","title":"A short proof of Tuza's conjecture for weak saturation in hypergraphs"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2504.03816."}