Paper Citation Record · LEDGER

Embedding loose trees in $k$-uniform hypergraphs

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.04783 v1

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T21:46:33.461799Z

measured 32 of 32 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-28T13:52:37.452784Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

31 of 31 outbound references displayed

verified exact3
verified fuzzy25
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

Observation 08c6be7b-ce10-46b9-be7e-56c9b2e11f9a · outbound

This paper cites B¨ ottcher, J.

Embedding loose trees in $k$-uniform hypergraphs B¨ ottcher, J

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.915677Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7b4b3547-a41c-44c9-b2b4-0088c21b8ae9 · outbound

This paper cites B¨ ottcher, R.

Embedding loose trees in $k$-uniform hypergraphs B¨ ottcher, R

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.902363Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 049541ce-8963-4d3e-a61e-8b2acd4c7e89 · outbound

This paper cites an unresolved cited work.

Embedding loose trees in $k$-uniform hypergraphs Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-08T21:46:33.888766Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 43540fbb-b10d-4f78-a3d3-a2ecdd5b0982 · outbound

This paper cites Csaba, I.

Embedding loose trees in $k$-uniform hypergraphs Csaba, I

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.875663Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1c8380d8-2e02-48f2-a575-5954117e4600 · outbound

This paper cites Erd˝ os and T.

Embedding loose trees in $k$-uniform hypergraphs Erd˝ os and T

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.862531Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f14101ba-bb0e-4377-a73a-3617766a2146 · outbound

This paper cites Frankl and Z.

Embedding loose trees in $k$-uniform hypergraphs Frankl and Z

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.849369Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d46a2c7d-b396-458e-9ab4-198caf831d22 · outbound

This paper cites Frankl and V.

Embedding loose trees in $k$-uniform hypergraphs Frankl and V

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.836180Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 149a8927-a848-4ad3-b35e-3c82af10fc44 · outbound

This paper cites Georgakopoulos, J.

Embedding loose trees in $k$-uniform hypergraphs Georgakopoulos, J

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.823183Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 2b0fbe17-b534-4bb3-b04a-ab65cd429f67 · outbound

This paper cites H` an, Y.

Embedding loose trees in $k$-uniform hypergraphs H` an, Y

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.810000Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 6d9555c8-e7bc-41da-af1c-d47d3cf70d16 · outbound

This paper cites Spanning trees in sparse expanders.

Embedding loose trees in $k$-uniform hypergraphs Spanning trees in sparse expanders

Reference 10

Resolution: verified exact; local_arxiv, observed 2026-08-08T21:46:33.541176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e1c33b77-9ef1-49de-a3aa-135ce69bf672 · outbound

This paper cites an unresolved cited work.

Embedding loose trees in $k$-uniform hypergraphs Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-08T21:46:33.796868Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 617daa69-3411-48ef-b39b-f50dec581629 · outbound

This paper cites Dirac's theorem for linear hypergraphs.

Embedding loose trees in $k$-uniform hypergraphs Dirac's theorem for linear hypergraphs

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-08T21:46:33.522470Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1fbc67fe-34a8-4e85-8031-a5dc01006063 · outbound

This paper cites Kalai, Enumeration of Q-acyclic simplicial complexes , Israel J.

Embedding loose trees in $k$-uniform hypergraphs Kalai, Enumeration of Q-acyclic simplicial complexes , Israel J

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.783818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 55c9fde0-39cb-4f8b-88e8-22b15091169e · outbound

This paper cites Karamata, Sur une in´ egalit´ e relative aux fonctions convexes, Publications de l’Institut mathematique 1 (1932), no.

Embedding loose trees in $k$-uniform hypergraphs Karamata, Sur une in´ egalit´ e relative aux fonctions convexes, Publications de l’Institut mathematique 1 (1932), no

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.770928Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9f3bed70-e883-49b4-ba0d-d58d18c2e37e · outbound

This paper cites Kathapurkar and R.

Embedding loose trees in $k$-uniform hypergraphs Kathapurkar and R

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.757256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 008f777d-f2d3-4aa9-9aab-a728adb21795 · outbound

This paper cites Keevash, D.

Embedding loose trees in $k$-uniform hypergraphs Keevash, D

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.744150Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 86a2dd66-90de-45a4-bfdc-fc04eaa3222e · outbound

This paper cites Koml´ os, G.N.

Embedding loose trees in $k$-uniform hypergraphs Koml´ os, G.N

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.730689Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 35d6d5a1-e582-44ff-b9bb-3f23f34d1bcf · outbound

This paper cites Koml´ os, G.N.

Embedding loose trees in $k$-uniform hypergraphs Koml´ os, G.N

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.717144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 75122862-4a80-4709-b152-62210027c0fa · outbound

This paper cites Krivelevich, Embedding spanning trees in random graphs , SIAM J.

Embedding loose trees in $k$-uniform hypergraphs Krivelevich, Embedding spanning trees in random graphs , SIAM J

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.704115Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 577c36d6-6d36-4a03-a580-e84d5c3bb57d · outbound

This paper cites Krivelevich, M.

Embedding loose trees in $k$-uniform hypergraphs Krivelevich, M

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.691192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 92a89f04-706d-4024-8cf8-fd74b6db6f0e · outbound

This paper cites Lang and N.

Embedding loose trees in $k$-uniform hypergraphs Lang and N

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.677318Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b0a720e8-75d4-4ee7-8480-47072f4f82d0 · outbound

This paper cites Trees and treelike structures in dense digraphs.

Embedding loose trees in $k$-uniform hypergraphs Trees and treelike structures in dense digraphs

Reference 22

Resolution: verified exact; local_arxiv, observed 2026-08-08T21:46:33.502358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 0ce5aadf-d210-407f-b7f3-70501910c040 · outbound

This paper cites Pavez-Sign´ e, N.

Embedding loose trees in $k$-uniform hypergraphs Pavez-Sign´ e, N

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.664675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 34ff691c-8389-4c6a-acb4-47ed10f5d013 · outbound

This paper cites Pehova and K.

Embedding loose trees in $k$-uniform hypergraphs Pehova and K

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.651325Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation fce173f1-f4c8-4a62-b513-6a44692979f1 · outbound

This paper cites Pikhurko, Perfect matchings and K3 4 -tilings in hypergraphs of large codegree , Graphs Combin.

Embedding loose trees in $k$-uniform hypergraphs Pikhurko, Perfect matchings and K3 4 -tilings in hypergraphs of large codegree , Graphs Combin

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.638071Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 0b902a4b-95cd-4e1a-a4be-74ee78b32335 · outbound

This paper cites Polcyn, C.

Embedding loose trees in $k$-uniform hypergraphs Polcyn, C

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.624451Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation dc9bf8a1-15f0-4de4-b9ec-1198058d2d73 · outbound

This paper cites Reiher, V.

Embedding loose trees in $k$-uniform hypergraphs Reiher, V

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.609823Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9fbd05a6-1910-42ef-bcb5-a8bc3ced77e3 · outbound

This paper cites R¨ odl, A.

Embedding loose trees in $k$-uniform hypergraphs R¨ odl, A

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.596448Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 3a24918c-d9e2-492d-abbd-038b7d2fbd0a · outbound

This paper cites an unresolved cited work.

Embedding loose trees in $k$-uniform hypergraphs Unresolved cited work

Reference 29

Resolution: unresolved; raw_fallback, observed 2026-08-08T21:46:33.581790Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 989a52f9-e837-4d11-ac96-1d535f42d955 · outbound

This paper cites Stein, Tree containment and degree conditions , Springer Optim.

Embedding loose trees in $k$-uniform hypergraphs Stein, Tree containment and degree conditions , Springer Optim

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.568614Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 8b10c8b1-e22d-4b77-814c-8cd1a51460fb · outbound

This paper cites Zhao, Recent advances on Dirac-type problems for hypergraphs , Recent trends in combinatorics, IMA Vol.

Embedding loose trees in $k$-uniform hypergraphs Zhao, Recent advances on Dirac-type problems for hypergraphs , Recent trends in combinatorics, IMA Vol

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T21:46:33.555108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Pith citing papers

Observation 4aa9c88d-2a13-4646-a4d9-67d3de53299c · inbound

A degree version of the Burr-Erd\H{o}s conjecture on trees cites this paper.

A degree version of the Burr-Erd\H{o}s conjecture on trees Embedding loose trees in $k$-uniform hypergraphs

Reference 16

Resolution: verified exact; arxiv_id, observed 2026-06-28T14:32:18.450446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.