{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SBBXMTHSIF2I2RTZ75EWZOD34O","short_pith_number":"pith:SBBXMTHS","canonical_record":{"source":{"id":"1806.04451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T11:54:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"87d44e1e893f3dc23fbf1e99553c2b99eb0cd299daf5b828cd9fce1824642493","abstract_canon_sha256":"85c23244099fc123a061f0a37d57f1bb27ec131ba1c927553ee71fe1a20d74f5"},"schema_version":"1.0"},"canonical_sha256":"9043764cf241748d4679ff496cb87be399b9818cc8e0ed9dbf54673c545f23ad","source":{"kind":"arxiv","id":"1806.04451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04451","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04451v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04451","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"SBBXMTHSIF2I","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBBXMTHSIF2I2RTZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBBXMTHS","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SBBXMTHSIF2I2RTZ75EWZOD34O","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T11:54:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"87d44e1e893f3dc23fbf1e99553c2b99eb0cd299daf5b828cd9fce1824642493","abstract_canon_sha256":"85c23244099fc123a061f0a37d57f1bb27ec131ba1c927553ee71fe1a20d74f5"},"schema_version":"1.0"},"canonical_sha256":"9043764cf241748d4679ff496cb87be399b9818cc8e0ed9dbf54673c545f23ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.486930Z","signature_b64":"qs8FQguW3ebFNW318IOlYbZohoHsPJEexLvaoT3QEtg/N1Fi7fnfDzgJsEDG5VAgsulx/dkZd1wbFvotRCsJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9043764cf241748d4679ff496cb87be399b9818cc8e0ed9dbf54673c545f23ad","last_reissued_at":"2026-05-18T00:13:35.486263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.486263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04451","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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqAFf1Qxv4tkj8SiKkPJ4auLm5II7gusdn5IqF6/9JfE4ikoqhFEehKl3bZij7e7MheXNHoxHSPJf2pZ1Eq+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:19.147883Z"},"content_sha256":"a656413ecf1cd6a9b2601481a1230251abe181644181b9b3c9ca1808f34b89c2","schema_version":"1.0","event_id":"sha256:a656413ecf1cd6a9b2601481a1230251abe181644181b9b3c9ca1808f34b89c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SBBXMTHSIF2I2RTZ75EWZOD34O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the minimum leaf number of cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"G\\'abor Wiener, Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput","submitted_at":"2018-06-12T11:54:15Z","abstract_excerpt":"The \\emph{minimum leaf number} $\\hbox{ml} (G)$ of a connected graph $G$ is defined as the minimum number of leaves of the spanning trees of $G$. We present new results concerning the minimum leaf number of cubic graphs: we show that if $G$ is a connected cubic graph of order $n$, then $\\mathrm{ml}(G) \\leq \\frac{n}6 + \\frac13$, improving on the best known result in [Inf. Process. Lett. 105 (2008) 164-169] and proving the conjecture in [Electron. J. Graph Theory and Applications 5 (2017) 207-211]. We further prove that if $G$ is also 2-connected, then $\\mathrm{ml}(G) \\leq \\frac{n}{6.53}$, improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04451","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":""},"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:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJSlDsQiTIOJnerEMvShVRYG3R6iewCxLG3Zjq76+jvz2kMMUj96wfNH9msNyORBi7igySQ4+OOzOulG07/RCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:21:19.148500Z"},"content_sha256":"8101d6b13ea4229cc55515fc024eaa9f6a5489cb7a811fc8faf7e326daba50c2","schema_version":"1.0","event_id":"sha256:8101d6b13ea4229cc55515fc024eaa9f6a5489cb7a811fc8faf7e326daba50c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBBXMTHSIF2I2RTZ75EWZOD34O/bundle.json","state_url":"https://pith.science/pith/SBBXMTHSIF2I2RTZ75EWZOD34O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBBXMTHSIF2I2RTZ75EWZOD34O/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-31T09:21:19Z","links":{"resolver":"https://pith.science/pith/SBBXMTHSIF2I2RTZ75EWZOD34O","bundle":"https://pith.science/pith/SBBXMTHSIF2I2RTZ75EWZOD34O/bundle.json","state":"https://pith.science/pith/SBBXMTHSIF2I2RTZ75EWZOD34O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBBXMTHSIF2I2RTZ75EWZOD34O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SBBXMTHSIF2I2RTZ75EWZOD34O","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":"85c23244099fc123a061f0a37d57f1bb27ec131ba1c927553ee71fe1a20d74f5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T11:54:15Z","title_canon_sha256":"87d44e1e893f3dc23fbf1e99553c2b99eb0cd299daf5b828cd9fce1824642493"},"schema_version":"1.0","source":{"id":"1806.04451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04451","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04451v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04451","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"SBBXMTHSIF2I","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBBXMTHSIF2I2RTZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBBXMTHS","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:8101d6b13ea4229cc55515fc024eaa9f6a5489cb7a811fc8faf7e326daba50c2","target":"graph","created_at":"2026-05-18T00:13:35Z","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":"The \\emph{minimum leaf number} $\\hbox{ml} (G)$ of a connected graph $G$ is defined as the minimum number of leaves of the spanning trees of $G$. We present new results concerning the minimum leaf number of cubic graphs: we show that if $G$ is a connected cubic graph of order $n$, then $\\mathrm{ml}(G) \\leq \\frac{n}6 + \\frac13$, improving on the best known result in [Inf. Process. Lett. 105 (2008) 164-169] and proving the conjecture in [Electron. J. Graph Theory and Applications 5 (2017) 207-211]. We further prove that if $G$ is also 2-connected, then $\\mathrm{ml}(G) \\leq \\frac{n}{6.53}$, improv","authors_text":"G\\'abor Wiener, Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T11:54:15Z","title":"On the minimum leaf number of cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04451","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:a656413ecf1cd6a9b2601481a1230251abe181644181b9b3c9ca1808f34b89c2","target":"record","created_at":"2026-05-18T00:13:35Z","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":"85c23244099fc123a061f0a37d57f1bb27ec131ba1c927553ee71fe1a20d74f5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T11:54:15Z","title_canon_sha256":"87d44e1e893f3dc23fbf1e99553c2b99eb0cd299daf5b828cd9fce1824642493"},"schema_version":"1.0","source":{"id":"1806.04451","kind":"arxiv","version":1}},"canonical_sha256":"9043764cf241748d4679ff496cb87be399b9818cc8e0ed9dbf54673c545f23ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9043764cf241748d4679ff496cb87be399b9818cc8e0ed9dbf54673c545f23ad","first_computed_at":"2026-05-18T00:13:35.486263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.486263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qs8FQguW3ebFNW318IOlYbZohoHsPJEexLvaoT3QEtg/N1Fi7fnfDzgJsEDG5VAgsulx/dkZd1wbFvotRCsJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.486930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a656413ecf1cd6a9b2601481a1230251abe181644181b9b3c9ca1808f34b89c2","sha256:8101d6b13ea4229cc55515fc024eaa9f6a5489cb7a811fc8faf7e326daba50c2"],"state_sha256":"353222937246383837833117453ea0c2502a4bc52866fb87ae58f0b589e35d2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJQ2O5rOOPIP8wzRcnB+uF3YkBYYMoTEaup6fFELobz99AQvf+2sWXbrLOhdrow8jCRH8yTUW8VqYLts2EA+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:21:19.151730Z","bundle_sha256":"a2b385f4292c20cc87f02ce18be025a51398c57f1e32cb2235a312aac958dec9"}}