{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CFFQ7NB5YDFVNZJK6GFSTATIL6","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":"a92d91f82b6d38aa80c88b19ddcca0a6cf54d5b6f1885a17eb5912a21889772f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:02:52Z","title_canon_sha256":"f74d2c2e57c69f6a34b4fc1752c8f60e8777139dac0910042fd825d9da400871"},"schema_version":"1.0","source":{"id":"1408.3858","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3858","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3858v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3858","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"CFFQ7NB5YDFV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CFFQ7NB5YDFVNZJK","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CFFQ7NB5","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:5d0f5b111da698c593695cb841c6fa5162937d5e77725f803d0ceea61b678bdb","target":"graph","created_at":"2026-05-18T00:39:18Z","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"},"paper":{"abstract_excerpt":"In a series of four papers 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  The method to prove our result follows a strategy similar to approaches that employ the Szemer\\'edi regularity lemma: we decompose the graph $G$, find a suitable combinatorial structure inside the decomposition, and then embed the tree $T$ into $G$ using this structure.","authors_text":"Diana Piguet, Endre Szemer\\'edi, Jan Hladk\\'y, J\\'anos Koml\\'os, Maya J. Stein, Mikl\\'os Simonovits","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:02:52Z","title":"The approximate Loebl-Koml\\'os-S\\'os Conjecture I: The sparse decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3858","kind":"arxiv","version":3},"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:160d7dcefa0fb623b943889321d86424caf9d35cf08b2d1f129cf693b89c9ec0","target":"record","created_at":"2026-05-18T00:39:18Z","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":"a92d91f82b6d38aa80c88b19ddcca0a6cf54d5b6f1885a17eb5912a21889772f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:02:52Z","title_canon_sha256":"f74d2c2e57c69f6a34b4fc1752c8f60e8777139dac0910042fd825d9da400871"},"schema_version":"1.0","source":{"id":"1408.3858","kind":"arxiv","version":3}},"canonical_sha256":"114b0fb43dc0cb56e52af18b2982685fafbdde453c8f5d23768fe8d981266380","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"114b0fb43dc0cb56e52af18b2982685fafbdde453c8f5d23768fe8d981266380","first_computed_at":"2026-05-18T00:39:18.646412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.646412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iizHPVkPScKZlW/qkZX/F+LPWGPg8xVlntyfc2z2StTtSRlUZ+oIfmWlPDkIbt9K/XD5AJD7UwFSgXFDdnstDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.647035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3858","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:160d7dcefa0fb623b943889321d86424caf9d35cf08b2d1f129cf693b89c9ec0","sha256:5d0f5b111da698c593695cb841c6fa5162937d5e77725f803d0ceea61b678bdb"],"state_sha256":"71dafb74204652fb15bea882e09798855e11946997a6dc7bea283e0c10c20f9d"}