{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7F7SR3DNKVZRPV64YNCZILLXWG","short_pith_number":"pith:7F7SR3DN","canonical_record":{"source":{"id":"1111.3266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T16:19:56Z","cross_cats_sorted":[],"title_canon_sha256":"8ba2e2e4d4fb8e03eeb072866a47eec628a57fc782f4d9a3d7806642f33bb6d1","abstract_canon_sha256":"5a5c8ccf0f95d4024ec47220c8cb450c06c63f04c7ff5ee62f8dadb46a5a7f6f"},"schema_version":"1.0"},"canonical_sha256":"f97f28ec6d557317d7dcc345942d77b19524e043a5950a4cf032144a813ae914","source":{"kind":"arxiv","id":"1111.3266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3266","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3266v2","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3266","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"7F7SR3DNKVZR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7F7SR3DNKVZRPV64","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7F7SR3DN","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7F7SR3DNKVZRPV64YNCZILLXWG","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3266","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T16:19:56Z","cross_cats_sorted":[],"title_canon_sha256":"8ba2e2e4d4fb8e03eeb072866a47eec628a57fc782f4d9a3d7806642f33bb6d1","abstract_canon_sha256":"5a5c8ccf0f95d4024ec47220c8cb450c06c63f04c7ff5ee62f8dadb46a5a7f6f"},"schema_version":"1.0"},"canonical_sha256":"f97f28ec6d557317d7dcc345942d77b19524e043a5950a4cf032144a813ae914","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:59.783626Z","signature_b64":"5vnOcvMzbQ68IV872r3+jEgJgE3GxfT2+mKTPAZfgLk87A6gIdVPXmRzdCWQT37tgLHh9QwDtFyLD2mTGRWlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97f28ec6d557317d7dcc345942d77b19524e043a5950a4cf032144a813ae914","last_reissued_at":"2026-05-18T02:50:59.783158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:59.783158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3266","source_version":2,"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-18T02:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Cs914onbWior5O7P2JO4EyzkQRMlbYbBMgEzkBTZTxYhtN2gLocvJcM66g8oSsqZeaS7CDst01OpePAQowVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:32:39.580851Z"},"content_sha256":"ba305ca4ef044ee2e73e97ea1e09be559a7a7f6cc0f233451c81d25f484dfa88","schema_version":"1.0","event_id":"sha256:ba305ca4ef044ee2e73e97ea1e09be559a7a7f6cc0f233451c81d25f484dfa88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7F7SR3DNKVZRPV64YNCZILLXWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds of a number of leaves of spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anton Bankevich, Dmitri Karpov","submitted_at":"2011-11-14T16:19:56Z","abstract_excerpt":"We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\\over 4}(s-2)+2$ leaves.\n  Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively adjacent vertices of degree 2 in the graph $G$ does not exceed $k\\ge 1$. We prove that $G$ has a spanning tree with at least $\\alpha_{g,k}(v(G)-k-2)+2$ leaves, where $\\alpha_{g,k}= {[{g+1\\over2}]\\over [{g+1\\over2}](k+3)+1}$ for $k<g-2$; $\\alpha_{g,k}= {g-2\\over (g-1)(k+2)}$ for $k\\ge g-2$.\n  We present infinite series of examples showing that all these bounds ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3266","kind":"arxiv","version":2},"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-18T02:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYmfDc3SWa0HmBbDsfAPZzV9ocLYI0qgghprJG38HWeqbiW9lQa1n174D1I0bzWLOX4STIti7xOLyAZD/5JNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:32:39.581445Z"},"content_sha256":"213c3ee4f0d6a951866a9bfd1e734aef1af51e8c6706092407e078c366c1b5d5","schema_version":"1.0","event_id":"sha256:213c3ee4f0d6a951866a9bfd1e734aef1af51e8c6706092407e078c366c1b5d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7F7SR3DNKVZRPV64YNCZILLXWG/bundle.json","state_url":"https://pith.science/pith/7F7SR3DNKVZRPV64YNCZILLXWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7F7SR3DNKVZRPV64YNCZILLXWG/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-05-31T21:32:39Z","links":{"resolver":"https://pith.science/pith/7F7SR3DNKVZRPV64YNCZILLXWG","bundle":"https://pith.science/pith/7F7SR3DNKVZRPV64YNCZILLXWG/bundle.json","state":"https://pith.science/pith/7F7SR3DNKVZRPV64YNCZILLXWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7F7SR3DNKVZRPV64YNCZILLXWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7F7SR3DNKVZRPV64YNCZILLXWG","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":"5a5c8ccf0f95d4024ec47220c8cb450c06c63f04c7ff5ee62f8dadb46a5a7f6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T16:19:56Z","title_canon_sha256":"8ba2e2e4d4fb8e03eeb072866a47eec628a57fc782f4d9a3d7806642f33bb6d1"},"schema_version":"1.0","source":{"id":"1111.3266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3266","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3266v2","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3266","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"7F7SR3DNKVZR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7F7SR3DNKVZRPV64","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7F7SR3DN","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:213c3ee4f0d6a951866a9bfd1e734aef1af51e8c6706092407e078c366c1b5d5","target":"graph","created_at":"2026-05-18T02:50:59Z","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 that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\\over 4}(s-2)+2$ leaves.\n  Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively adjacent vertices of degree 2 in the graph $G$ does not exceed $k\\ge 1$. We prove that $G$ has a spanning tree with at least $\\alpha_{g,k}(v(G)-k-2)+2$ leaves, where $\\alpha_{g,k}= {[{g+1\\over2}]\\over [{g+1\\over2}](k+3)+1}$ for $k<g-2$; $\\alpha_{g,k}= {g-2\\over (g-1)(k+2)}$ for $k\\ge g-2$.\n  We present infinite series of examples showing that all these bounds ar","authors_text":"Anton Bankevich, Dmitri Karpov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T16:19:56Z","title":"Bounds of a number of leaves of spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3266","kind":"arxiv","version":2},"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:ba305ca4ef044ee2e73e97ea1e09be559a7a7f6cc0f233451c81d25f484dfa88","target":"record","created_at":"2026-05-18T02:50:59Z","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":"5a5c8ccf0f95d4024ec47220c8cb450c06c63f04c7ff5ee62f8dadb46a5a7f6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-14T16:19:56Z","title_canon_sha256":"8ba2e2e4d4fb8e03eeb072866a47eec628a57fc782f4d9a3d7806642f33bb6d1"},"schema_version":"1.0","source":{"id":"1111.3266","kind":"arxiv","version":2}},"canonical_sha256":"f97f28ec6d557317d7dcc345942d77b19524e043a5950a4cf032144a813ae914","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f97f28ec6d557317d7dcc345942d77b19524e043a5950a4cf032144a813ae914","first_computed_at":"2026-05-18T02:50:59.783158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:59.783158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vnOcvMzbQ68IV872r3+jEgJgE3GxfT2+mKTPAZfgLk87A6gIdVPXmRzdCWQT37tgLHh9QwDtFyLD2mTGRWlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:59.783626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba305ca4ef044ee2e73e97ea1e09be559a7a7f6cc0f233451c81d25f484dfa88","sha256:213c3ee4f0d6a951866a9bfd1e734aef1af51e8c6706092407e078c366c1b5d5"],"state_sha256":"710ce7fdee571fd6e779035649e03580b618b46e37559ca781460c1c67216162"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3k1aknYAQ1V4dz2piURXg8oYBEAIZlGz00dRUcg67T0u/qaXD3uEPN9glHjRY5O4K2A+vhyK32kb0Cprt2JBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:32:39.583845Z","bundle_sha256":"fde68e9c82c0e9e4fbaf050395223d6ac4451ad4518f95f097253330c9d5c93d"}}