{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QKJ2BTIGRGGQZCGXSM55ILHIOM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d977cc39488f8fa5b429fd808682c649b472a6dc6a478f9a249a5c54d8d596f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T09:36:20Z","title_canon_sha256":"63cd7c0a4d511f8c0e9c567d2d395b7c06b457d1fe88d1d5b27b495ef94d42e8"},"schema_version":"1.0","source":{"id":"2502.04783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04783","created_at":"2026-07-05T10:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04783v1","created_at":"2026-07-05T10:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04783","created_at":"2026-07-05T10:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"QKJ2BTIGRGGQ","created_at":"2026-07-05T10:10:57Z"},{"alias_kind":"pith_short_16","alias_value":"QKJ2BTIGRGGQZCGX","created_at":"2026-07-05T10:10:57Z"},{"alias_kind":"pith_short_8","alias_value":"QKJ2BTIG","created_at":"2026-07-05T10:10:57Z"}],"graph_snapshots":[{"event_id":"sha256:f590341876601f218f77454253928107c57b41c05a18b47dce9acdc8a775cee9","target":"graph","created_at":"2026-07-05T10:10:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.04783/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Allan Lo, Yaobin Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T09:36:20Z","title":"Embedding loose trees in $k$-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04783","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1d750e6add5a0264aa7c0279dcf307810a6cab89db9d61cefe90d2e996df84d8","target":"record","created_at":"2026-07-05T10:10:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d977cc39488f8fa5b429fd808682c649b472a6dc6a478f9a249a5c54d8d596f9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-07T09:36:20Z","title_canon_sha256":"63cd7c0a4d511f8c0e9c567d2d395b7c06b457d1fe88d1d5b27b495ef94d42e8"},"schema_version":"1.0","source":{"id":"2502.04783","kind":"arxiv","version":1}},"canonical_sha256":"8293a0cd06898d0c88d7933bd42ce8730d78387efa3b1ab297959bf3d20c6213","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8293a0cd06898d0c88d7933bd42ce8730d78387efa3b1ab297959bf3d20c6213","first_computed_at":"2026-07-05T10:10:57.110929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:57.110929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OeUkQBAZDcZpGcKmMjBJSjRFTxR2uVX7kUgKYZBE2bQdRq/RWlqTVrFxHGqurTBWO67aC2eSS3XzNfXVf1cpAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:57.111494Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.04783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d750e6add5a0264aa7c0279dcf307810a6cab89db9d61cefe90d2e996df84d8","sha256:f590341876601f218f77454253928107c57b41c05a18b47dce9acdc8a775cee9"],"state_sha256":"158756a204ea21f8f41ff3220771eaccd618d56c21ebdc7b97c0de2ef1eca85f"}