{"as_of":"2026-08-12T14:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd206c71e0b264c7fea2be59b466ad3e3fbfa6bdeeda6c02abb312b7c4e93ba0","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:49:49.735370Z","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-07-08T16:25:09.892423Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.08981","snapshot_observed_at":"2026-08-06T16:49:49.735370Z","title":"Delcourt and L","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.13329","last_updated":"2025-07-17T17:47:55Z","snapshot_observed_at":"2026-08-09T03:50:32.141258Z","submitted_at":"2025-07-17T17:47:55Z","title":"Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T16:49:49.735370Z"},"links":{"cited_paper":"/paper/2204.08981","citing_paper":"/paper/2507.13329"},"observation_digest":"sha256:0184b5fbd95012c282419d5945d5437a73047aac9246967c78503c1677ae59b6","observation_id":"e9ffc0a9-ab17-4e2c-8c9a-8dba52e439eb","resolution":{"observed_at":"2026-08-06T16:49:49.735370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.08981","snapshot_observed_at":"2026-08-06T10:41:59.268280Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.23624","last_updated":"2025-07-31T15:03:54Z","snapshot_observed_at":"2026-08-07T01:23:18.147658Z","submitted_at":"2025-07-31T15:03:54Z","title":"Erd\\H{o}s meets Nash-Williams","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T10:41:59.268280Z"},"links":{"cited_paper":"/paper/2204.08981","citing_paper":"/paper/2507.23624"},"observation_digest":"sha256:b4804aecd5d635827ff040525838d46e0d54129b99f9b634e167443f1e0cc429","observation_id":"b07ad50c-aac0-4e4b-879e-f9cc3a61c6bc","resolution":{"observed_at":"2026-08-06T10:41:59.268280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","version":3},"cited_work":{"arxiv_id":"2204.08981","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.08981","snapshot_observed_at":"2026-07-08T16:25:09.892423Z","title":"Delcourt and L","venue":"math.CO","work_id":"683ad23a-016a-441a-b752-21bd04a186c9","year":2022},"citing_paper":{"arxiv_id":"2605.11949","last_updated":"2026-07-30T02:47:30Z","snapshot_observed_at":"2026-08-07T08:30:24.503456Z","submitted_at":"2026-05-12T10:58:27Z","title":"Sharp asymptotic bounds for uniform union-free hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T05:02:44.085197Z"},"links":{"cited_paper":"/paper/2204.08981","citing_paper":"/paper/2605.11949"},"observation_digest":"sha256:1f27265c3376f7aa3cac73906d24607ddf5b3c56a47916cc6280b6b437fefc6c","observation_id":"57d30ed9-9271-4bd3-ad0e-50649b8faeb1","resolution":{"observed_at":"2026-05-13T05:07:17.805303Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","version":3},"cited_work":{"arxiv_id":"2204.08981","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.08981","snapshot_observed_at":"2026-07-08T16:25:09.892423Z","title":"Delcourt and L","venue":"math.CO","work_id":"683ad23a-016a-441a-b752-21bd04a186c9","year":2022},"citing_paper":{"arxiv_id":"2605.11949","last_updated":"2026-07-30T02:47:30Z","snapshot_observed_at":"2026-08-07T08:30:24.503456Z","submitted_at":"2026-05-12T10:58:27Z","title":"Sharp asymptotic bounds for uniform union-free hypergraphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-14T20:58:30.414161Z"},"links":{"cited_paper":"/paper/2204.08981","citing_paper":"/paper/2605.11949"},"observation_digest":"sha256:7c97e81bd246b685e3ddebad300e75d5188114b2c3dc9e22f9d50f3aa3ab58e7","observation_id":"50136a35-fae9-4b90-8800-41487a566abc","resolution":{"observed_at":"2026-05-14T20:59:27.304580Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.08981","snapshot_observed_at":"2026-08-02T14:33:55.567729Z","title":"Delcourt and L","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.11949","last_updated":"2026-07-30T02:47:30Z","snapshot_observed_at":"2026-08-07T08:30:24.503456Z","submitted_at":"2026-05-12T10:58:27Z","title":"Sharp asymptotic bounds for uniform union-free hypergraphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T14:33:55.567729Z"},"links":{"cited_paper":"/paper/2204.08981","citing_paper":"/paper/2605.11949"},"observation_digest":"sha256:0dfb7978e186fff80bab17e7d853f9596e4e6bafa29df6e1cfd8e22bb420d6ea","observation_id":"9b0dde03-0b34-4ebf-aaf7-55eb86aa9e39","resolution":{"observed_at":"2026-08-02T14:33:55.567729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings","version":3},"cited_work":{"arxiv_id":"2204.08981","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.08981","snapshot_observed_at":"2026-07-08T16:25:09.892423Z","title":"Delcourt and L","venue":"math.CO","work_id":"683ad23a-016a-441a-b752-21bd04a186c9","year":2022},"citing_paper":{"arxiv_id":"2607.06113","last_updated":"2026-07-07T10:22:54Z","snapshot_observed_at":"2026-08-07T14:34:05.447928Z","submitted_at":"2026-07-07T10:22:54Z","title":"Solution to a conjecture of Alon, D\\k{e}bski, Grytczuk and Przyby\\l{}o on fixed-cardinality arithmetic progressions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T16:20:17.382586Z"},"links":{"cited_paper":"/paper/2204.08981","citing_paper":"/paper/2607.06113"},"observation_digest":"sha256:0da7bbeed59bcc51a7238c181e1b1a019966b89e63f32c8c6b8d28ace54bd2dd","observation_id":"88d40b50-b2aa-4ff5-8503-69314c38dc3e","resolution":{"observed_at":"2026-07-08T16:25:09.894386Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2204.08981/citation-record","integrity":"/paper/2204.08981/integrity","json":"/paper/2204.08981/citation-record.json","paper":"/paper/2204.08981"},"outbound":[],"paper":{"arxiv_id":"2204.08981","last_updated":"2024-12-24T19:37:17Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T14:11:51.832318Z","submitted_at":"2022-04-19T16:32:34Z","title":"Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2204.08981."}