{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C4SHEN4WI6637XTIKM3P5LXPMO","short_pith_number":"pith:C4SHEN4W","schema_version":"1.0","canonical_sha256":"172472379647bdbfde685336feaeef63941b9230166d09272d691522d53f8f3d","source":{"kind":"arxiv","id":"1211.3050","version":3},"attestation_state":"computed","paper":{"title":"The approximate Loebl-Koml\\'os-S\\'os Conjecture","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 Stein, Mikl\\'os Simonovits","submitted_at":"2012-11-13T17:01:14Z","abstract_excerpt":"We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+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 common to approaches which employ the Szemeredi 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. However, the decomposition given by the Regularity Lemma is not of"},"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":"1211.3050","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T17:01:14Z","cross_cats_sorted":[],"title_canon_sha256":"d316a0637dfef5c9432fa5a289ac0c8c89b72bacc75ed55263896b8f8582ddf6","abstract_canon_sha256":"6aa4aae6c63f1fa6151f4c0a8470ca9e903806c8f5f6bb014b8d5902fa98cb44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:58.452362Z","signature_b64":"PTcgZB3SimetBA8jeVb9zKlW4wNcVei21oakCx+6Rdhxi0/17ArWeVO6BHMAUffaHsZwBHT0COjWpK6sqT+HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172472379647bdbfde685336feaeef63941b9230166d09272d691522d53f8f3d","last_reissued_at":"2026-05-18T01:36:58.451803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:58.451803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The approximate Loebl-Koml\\'os-S\\'os Conjecture","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 Stein, Mikl\\'os Simonovits","submitted_at":"2012-11-13T17:01:14Z","abstract_excerpt":"We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+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 common to approaches which employ the Szemeredi 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. However, the decomposition given by the Regularity Lemma is not of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3050","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":"1211.3050","created_at":"2026-05-18T01:36:58.451872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3050v3","created_at":"2026-05-18T01:36:58.451872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3050","created_at":"2026-05-18T01:36:58.451872+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4SHEN4WI663","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4SHEN4WI6637XTI","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4SHEN4W","created_at":"2026-05-18T12:27:01.376967+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/C4SHEN4WI6637XTIKM3P5LXPMO","json":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO.json","graph_json":"https://pith.science/api/pith-number/C4SHEN4WI6637XTIKM3P5LXPMO/graph.json","events_json":"https://pith.science/api/pith-number/C4SHEN4WI6637XTIKM3P5LXPMO/events.json","paper":"https://pith.science/paper/C4SHEN4W"},"agent_actions":{"view_html":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO","download_json":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO.json","view_paper":"https://pith.science/paper/C4SHEN4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3050&json=true","fetch_graph":"https://pith.science/api/pith-number/C4SHEN4WI6637XTIKM3P5LXPMO/graph.json","fetch_events":"https://pith.science/api/pith-number/C4SHEN4WI6637XTIKM3P5LXPMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/action/storage_attestation","attest_author":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/action/author_attestation","sign_citation":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/action/citation_signature","submit_replication":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/action/replication_record"}},"created_at":"2026-05-18T01:36:58.451872+00:00","updated_at":"2026-05-18T01:36:58.451872+00:00"}