{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C4SHEN4WI6637XTIKM3P5LXPMO","short_pith_number":"pith:C4SHEN4W","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"},"canonical_sha256":"172472379647bdbfde685336feaeef63941b9230166d09272d691522d53f8f3d","source":{"kind":"arxiv","id":"1211.3050","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3050","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3050v3","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3050","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"C4SHEN4WI663","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C4SHEN4WI6637XTI","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C4SHEN4W","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C4SHEN4WI6637XTIKM3P5LXPMO","target":"record","payload":{"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"},"canonical_sha256":"172472379647bdbfde685336feaeef63941b9230166d09272d691522d53f8f3d","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"},"source_kind":"arxiv","source_id":"1211.3050","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-18T01:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3jSPJVIq23VXSSF+jnILRvAYi4yHL/nJ6XsebBZacdDPeU9PmplZMRwD60B4wi14JiA42MZrCmpnlAG9WfrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:41:17.079616Z"},"content_sha256":"dfcbe7b8a97e36eb3ab63f43e473e8dd6b3f994b5894959b501d495afc1b8064","schema_version":"1.0","event_id":"sha256:dfcbe7b8a97e36eb3ab63f43e473e8dd6b3f994b5894959b501d495afc1b8064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C4SHEN4WI6637XTIKM3P5LXPMO","target":"graph","payload":{"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"},"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-18T01:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uobbt6eOSln1x4ReFkoYxS8yyyW8WyQWyN0PuLzPFwaBjEexDxMfb0kh+v2foPc9o0uyghu0zqgncVrCeWE8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:41:17.079962Z"},"content_sha256":"94b197f2e51cddc3cb1317189e19545f4e129942b19ec28b197535fb0e199095","schema_version":"1.0","event_id":"sha256:94b197f2e51cddc3cb1317189e19545f4e129942b19ec28b197535fb0e199095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/bundle.json","state_url":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4SHEN4WI6637XTIKM3P5LXPMO/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-01T13:41:17Z","links":{"resolver":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO","bundle":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/bundle.json","state":"https://pith.science/pith/C4SHEN4WI6637XTIKM3P5LXPMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4SHEN4WI6637XTIKM3P5LXPMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C4SHEN4WI6637XTIKM3P5LXPMO","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":"6aa4aae6c63f1fa6151f4c0a8470ca9e903806c8f5f6bb014b8d5902fa98cb44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T17:01:14Z","title_canon_sha256":"d316a0637dfef5c9432fa5a289ac0c8c89b72bacc75ed55263896b8f8582ddf6"},"schema_version":"1.0","source":{"id":"1211.3050","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3050","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3050v3","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3050","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"C4SHEN4WI663","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C4SHEN4WI6637XTI","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C4SHEN4W","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:94b197f2e51cddc3cb1317189e19545f4e129942b19ec28b197535fb0e199095","target":"graph","created_at":"2026-05-18T01:36:58Z","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":"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","authors_text":"Diana Piguet, Endre Szemer\\'edi, Jan Hladk\\'y, J\\'anos Koml\\'os, Maya Stein, Mikl\\'os Simonovits","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T17:01:14Z","title":"The approximate Loebl-Koml\\'os-S\\'os Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3050","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:dfcbe7b8a97e36eb3ab63f43e473e8dd6b3f994b5894959b501d495afc1b8064","target":"record","created_at":"2026-05-18T01:36:58Z","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":"6aa4aae6c63f1fa6151f4c0a8470ca9e903806c8f5f6bb014b8d5902fa98cb44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T17:01:14Z","title_canon_sha256":"d316a0637dfef5c9432fa5a289ac0c8c89b72bacc75ed55263896b8f8582ddf6"},"schema_version":"1.0","source":{"id":"1211.3050","kind":"arxiv","version":3}},"canonical_sha256":"172472379647bdbfde685336feaeef63941b9230166d09272d691522d53f8f3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"172472379647bdbfde685336feaeef63941b9230166d09272d691522d53f8f3d","first_computed_at":"2026-05-18T01:36:58.451803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:58.451803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTcgZB3SimetBA8jeVb9zKlW4wNcVei21oakCx+6Rdhxi0/17ArWeVO6BHMAUffaHsZwBHT0COjWpK6sqT+HCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:58.452362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3050","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfcbe7b8a97e36eb3ab63f43e473e8dd6b3f994b5894959b501d495afc1b8064","sha256:94b197f2e51cddc3cb1317189e19545f4e129942b19ec28b197535fb0e199095"],"state_sha256":"3ffb0e9ee5bfb9eb656a723bc95b22a9ddaf41d6629f42e4b43ed2291d362a4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpV+jLjpL8gMCD+2oV0gvw/Ohs/tQle6nrE2blzwjZgdle+tLcf4kpoPC6Vnv8t4JwAmhWwGzFajj1vqzruDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:41:17.081934Z","bundle_sha256":"44866c4ebe487320b791d215a1bb9bdc53f9a04ef6213bcbc4e990a6e5f63f48"}}