{"as_of":"2026-08-21T01:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91f58f6a9b62d675b5b7b09aeb079e03e70eec1ca2e30889f20874be8e06877b","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T21:46:33.461799Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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-06-28T13:52:37.452784Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"cited_work":{"arxiv_id":"2502.04783","doi":"10.48550/arxiv.2502.04783","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04783","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Chen and A","venue":"ArXiv.org","work_id":"2f9633da-7a90-4f23-9226-bb38a91f5809","year":2025},"citing_paper":{"arxiv_id":"2606.02389","last_updated":"2026-06-01T15:37:05Z","snapshot_observed_at":"2026-08-15T00:56:10.232787Z","submitted_at":"2026-06-01T15:37:05Z","title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T13:52:37.452784Z"},"links":{"cited_paper":"/paper/2502.04783","citing_paper":"/paper/2606.02389"},"observation_digest":"sha256:8ff9c136e33f46137c5da6a9a726705a00ba0fdc8ceecb9f5a70fb19620f3087","observation_id":"4aa9c88d-2a13-4646-a4d9-67d3de53299c","resolution":{"observed_at":"2026-06-28T14:32:18.450446Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04783/citation-record","integrity":"/paper/2502.04783/integrity","json":"/paper/2502.04783/citation-record.json","paper":"/paper/2502.04783"},"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-08T21:46:33.911433Z","title":"B¨ ottcher, J","venue":null,"work_id":"448a780c-d07c-47e9-b728-fddf41912142","year":2019},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.336495Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:fcfafa2fe7ed994231901f8af3f81fc0c32eb22b9db8b45b7bdf924d46fadd1e","observation_id":"08c6be7b-ce10-46b9-be7e-56c9b2e11f9a","resolution":{"observed_at":"2026-08-08T21:46:33.915677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.897731Z","title":"B¨ ottcher, R","venue":null,"work_id":"33f77207-ace2-4e14-a1b8-63b86a54cd78","year":2020},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.341377Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:b9f62006aa05fa1e7986b8a6ffacd6e0d11e70c411be4781bb7360783b7dc647","observation_id":"7b4b3547-a41c-44c9-b2b4-0088c21b8ae9","resolution":{"observed_at":"2026-08-08T21:46:33.902363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.884531Z","title":null,"venue":null,"work_id":"e9aff90c-279b-4638-9b9c-22868a260ee5","year":1991},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.345541Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:04577bff96f31aeda6773de705b43d755916d0be8b49e59d8654fbf54a68a0f3","observation_id":"049541ce-8963-4d3e-a61e-8b2acd4c7e89","resolution":{"observed_at":"2026-08-08T21:46:33.888766Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.871602Z","title":"Csaba, I","venue":null,"work_id":"6b10a99d-85f7-4bcc-b1c8-63461c9f4f74","year":2010},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.349848Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:7b54f1c3bd6a052cf4312c0ac65a3b7f477dda6f56d0958b8322f4fe80d19cb9","observation_id":"43540fbb-b10d-4f78-a3d3-a2ecdd5b0982","resolution":{"observed_at":"2026-08-08T21:46:33.875663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.858398Z","title":"Erd˝ os and T","venue":null,"work_id":"4de0ca38-8ffb-471d-aa56-e35e748553ee","year":1961},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.354373Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:49d973d4999fe65600e79fd7d7f4239e1db5dd82ef5e1cd852f49fad8ac0385d","observation_id":"1c8380d8-2e02-48f2-a575-5954117e4600","resolution":{"observed_at":"2026-08-08T21:46:33.862531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.845077Z","title":"Frankl and Z","venue":null,"work_id":"51e4be9d-a846-4cad-b8f0-cbe024e27989","year":1987},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.358717Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:3cfaa43ee6fd9f7a1c3b5ce68fcae454928eb2badddb09bc01d7c4346e8c8448","observation_id":"f14101ba-bb0e-4377-a73a-3617766a2146","resolution":{"observed_at":"2026-08-08T21:46:33.849369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.832103Z","title":"Frankl and V","venue":null,"work_id":"b6efd241-cf9d-4da7-b1c8-207e32a82e8d","year":1992},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.363268Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:c26aae456f3b9edc41e5ab75574d233ca3c675ee76f8bb6b0a5cb43e585fe2da","observation_id":"d46a2c7d-b396-458e-9ab4-198caf831d22","resolution":{"observed_at":"2026-08-08T21:46:33.836180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.819103Z","title":"Georgakopoulos, J","venue":null,"work_id":"167c09b5-eb08-4be3-91c5-dfabe9a60abf","year":2022},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.367549Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:0b0cefba183f1226b817389512edc77490563b16168771394cc3536a32cc6d90","observation_id":"149a8927-a848-4ad3-b35e-3c82af10fc44","resolution":{"observed_at":"2026-08-08T21:46:33.823183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.805720Z","title":"H` an, Y","venue":null,"work_id":"b63016ea-c807-4c7e-b863-4515b890448e","year":2009},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.371592Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:f599f39b14543ff5317c32a4115635a8e0c44483e34949c08a230f96bb70ef33","observation_id":"2b0fbe17-b534-4bb3-b04a-ab65cd429f67","resolution":{"observed_at":"2026-08-08T21:46:33.810000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.04758","last_updated":"2023-02-18T15:22:21Z","snapshot_observed_at":"2026-08-16T16:17:33.352706Z","submitted_at":"2022-11-09T09:22:52Z","title":"Spanning trees in sparse expanders","version":2},"cited_work":{"arxiv_id":"2211.04758","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.04758","snapshot_observed_at":"2026-08-08T21:46:33.536735Z","title":"Spanning trees in sparse expanders","venue":"math.CO","work_id":"141a860f-30f3-494c-bc55-f8a05cd54f33","year":2022},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.375506Z"},"links":{"cited_paper":"/paper/2211.04758","citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:2fdf3b1f795ad33e1fa8b2c1b09825833290f6908c53c4056ba388805807e14b","observation_id":"6d9555c8-e7bc-41da-af1c-d47d3cf70d16","resolution":{"observed_at":"2026-08-08T21:46:33.541176Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.792527Z","title":null,"venue":null,"work_id":"09a6dc24-1fc8-40d5-848c-a06544b19843","year":2024},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.379722Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:e5af1ac795f524f5390020bc975026846622901bf1eb64912c8422eaf00636af","observation_id":"e1c33b77-9ef1-49de-a3aa-135ce69bf672","resolution":{"observed_at":"2026-08-08T21:46:33.796868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14269","last_updated":"2025-03-26T01:59:15Z","snapshot_observed_at":"2026-08-16T14:07:44.167166Z","submitted_at":"2024-03-21T10:10:32Z","title":"Dirac's theorem for linear hypergraphs","version":2},"cited_work":{"arxiv_id":"2403.14269","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14269","snapshot_observed_at":"2026-08-08T21:46:33.517758Z","title":"Dirac's theorem for linear hypergraphs","venue":"math.CO","work_id":"9bdea309-1d9d-4708-9051-893481efd59a","year":2024},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.383774Z"},"links":{"cited_paper":"/paper/2403.14269","citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:322f67a31b75b9c60f55421263123a2e20c2146674279df9217bd49bcaba3824","observation_id":"617daa69-3411-48ef-b39b-f50dec581629","resolution":{"observed_at":"2026-08-08T21:46:33.522470Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.779781Z","title":"Kalai, Enumeration of Q-acyclic simplicial complexes , Israel J","venue":null,"work_id":"8afa05e4-f62d-42b2-9055-66504361506e","year":1983},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.388255Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:483ca44c61b4ed68b061e7a99a2538d836408ec39ae32b2f331defb06d1f5f50","observation_id":"1fbc67fe-34a8-4e85-8031-a5dc01006063","resolution":{"observed_at":"2026-08-08T21:46:33.783818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.766623Z","title":"Karamata, Sur une in´ egalit´ e relative aux fonctions convexes, Publications de l’Institut mathematique 1 (1932), no","venue":null,"work_id":"646c34a0-0108-4cec-be3e-324e809aad25","year":1932},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.392392Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:fef226c043eed34a2f3db8ec61be1990882e6a54526f2fba1e38cbe4611450e6","observation_id":"55c9fde0-39cb-4f8b-88e8-22b15091169e","resolution":{"observed_at":"2026-08-08T21:46:33.770928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.753023Z","title":"Kathapurkar and R","venue":null,"work_id":"23cd03fb-e5b4-4fe0-a3c3-fd7080982792","year":2022},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.396448Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:a0a5e028b19c0bdbe870a71e4f7044c241c0d73057185f20cd41d32bcd26dd2c","observation_id":"9f3bed70-e883-49b4-ba0d-d58d18c2e37e","resolution":{"observed_at":"2026-08-08T21:46:33.757256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.739923Z","title":"Keevash, D","venue":null,"work_id":"389a9752-4cab-402c-9829-826fb1dcd63b","year":2011},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.400525Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:6749348bdfef9757abfacef86ff0cb88d79e5a6fda1bbc4de80dc162203d090f","observation_id":"008f777d-f2d3-4aa9-9aab-a728adb21795","resolution":{"observed_at":"2026-08-08T21:46:33.744150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.726452Z","title":"Koml´ os, G.N","venue":null,"work_id":"163b09c6-9bf6-460d-8b60-159cc5ffea21","year":1995},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.404451Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:10cfb38e72fd43140fcc1c925b38a3b59f73bd17b068a46e0b15db0c132b6cf9","observation_id":"86a2dd66-90de-45a4-bfdc-fc04eaa3222e","resolution":{"observed_at":"2026-08-08T21:46:33.730689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.713055Z","title":"Koml´ os, G.N","venue":null,"work_id":"dd108129-d17d-4a79-bbcf-329d95f536ed","year":2001},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.408414Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:b4d9d18392a563f84dc12f960833879ea27fc8071ad2a0602e6d3cf263d1d309","observation_id":"35d6d5a1-e582-44ff-b9bb-3f23f34d1bcf","resolution":{"observed_at":"2026-08-08T21:46:33.717144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.699794Z","title":"Krivelevich, Embedding spanning trees in random graphs , SIAM J","venue":null,"work_id":"8b58fbc4-5008-4bcd-8fb4-2dd2421b92cd","year":2010},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.412427Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:e4d77b1959e3cf390d4d3debeda2ed38639a66b3db8e7a02796fe9ccac87ad15","observation_id":"75122862-4a80-4709-b152-62210027c0fa","resolution":{"observed_at":"2026-08-08T21:46:33.704115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.686426Z","title":"Krivelevich, M","venue":null,"work_id":"e6f3a980-c08d-4ece-974c-2821eb5521cb","year":2017},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.416379Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:55b48b3fbe152f20bf81e1ad7faa82ee32fec7466e1b58e78ea714256ad2dcf7","observation_id":"577c36d6-6d36-4a03-a580-e84d5c3bb57d","resolution":{"observed_at":"2026-08-08T21:46:33.691192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.673377Z","title":"Lang and N","venue":null,"work_id":"e6b211ab-d18a-41c3-ae41-166c85da196c","year":2022},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.420679Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:acf5b792a4494f3ec8a828f7dc367c14a20f360b9942524c7874971a072864c1","observation_id":"92a89f04-706d-4024-8cf8-fd74b6db6f0e","resolution":{"observed_at":"2026-08-08T21:46:33.677318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09201","last_updated":"2026-05-19T15:52:03Z","snapshot_observed_at":"2026-08-18T18:50:01.251405Z","submitted_at":"2020-12-16T19:01:11Z","title":"Trees and treelike structures in dense digraphs","version":2},"cited_work":{"arxiv_id":"2012.09201","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.09201","snapshot_observed_at":"2026-08-08T21:46:33.495662Z","title":"Trees and treelike structures in dense digraphs","venue":"math.CO","work_id":"08348abb-2866-4fa8-9536-f419cf22f1ce","year":2020},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.424733Z"},"links":{"cited_paper":"/paper/2012.09201","citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:ecc271b3f96332c71a2e7591a577f3e339d5f55e7c5771e911c49095ea4a678f","observation_id":"b0a720e8-75d4-4ee7-8480-47072f4f82d0","resolution":{"observed_at":"2026-08-08T21:46:33.502358Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.660597Z","title":"Pavez-Sign´ e, N","venue":null,"work_id":"5def2987-7aa9-4e35-b588-58138aad20e9","year":2024},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.429100Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:eb4ca7c7e6b19f0b31695a233fdf5f4673fe67bcba603dd6274e58513a6de4bc","observation_id":"0ce5aadf-d210-407f-b7f3-70501910c040","resolution":{"observed_at":"2026-08-08T21:46:33.664675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.647177Z","title":"Pehova and K","venue":null,"work_id":"d09cf3c9-54f7-43a4-a023-f0ff62ad4c7a","year":2024},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.433255Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:a82164973c1923a7d9db8b857992840965520d9cd37c3d11dc68f1c08dfd591b","observation_id":"34ff691c-8389-4c6a-acb4-47ed10f5d013","resolution":{"observed_at":"2026-08-08T21:46:33.651325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.633578Z","title":"Pikhurko, Perfect matchings and K3 4 -tilings in hypergraphs of large codegree , Graphs Combin","venue":null,"work_id":"a7593c77-8da6-43a7-8f99-2f50175e7ba1","year":2008},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.437290Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:a178af3ba61608e8f2fd04fa564e003bd5dc6659c6f10ed93cd65f718572a3a3","observation_id":"fce173f1-f4c8-4a62-b513-6a44692979f1","resolution":{"observed_at":"2026-08-08T21:46:33.638071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.620004Z","title":"Polcyn, C","venue":null,"work_id":"7fa28f20-70e9-4fb1-8805-ba7d2800b98c","year":2021},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.441373Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:62ce7dc119ee0fe698443166f9a7f442d8353a55b9c30698e3eb56d97319ebe4","observation_id":"0b902a4b-95cd-4e1a-a4be-74ee78b32335","resolution":{"observed_at":"2026-08-08T21:46:33.624451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.605628Z","title":"Reiher, V","venue":null,"work_id":"82911c4b-08c9-4340-9ae8-ebe8cf551cf8","year":2019},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.445299Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:62b69d11ed3c7898c475d2c97bd60843dd4e6292ad3058955a8b6cede22bbb90","observation_id":"dc9bf8a1-15f0-4de4-b9ec-1198058d2d73","resolution":{"observed_at":"2026-08-08T21:46:33.609823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.591676Z","title":"R¨ odl, A","venue":null,"work_id":"ef80da39-c377-4f15-b7fc-eff43c73f2f8","year":2008},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.449405Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:83f88d8a50ffdae72f21ab14fc100082b13de486c5a0f4594581df064456723d","observation_id":"9fbd05a6-1910-42ef-bcb5-a8bc3ced77e3","resolution":{"observed_at":"2026-08-08T21:46:33.596448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.577504Z","title":null,"venue":null,"work_id":"7ae91652-9ab7-4f92-8688-b52930a01369","year":2009},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.453453Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:a4f6e3519c4231f60078daeb15f4724375d9342a9187709d9fb5593c2af0661f","observation_id":"3a24918c-d9e2-492d-abbd-038b7d2fbd0a","resolution":{"observed_at":"2026-08-08T21:46:33.581790Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.564281Z","title":"Stein, Tree containment and degree conditions , Springer Optim","venue":null,"work_id":"1b4365c7-8d1e-4763-808e-37ab468c7bdc","year":null},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.457573Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:c4f2f1a46d522db11d5e7dbff78ab866ff4c7438bb504519359c27432235b50c","observation_id":"989a52f9-e837-4d11-ac96-1d535f42d955","resolution":{"observed_at":"2026-08-08T21:46:33.568614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-08T21:46:33.550821Z","title":"Zhao, Recent advances on Dirac-type problems for hypergraphs , Recent trends in combinatorics, IMA Vol","venue":null,"work_id":"e25358ec-e0ee-447b-9897-9ecc4d3642e5","year":2016},"citing_paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T21:46:33.461799Z"},"links":{"citing_paper":"/paper/2502.04783"},"observation_digest":"sha256:b8f20bf97d90e961b8652e75c07890287b035759ab979b28993e63613ecb1a18","observation_id":"8b10c8b1-e22d-4b77-814c-8cd1a51460fb","resolution":{"observed_at":"2026-08-08T21:46:33.555108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04783","last_updated":"2025-02-07T09:36:20Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-17T12:55:41.473534Z","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":3,"verified_fuzzy":25},"total_outbound_references":31},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 1 inbound Pith citation observation for arXiv:2502.04783."}