{"as_of":"2026-08-17T01:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ed5331bd78e56c4093a763e42bacd82d2aed2f9cb8cf9e02bbf0608d5a946ed","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:27:08.180031Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.01435/citation-record","integrity":"/paper/1908.01435/integrity","json":"/paper/1908.01435/citation-record.json","paper":"/paper/1908.01435"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.329833Z","title":"Alon and J","venue":null,"work_id":"593f10f0-6943-4183-927d-226757edf49d","year":2004},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.144825Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:668f8b845e22e27725736a863110c26f0126efe2a1ac07ac03956a09027ba6b0","observation_id":"dae9b25d-257d-4630-ae25-ef7df91dd9c7","resolution":{"observed_at":"2026-08-14T15:27:08.334497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.317243Z","title":null,"venue":null,"work_id":"c078a686-4306-4d63-b610-f2ebdd8a8361","year":1952},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.149524Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:5a70a0d219fa8322d75a0e76eb29ab6b6a484166dc00d4d35960e7b1ef3fc865","observation_id":"6e91a109-46ff-48db-b4ea-7a07336298cb","resolution":{"observed_at":"2026-08-14T15:27:08.321561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.303325Z","title":"Johansson, J","venue":null,"work_id":"5477f87c-e6fa-43e2-b87f-da9503289fb4","year":2008},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.153888Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:48f6865441366e47d9173526f8e089404d97622dfdb3fb32af11a8c8e8aa9a32","observation_id":"47c8ff62-59ee-43ff-a458-e406f282f373","resolution":{"observed_at":"2026-08-14T15:27:08.307289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.287771Z","title":null,"venue":null,"work_id":"682eb270-3f2f-41c5-8c47-72c966082c07","year":1972},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.158137Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:45bdc870c0086c55e7517673e72cb89a123c3a0262d9b9c92fd1a9c5e40f6daf","observation_id":"14a15004-0e4b-481a-85d6-0f42148c2621","resolution":{"observed_at":"2026-08-14T15:27:08.293359Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.271128Z","title":"Keevash, Hypergraph matchings and designs , Proc","venue":null,"work_id":"66435139-950d-4c72-9238-589ed14b26be","year":2018},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.162746Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:0a3f97d1828ade74838d8c1d7d51a57644765779e2c198e768838346c84e97bb","observation_id":"c3e59a4c-50b4-409c-b45a-01b8bc58a9d9","resolution":{"observed_at":"2026-08-14T15:27:08.277321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.255948Z","title":"K¨ uhn and D","venue":null,"work_id":"5cf75680-125a-497d-b680-5140610ba0d2","year":2006},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.166532Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:e49ba8363fcee9fc4aa85c3d3353adce648dba53f67f9b53eb127ea161c94981","observation_id":"ad0883a7-f456-427e-bfde-50c9ee253d4b","resolution":{"observed_at":"2026-08-14T15:27:08.261029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.240570Z","title":"McDiarmid, Concentration for independent permutations , Combinatorics, Probability & Computing 11, no","venue":null,"work_id":"ffc2fd59-c31a-4d01-921b-f7a6731bf598","year":2002},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.171444Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:adf88436fb469609efcb5050a361f5d2842a07dca063595941023bae0698dbce","observation_id":"a076919c-0d30-44be-a3ca-211d6d5428cf","resolution":{"observed_at":"2026-08-14T15:27:08.247356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.227061Z","title":"R¨ odl and A","venue":null,"work_id":"8e60b796-d0b7-4161-9e60-447609413436","year":2010},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.175351Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:1e46e155d553ab7f854f61635d68605d0cd82a08e20b2094d3e8420bf6ea9a06","observation_id":"cdaf5f49-1dfb-4095-a47e-5b5acf37e701","resolution":{"observed_at":"2026-08-14T15:27:08.231400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:27:08.210220Z","title":"Sudakov and V","venue":null,"work_id":"8b91b001-b871-4f20-a4f7-e0d6cdeca233","year":2008},"citing_paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:27:08.180031Z"},"links":{"citing_paper":"/paper/1908.01435"},"observation_digest":"sha256:ebfe8ed8407ba92186d5b499477f87f075d0e99d211bc1f6f045c0f9d51d6a43","observation_id":"54201978-9bf6-4425-a50d-5b57675a7a95","resolution":{"observed_at":"2026-08-14T15:27:08.216300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01435","last_updated":"2020-02-07T22:06:37Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T10:27:08.117707Z","submitted_at":"2019-08-05T01:17:49Z","title":"Co-degrees resilience for perfect matchings in random hypergraphs"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":9},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:1908.01435."}