{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CABNLVRI2H4YLXOZAJ4YQJQGUK","short_pith_number":"pith:CABNLVRI","canonical_record":{"source":{"id":"2605.29080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T20:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"0da1ef15bbe5ce1c7fe506fde96151cca4dd33e4fb2f3d9e1bea480b46a8bd9a","abstract_canon_sha256":"c3e256af20374c893a65180fdb24fe02f8005967b8a4315529e73655d2662bd5"},"schema_version":"1.0"},"canonical_sha256":"1002d5d628d1f985ddd90279882606a2816b6f32ff4a33e544fb4895455245fb","source":{"kind":"arxiv","id":"2605.29080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29080","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29080v1","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29080","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"CABNLVRI2H4Y","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"CABNLVRI2H4YLXOZ","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"CABNLVRI","created_at":"2026-05-29T01:05:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CABNLVRI2H4YLXOZAJ4YQJQGUK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.29080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T20:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"0da1ef15bbe5ce1c7fe506fde96151cca4dd33e4fb2f3d9e1bea480b46a8bd9a","abstract_canon_sha256":"c3e256af20374c893a65180fdb24fe02f8005967b8a4315529e73655d2662bd5"},"schema_version":"1.0"},"canonical_sha256":"1002d5d628d1f985ddd90279882606a2816b6f32ff4a33e544fb4895455245fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:17.283094Z","signature_b64":"5wTZ+RnSpRoUgcJcAYf2Gfr81qyehUGgasW6ckaHfNU/Y+dn0JXYHz522RIGV7AWSjdTY6GcCPd2CW5E0u1sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1002d5d628d1f985ddd90279882606a2816b6f32ff4a33e544fb4895455245fb","last_reissued_at":"2026-05-29T01:05:17.282192Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:17.282192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.29080","source_version":1,"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-29T01:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onWqf9aoAIYUBdDdEZ5O4EhUDnY1RSsEINawa0vCOsOdtvfaw6b7CKkwDrPsjvsm9O88bCU0cVsXW6sTHSJRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:40:53.071338Z"},"content_sha256":"ccc583f1fb45a17808a8adf5ffbc9e5acec2cc71cc21958b9aaef9c7acb0b5ff","schema_version":"1.0","event_id":"sha256:ccc583f1fb45a17808a8adf5ffbc9e5acec2cc71cc21958b9aaef9c7acb0b5ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CABNLVRI2H4YLXOZAJ4YQJQGUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A stability theorem for embedding bounded degree spanning trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Csaba","submitted_at":"2026-05-27T20:35:06Z","abstract_excerpt":"We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma, instead we apply a vertex decomposition theorem by the author, which does not require a tower-type lower bound for $n.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29080","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29080/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-29T01:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouwW2b/h3q6SRfBjNxsBj3bOUCje5POvBf/Zj9/qxIcF6dXZRqKgYDshLwEgM6nET7jsIdDcgcPI9X/e8q94CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:40:53.071718Z"},"content_sha256":"bb955f290fe4fcee0f578563ffaacf4f9e39e1ec0af5122ed365ea812b6d4434","schema_version":"1.0","event_id":"sha256:bb955f290fe4fcee0f578563ffaacf4f9e39e1ec0af5122ed365ea812b6d4434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK/bundle.json","state_url":"https://pith.science/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK/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-26T01:40:53Z","links":{"resolver":"https://pith.science/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK","bundle":"https://pith.science/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK/bundle.json","state":"https://pith.science/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CABNLVRI2H4YLXOZAJ4YQJQGUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CABNLVRI2H4YLXOZAJ4YQJQGUK","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":"c3e256af20374c893a65180fdb24fe02f8005967b8a4315529e73655d2662bd5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T20:35:06Z","title_canon_sha256":"0da1ef15bbe5ce1c7fe506fde96151cca4dd33e4fb2f3d9e1bea480b46a8bd9a"},"schema_version":"1.0","source":{"id":"2605.29080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.29080","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.29080v1","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29080","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"CABNLVRI2H4Y","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"CABNLVRI2H4YLXOZ","created_at":"2026-05-29T01:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"CABNLVRI","created_at":"2026-05-29T01:05:17Z"}],"graph_snapshots":[{"event_id":"sha256:bb955f290fe4fcee0f578563ffaacf4f9e39e1ec0af5122ed365ea812b6d4434","target":"graph","created_at":"2026-05-29T01:05:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.29080/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma, instead we apply a vertex decomposition theorem by the author, which does not require a tower-type lower bound for $n.$","authors_text":"B\\'ela Csaba","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T20:35:06Z","title":"A stability theorem for embedding bounded degree spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29080","kind":"arxiv","version":1},"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:ccc583f1fb45a17808a8adf5ffbc9e5acec2cc71cc21958b9aaef9c7acb0b5ff","target":"record","created_at":"2026-05-29T01:05:17Z","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":"c3e256af20374c893a65180fdb24fe02f8005967b8a4315529e73655d2662bd5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T20:35:06Z","title_canon_sha256":"0da1ef15bbe5ce1c7fe506fde96151cca4dd33e4fb2f3d9e1bea480b46a8bd9a"},"schema_version":"1.0","source":{"id":"2605.29080","kind":"arxiv","version":1}},"canonical_sha256":"1002d5d628d1f985ddd90279882606a2816b6f32ff4a33e544fb4895455245fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1002d5d628d1f985ddd90279882606a2816b6f32ff4a33e544fb4895455245fb","first_computed_at":"2026-05-29T01:05:17.282192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:17.282192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5wTZ+RnSpRoUgcJcAYf2Gfr81qyehUGgasW6ckaHfNU/Y+dn0JXYHz522RIGV7AWSjdTY6GcCPd2CW5E0u1sCg==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:17.283094Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.29080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccc583f1fb45a17808a8adf5ffbc9e5acec2cc71cc21958b9aaef9c7acb0b5ff","sha256:bb955f290fe4fcee0f578563ffaacf4f9e39e1ec0af5122ed365ea812b6d4434"],"state_sha256":"7af7f534fc27cbf7f3761cf4cfcccb5765df75e8b2371cb2e165d12d22e5b3fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJO89zcPTa1zYyqfoJWPf8kHIzXW+vOgakWx2FTwui45XcV3s/ccpdNo4Hm1WwnVfc9I/+D+JmKy1JIg9Zz+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:40:53.073733Z","bundle_sha256":"f4040a34a763f778743f3d7503bdcc07836c14d8bb21e84dd7116186c2e70dea"}}