{"as_of":"2026-08-23T17:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8f053f93feb9c34a5b9448dc1c54dfccba86655a23dc3b0958faa74584b36bb","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:51:08.588225Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2505.17981/citation-record","integrity":"/paper/2505.17981/integrity","json":"/paper/2505.17981/citation-record.json","paper":"/paper/2505.17981"},"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-07T14:51:11.182700Z","title":"Balogh, N","venue":null,"work_id":"5b4c0367-51fe-418c-b594-b1ab69cf3bbd","year":2021},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.214258Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:f2ee3bb5b357488d82a9ed58c10895286aa091e671524c5148fe892d546a0922","observation_id":"d03cb471-5192-46d8-be1d-3682bcb4a735","resolution":{"observed_at":"2026-08-07T14:51:11.243742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.05606","last_updated":"2025-05-08T19:31:50Z","snapshot_observed_at":"2026-08-15T22:59:15.876820Z","submitted_at":"2025-05-08T19:31:50Z","title":"Perfect tilings of 3-graphs with the generalised triangle","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.05606","snapshot_observed_at":"2026-08-07T14:51:07.311913Z","title":"Bowtell, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.311913Z"},"links":{"cited_paper":"/paper/2505.05606","citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:86e709fcaccfb74a75e8b3266565ce405d2d9c3c6f730e75bf2ad935b1e694e5","observation_id":"52d6c80a-e36d-4f9e-8676-e2dd11c775fa","resolution":{"observed_at":"2026-08-07T14:51:07.311913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:51:11.031537Z","title":null,"venue":null,"work_id":"49ffb755-750c-4e6b-9f55-4aa171b8d289","year":1981},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.431245Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:e2ba32a12c415570170aba29508818f29f755f549e1f6844477fa4f4e6eb08cf","observation_id":"c72c6439-839a-4913-a84d-9dc8ff551b5e","resolution":{"observed_at":"2026-08-07T14:51:11.104829Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:10.886202Z","title":null,"venue":null,"work_id":"e4195f6f-9f80-4dbe-81fc-b195d5f91538","year":1965},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.523205Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:22e68dcfce5eea3438b961d868799ef27ce0c047566ee3345b46a18fa2606a22","observation_id":"c6cc8d95-b4fe-4516-bafe-a0ef083fff6a","resolution":{"observed_at":"2026-08-07T14:51:10.934376Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.09185","last_updated":"2024-09-13T20:44:50Z","snapshot_observed_at":"2026-08-16T13:18:41.005287Z","submitted_at":"2024-09-13T20:44:50Z","title":"Positive co-degree thresholds for spanning structures","version":1},"cited_work":{"arxiv_id":"2409.09185","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.09185","snapshot_observed_at":"2026-08-07T14:51:09.046936Z","title":"Positive co-degree thresholds for spanning structures","venue":"math.CO","work_id":"0628574f-2025-4c21-ba26-e0d332762c23","year":2024},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.595151Z"},"links":{"cited_paper":"/paper/2409.09185","citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:2ed76ba36f3b47ccd88560037240d4e3ec70103c05fdcd0182a7c1dfdb5b4577","observation_id":"a09b270a-c9ef-4972-8ab8-156a82773f59","resolution":{"observed_at":"2026-08-07T14:51:09.101420Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:10.716038Z","title":null,"venue":null,"work_id":"706b0464-a29b-4f6e-9fba-5a1c1918a7f9","year":1935},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.648056Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:d05a7ed01bdeb457941392457748bc8888b3c03a04a9da0e2a6c7ba0b3d94973","observation_id":"22c035c5-21e9-472c-b982-e4946683b73c","resolution":{"observed_at":"2026-08-07T14:51:10.796305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06275","last_updated":"2025-06-16T07:53:13Z","snapshot_observed_at":"2026-08-16T13:36:02.875316Z","submitted_at":"2024-07-08T18:00:07Z","title":"Spanning spheres in Dirac hypergraphs","version":2},"cited_work":{"arxiv_id":"2407.06275","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.06275","snapshot_observed_at":"2026-08-07T14:51:08.907532Z","title":"Spanning spheres in Dirac hypergraphs","venue":"math.CO","work_id":"77e92138-854a-4ef9-85f6-e42c557c9882","year":2024},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.735773Z"},"links":{"cited_paper":"/paper/2407.06275","citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:fbbb0902df37894113d5c8079c32a6877919200d2e93d5a9efd2b37f733f0755","observation_id":"08249f4d-5abf-4b17-a7d7-0dac1ed34c07","resolution":{"observed_at":"2026-08-07T14:51:08.953316Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:10.592778Z","title":"Janson, T","venue":null,"work_id":"8b50f1db-8c7e-4943-ac41-a990db14bc7a","year":2000},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.811167Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:3d581f1331e3f1ca4417794031a5435df1b5a475d0fc14acf1f8de605f753dd1","observation_id":"bd3e85e2-e7fb-4a5f-b412-7dd6e2109166","resolution":{"observed_at":"2026-08-07T14:51:10.638107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:10.439774Z","title":null,"venue":null,"work_id":"7c1b70eb-2c12-44be-93fb-253ba11f76dc","year":1972},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:07.920415Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:f4c5d14333551056c1a7a9854f6d3264948aad62a4dcd150a01d5b33225ac897","observation_id":"5faa8645-7e37-4acc-86ed-ef3a19977cf4","resolution":{"observed_at":"2026-08-07T14:51:10.520753Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:10.241604Z","title":"K¨ uhn and D","venue":null,"work_id":"12674e97-6ef0-46ef-833b-f3888ed2f9ce","year":2006},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.000870Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:b5a718bbb5a1cfffd3be9229e356fdc962f6802b2d21619ce3eb6a46cfb35ef3","observation_id":"91d92499-6354-4dcb-b820-20428b94100d","resolution":{"observed_at":"2026-08-07T14:51:10.320237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:10.052874Z","title":"K¨ uhn and D","venue":null,"work_id":"b03c2d1f-79c6-48cd-bf2b-9294535c7c3a","year":2009},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.110652Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:49b21081393c53ef87617e7f48c034e5b7a0e67732a174d72b02a74258181719","observation_id":"6df56705-00c7-464f-a157-741cd6356878","resolution":{"observed_at":"2026-08-07T14:51:10.138144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.11400","last_updated":"2025-05-16T16:05:38Z","snapshot_observed_at":"2026-08-15T20:51:25.172255Z","submitted_at":"2025-05-16T16:05:38Z","title":"Positive codegree thresholds for Hamilton cycles in hypergraphs","version":1},"cited_work":{"arxiv_id":"2505.11400","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.11400","snapshot_observed_at":"2026-08-07T14:51:08.703724Z","title":"Positive codegree thresholds for Hamilton cycles in hypergraphs","venue":"math.CO","work_id":"8337c74d-f092-45cc-9696-92d983d16d0c","year":2025},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.199680Z"},"links":{"cited_paper":"/paper/2505.11400","citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:4bc36152da0a93998914c540ac9c85bd8cedb35f5f09908df0fff77f356f50d3","observation_id":"3b317543-4fc5-4978-a903-ad2951d10c1a","resolution":{"observed_at":"2026-08-07T14:51:08.782495Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:09.882079Z","title":"Pippenger and J","venue":null,"work_id":"e1258e29-c6d2-4e41-bac8-e9bdef096378","year":1989},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.266744Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:eb2148fc44279bc1df6d1042d47d0a65760ca90cfa489104b1141a96bddd10f9","observation_id":"bd6e1566-1b83-4cc3-83d7-5cfacaaf32c0","resolution":{"observed_at":"2026-08-07T14:51:09.949395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:09.702337Z","title":"R¨ odl and A","venue":null,"work_id":"73779686-5ece-4c39-827d-c2c85f170803","year":2010},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.331435Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:b0395cf9ab01e11683880c64c8037996d77d189aab49e11758293f720e75776d","observation_id":"56c1835e-5ee4-4e2d-9ab8-6d1f99004ec2","resolution":{"observed_at":"2026-08-07T14:51:09.790073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:09.519392Z","title":"R¨ odl, A","venue":null,"work_id":"a6d9ee7f-fae8-48a3-8f2a-8161e20a1f75","year":2009},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.396454Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:a4671b284ddeb7e44665d918530820a6147fa4f5a91b45cb5ea7b173f4616301","observation_id":"a83e6f20-3248-41b6-a0ed-14d955c1b677","resolution":{"observed_at":"2026-08-07T14:51:09.598798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:09.350314Z","title":null,"venue":null,"work_id":"075c26a3-16f0-4805-a786-fdb286ea7338","year":1947},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.520194Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:9765ee00f60a2b352313bc3ae9a83595164ce8c52fa69407638a109c70f8491b","observation_id":"efa4d5a1-028a-4048-ba11-d675005ac938","resolution":{"observed_at":"2026-08-07T14:51:09.427880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07T14:51:09.201882Z","title":null,"venue":null,"work_id":"3ee268c6-a7e2-400c-82ce-65be18c1ce6c","year":2016},"citing_paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:51:08.588225Z"},"links":{"citing_paper":"/paper/2505.17981"},"observation_digest":"sha256:f084965a3881f1cb8874259067bbdf2fe8c3965301d16d1c4aea4999061b0f85","observation_id":"30035861-dbe3-4a01-a4c2-827f49970ad9","resolution":{"observed_at":"2026-08-07T14:51:09.268921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.17981","last_updated":"2025-05-23T14:47:33Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-08T01:07:22.635059Z","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":3,"verified_fuzzy":7},"total_outbound_references":17},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2505.17981."}