{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SZRPUWTWHM2W62IKCBBV3AGQRK","short_pith_number":"pith:SZRPUWTW","canonical_record":{"source":{"id":"1408.3866","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"dad2f7d2f83a3d6e0bdc8a02ab89ca782e7f6e631d1c40bdb900cd87a7b425ef","abstract_canon_sha256":"2e689fed6054e8238d8ba7a69933baeddd847e9cc7bb08e3b63a1de7ad9636d9"},"schema_version":"1.0"},"canonical_sha256":"9662fa5a763b356f690a10435d80d08a8ce330975d096788de6ab1778e8de953","source":{"kind":"arxiv","id":"1408.3866","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3866","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3866v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3866","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"SZRPUWTWHM2W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SZRPUWTWHM2W62IK","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SZRPUWTW","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SZRPUWTWHM2W62IKCBBV3AGQRK","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3866","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"dad2f7d2f83a3d6e0bdc8a02ab89ca782e7f6e631d1c40bdb900cd87a7b425ef","abstract_canon_sha256":"2e689fed6054e8238d8ba7a69933baeddd847e9cc7bb08e3b63a1de7ad9636d9"},"schema_version":"1.0"},"canonical_sha256":"9662fa5a763b356f690a10435d80d08a8ce330975d096788de6ab1778e8de953","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.638500Z","signature_b64":"MaT2Fh6lnoOnPqCQVdcOLqh4Lto1osbXkL75r8leouCPYSd6o5fuw/5Ti3hZWB26xdt+iaMNPZpWaPke+sMNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9662fa5a763b356f690a10435d80d08a8ce330975d096788de6ab1778e8de953","last_reissued_at":"2026-05-18T00:39:18.637830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.637830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3866","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4jgT3yEHZvxxjjDFwEmNcQGaEM23wZ5+R/hORv38JrF8cjqTnFGx56AZx7DP7+Orlv7B0dyKOcRCvltZJpACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:34:30.562423Z"},"content_sha256":"d6e371ab2c1ec0312cbc45a511721b938d2f7e1f3c4d3cfdd9ba005f0fea4ed4","schema_version":"1.0","event_id":"sha256:d6e371ab2c1ec0312cbc45a511721b938d2f7e1f3c4d3cfdd9ba005f0fea4ed4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SZRPUWTWHM2W62IKCBBV3AGQRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Approximate Loebl-Koml\\'os-S\\'os Conjecture III: The finer structure of LKS graphs","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-17T21:51:46Z","abstract_excerpt":"This is the third 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 paper of the series, we gave a decomposition of the graph $G$ into several parts of different characteristics. In the second paper, we found a combinatorial structure inside the decomposition. In this paper, we will give a refinem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3866","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xfWi4cMTKrhpbEUwgRTLp1rdiRIOSv2dZy2rcYZAxfJNS9NOuMFTDiFu027qHYMha3VZkNSatjDd0EQiH7nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:34:30.562772Z"},"content_sha256":"719e4bd539357d5eaf92a967eeea3c7c35197cc468b11aaa9c8ec03c1fbefd36","schema_version":"1.0","event_id":"sha256:719e4bd539357d5eaf92a967eeea3c7c35197cc468b11aaa9c8ec03c1fbefd36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZRPUWTWHM2W62IKCBBV3AGQRK/bundle.json","state_url":"https://pith.science/pith/SZRPUWTWHM2W62IKCBBV3AGQRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZRPUWTWHM2W62IKCBBV3AGQRK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T09:34:30Z","links":{"resolver":"https://pith.science/pith/SZRPUWTWHM2W62IKCBBV3AGQRK","bundle":"https://pith.science/pith/SZRPUWTWHM2W62IKCBBV3AGQRK/bundle.json","state":"https://pith.science/pith/SZRPUWTWHM2W62IKCBBV3AGQRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZRPUWTWHM2W62IKCBBV3AGQRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SZRPUWTWHM2W62IKCBBV3AGQRK","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":"2e689fed6054e8238d8ba7a69933baeddd847e9cc7bb08e3b63a1de7ad9636d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:51:46Z","title_canon_sha256":"dad2f7d2f83a3d6e0bdc8a02ab89ca782e7f6e631d1c40bdb900cd87a7b425ef"},"schema_version":"1.0","source":{"id":"1408.3866","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3866","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3866v3","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3866","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"SZRPUWTWHM2W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SZRPUWTWHM2W62IK","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SZRPUWTW","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:719e4bd539357d5eaf92a967eeea3c7c35197cc468b11aaa9c8ec03c1fbefd36","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":"This is the third 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 paper of the series, we gave a decomposition of the graph $G$ into several parts of different characteristics. In the second paper, we found a combinatorial structure inside the decomposition. In this paper, we will give a refinem","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:51:46Z","title":"The Approximate Loebl-Koml\\'os-S\\'os Conjecture III: The finer structure of LKS graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3866","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:d6e371ab2c1ec0312cbc45a511721b938d2f7e1f3c4d3cfdd9ba005f0fea4ed4","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":"2e689fed6054e8238d8ba7a69933baeddd847e9cc7bb08e3b63a1de7ad9636d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-17T21:51:46Z","title_canon_sha256":"dad2f7d2f83a3d6e0bdc8a02ab89ca782e7f6e631d1c40bdb900cd87a7b425ef"},"schema_version":"1.0","source":{"id":"1408.3866","kind":"arxiv","version":3}},"canonical_sha256":"9662fa5a763b356f690a10435d80d08a8ce330975d096788de6ab1778e8de953","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9662fa5a763b356f690a10435d80d08a8ce330975d096788de6ab1778e8de953","first_computed_at":"2026-05-18T00:39:18.637830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.637830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MaT2Fh6lnoOnPqCQVdcOLqh4Lto1osbXkL75r8leouCPYSd6o5fuw/5Ti3hZWB26xdt+iaMNPZpWaPke+sMNDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.638500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3866","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6e371ab2c1ec0312cbc45a511721b938d2f7e1f3c4d3cfdd9ba005f0fea4ed4","sha256:719e4bd539357d5eaf92a967eeea3c7c35197cc468b11aaa9c8ec03c1fbefd36"],"state_sha256":"232219157888fddc400cb494a883296f392b24b6375546fccfe08d8a635127f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjEv6yk+bUX3+O9u2CH9/117287+hdC/FC18d2IHYdHEDlLSYxTjvlgWK9foPovTsEPtW1YSzBPUvU7gqoYeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:34:30.564687Z","bundle_sha256":"5fe5de688534d6a63f497af02419b36daff537e4a1acf7aa43e4792ab53e6970"}}