{"as_of":"2026-08-15T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc198755e0c1ece2e9ad3306722bf0a46894966ac222c59dff905ddf6f7fb418","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:31:51.723522Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T11:31:51.805196Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1210.3581","last_updated":"2018-08-23T20:41:13Z","snapshot_observed_at":"2026-08-15T19:40:02.383973Z","submitted_at":"2012-10-12T17:19:29Z","title":"A natural barrier in random greedy hypergraph matching","version":2},"cited_work":{"arxiv_id":"1210.3581","doi":null,"metadata_source":"pith","pith_arxiv_id":"1210.3581","snapshot_observed_at":"2026-08-12T11:31:51.805196Z","title":"A natural barrier in random greedy hypergraph matching","venue":"math.CO","work_id":"5e36972c-ad2f-4041-95d6-1528bd2e32ce","year":2012},"citing_paper":{"arxiv_id":"2411.18291","last_updated":"2024-11-27T12:28:53Z","snapshot_observed_at":"2026-08-12T11:18:01.996802Z","submitted_at":"2024-11-27T12:28:53Z","title":"A short proof of the existence of designs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T11:31:51.723522Z"},"links":{"cited_paper":"/paper/1210.3581","citing_paper":"/paper/2411.18291"},"observation_digest":"sha256:00083f83807d1862d5f26877af40038dcdaa683769f046b3b6534b6d2ff90344","observation_id":"4f757dc7-bd73-4875-9cee-940d772842c5","resolution":{"observed_at":"2026-08-12T11:31:51.810132Z","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-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1210.3581/citation-record","integrity":"/paper/1210.3581/integrity","json":"/paper/1210.3581/citation-record.json","paper":"/paper/1210.3581"},"outbound":[],"paper":{"arxiv_id":"1210.3581","last_updated":"2018-08-23T20:41:13Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-15T19:40:02.383973Z","submitted_at":"2012-10-12T17:19:29Z","title":"A natural barrier in random greedy hypergraph matching"},"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 1 inbound Pith citation observation for arXiv:1210.3581."}