{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QKJ2BTIGRGGQZCGXSM55ILHIOM","short_pith_number":"pith:QKJ2BTIG","schema_version":"1.0","canonical_sha256":"8293a0cd06898d0c88d7933bd42ce8730d78387efa3b1ab297959bf3d20c6213","source":{"kind":"arxiv","id":"2502.04783","version":1},"attestation_state":"computed","paper":{"title":"Embedding loose trees in $k$-uniform hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Yaobin Chen","submitted_at":"2025-02-07T09:36:20Z","abstract_excerpt":"A classical result of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning hypertrees in $k$-uniform hypergraphs, that is, linear hypergraphs obtained by subsequently adding edges sharing a single vertex with a previous edge.\n  We give a general sufficient condition for embedding loose trees with bounded degree. In particular, we show that for all $k\\ge 4$, every $n$-vertex $k$-uniform hypergraph with $n\\ge n_0(k,\\gamma, \\Delta)$ and "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.04783","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T09:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"63cd7c0a4d511f8c0e9c567d2d395b7c06b457d1fe88d1d5b27b495ef94d42e8","abstract_canon_sha256":"d977cc39488f8fa5b429fd808682c649b472a6dc6a478f9a249a5c54d8d596f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:57.111494Z","signature_b64":"OeUkQBAZDcZpGcKmMjBJSjRFTxR2uVX7kUgKYZBE2bQdRq/RWlqTVrFxHGqurTBWO67aC2eSS3XzNfXVf1cpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8293a0cd06898d0c88d7933bd42ce8730d78387efa3b1ab297959bf3d20c6213","last_reissued_at":"2026-07-05T10:10:57.110929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:57.110929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding loose trees in $k$-uniform hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Yaobin Chen","submitted_at":"2025-02-07T09:36:20Z","abstract_excerpt":"A classical result of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi shows that every large $n$-vertex graph with minimum degree at least $(1/2+\\gamma)n$ contains all spanning trees of bounded degree. We generalised this result to loose spanning hypertrees in $k$-uniform hypergraphs, that is, linear hypergraphs obtained by subsequently adding edges sharing a single vertex with a previous edge.\n  We give a general sufficient condition for embedding loose trees with bounded degree. In particular, we show that for all $k\\ge 4$, every $n$-vertex $k$-uniform hypergraph with $n\\ge n_0(k,\\gamma, \\Delta)$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04783","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.04783/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.04783","created_at":"2026-07-05T10:10:57.110990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04783v1","created_at":"2026-07-05T10:10:57.110990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04783","created_at":"2026-07-05T10:10:57.110990+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKJ2BTIGRGGQ","created_at":"2026-07-05T10:10:57.110990+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKJ2BTIGRGGQZCGX","created_at":"2026-07-05T10:10:57.110990+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKJ2BTIG","created_at":"2026-07-05T10:10:57.110990+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02389","citing_title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM","json":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM.json","graph_json":"https://pith.science/api/pith-number/QKJ2BTIGRGGQZCGXSM55ILHIOM/graph.json","events_json":"https://pith.science/api/pith-number/QKJ2BTIGRGGQZCGXSM55ILHIOM/events.json","paper":"https://pith.science/paper/QKJ2BTIG"},"agent_actions":{"view_html":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM","download_json":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM.json","view_paper":"https://pith.science/paper/QKJ2BTIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04783&json=true","fetch_graph":"https://pith.science/api/pith-number/QKJ2BTIGRGGQZCGXSM55ILHIOM/graph.json","fetch_events":"https://pith.science/api/pith-number/QKJ2BTIGRGGQZCGXSM55ILHIOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM/action/storage_attestation","attest_author":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM/action/author_attestation","sign_citation":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM/action/citation_signature","submit_replication":"https://pith.science/pith/QKJ2BTIGRGGQZCGXSM55ILHIOM/action/replication_record"}},"created_at":"2026-07-05T10:10:57.110990+00:00","updated_at":"2026-07-05T10:10:57.110990+00:00"}