{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MJR6FIR2TPR5VZSKJOUDDOGLSB","short_pith_number":"pith:MJR6FIR2","schema_version":"1.0","canonical_sha256":"6263e2a23a9be3dae64a4ba831b8cb9061f1cf9b7d19fe33b0e09a66f018cad8","source":{"kind":"arxiv","id":"1408.3870","version":3},"attestation_state":"computed","paper":{"title":"The approximate Loebl-Koml\\'os-S\\'os Conjecture IV: Embedding techniques and the proof of the main result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diana Piguet, Endre Szemer\\'edi, Jan Hladk\\'y, J\\'anos Koml\\'os, Maya J. Stein, Mikl\\'os Simonovits","submitted_at":"2014-08-17T22:26:00Z","abstract_excerpt":"This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\\alpha>0$ there exists a number~$k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\\frac12+\\alpha)n$ vertices of degree at least $(1+\\alpha)k$ contains each tree $T$ of order $k$ as a subgraph.\n  In the first two papers of this series, we decomposed the host graph $G$, and found a suitable combinatorial structure inside the decomposition. In the third paper, we refined this structure, and proved that any graph satisfying the condi"},"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":"1408.3870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T22:26:00Z","cross_cats_sorted":[],"title_canon_sha256":"6e28f00fcf8619cc53cf2fa0dfa9bacf5471d793a5d2cccc00ae602692c5404a","abstract_canon_sha256":"dedeaa1a859ab0e83b90e37192f40a0af6ac939ea39c4b24af5440994c15b99f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.629183Z","signature_b64":"x1NTey46AZE5lACGnPf2c3B2ellRpY3iUxjgAwcDOSA2SbO9qZoGKVDHj7qBthpM4CSAYpZONT0UVPGyBUvaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6263e2a23a9be3dae64a4ba831b8cb9061f1cf9b7d19fe33b0e09a66f018cad8","last_reissued_at":"2026-05-18T00:39:18.628558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.628558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The approximate Loebl-Koml\\'os-S\\'os Conjecture IV: Embedding techniques and the proof of the main result","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diana Piguet, Endre Szemer\\'edi, Jan Hladk\\'y, J\\'anos Koml\\'os, Maya J. Stein, Mikl\\'os Simonovits","submitted_at":"2014-08-17T22:26:00Z","abstract_excerpt":"This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\\alpha>0$ there exists a number~$k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\\frac12+\\alpha)n$ vertices of degree at least $(1+\\alpha)k$ contains each tree $T$ of order $k$ as a subgraph.\n  In the first two papers of this series, we decomposed the host graph $G$, and found a suitable combinatorial structure inside the decomposition. In the third paper, we refined this structure, and proved that any graph satisfying the condi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3870","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1408.3870","created_at":"2026-05-18T00:39:18.628671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3870v3","created_at":"2026-05-18T00:39:18.628671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3870","created_at":"2026-05-18T00:39:18.628671+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJR6FIR2TPR5","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJR6FIR2TPR5VZSK","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJR6FIR2","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB","json":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB.json","graph_json":"https://pith.science/api/pith-number/MJR6FIR2TPR5VZSKJOUDDOGLSB/graph.json","events_json":"https://pith.science/api/pith-number/MJR6FIR2TPR5VZSKJOUDDOGLSB/events.json","paper":"https://pith.science/paper/MJR6FIR2"},"agent_actions":{"view_html":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB","download_json":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB.json","view_paper":"https://pith.science/paper/MJR6FIR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3870&json=true","fetch_graph":"https://pith.science/api/pith-number/MJR6FIR2TPR5VZSKJOUDDOGLSB/graph.json","fetch_events":"https://pith.science/api/pith-number/MJR6FIR2TPR5VZSKJOUDDOGLSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB/action/storage_attestation","attest_author":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB/action/author_attestation","sign_citation":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB/action/citation_signature","submit_replication":"https://pith.science/pith/MJR6FIR2TPR5VZSKJOUDDOGLSB/action/replication_record"}},"created_at":"2026-05-18T00:39:18.628671+00:00","updated_at":"2026-05-18T00:39:18.628671+00:00"}