{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GFEYSGXCZTKTLJNG66TDSY6S2Y","short_pith_number":"pith:GFEYSGXC","canonical_record":{"source":{"id":"1405.1293","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:00:21Z","cross_cats_sorted":[],"title_canon_sha256":"f7fccc550144c45367e49d94352baa7d7186d13ba0153a5421f7496514c34119","abstract_canon_sha256":"cc83fa50f4097547761c01c6c008af1b28d2bf000bcb51cdacaba309c4bacb75"},"schema_version":"1.0"},"canonical_sha256":"3149891ae2ccd535a5a6f7a63963d2d63b50ffb102645b46cb678d087bbdf670","source":{"kind":"arxiv","id":"1405.1293","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1293","created_at":"2026-05-18T01:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1293v3","created_at":"2026-05-18T01:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1293","created_at":"2026-05-18T01:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"GFEYSGXCZTKT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GFEYSGXCZTKTLJNG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GFEYSGXC","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GFEYSGXCZTKTLJNG66TDSY6S2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1293","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:00:21Z","cross_cats_sorted":[],"title_canon_sha256":"f7fccc550144c45367e49d94352baa7d7186d13ba0153a5421f7496514c34119","abstract_canon_sha256":"cc83fa50f4097547761c01c6c008af1b28d2bf000bcb51cdacaba309c4bacb75"},"schema_version":"1.0"},"canonical_sha256":"3149891ae2ccd535a5a6f7a63963d2d63b50ffb102645b46cb678d087bbdf670","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:43.862154Z","signature_b64":"bP5PvBpD6ATs5ZxrZpQlfBtHYj0C2G0KhgHw5pXenv60O+U4lcFDX/LcyXhWriUX10zALXjfpVwec3+2XHh0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3149891ae2ccd535a5a6f7a63963d2d63b50ffb102645b46cb678d087bbdf670","last_reissued_at":"2026-05-18T01:36:43.861553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:43.861553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1293","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrrdisAj+pML1fIfvL8fDVwq6XLTva2cyVisCa4blOKYT/z5X5VFX5UAdl8ptg9zbhnszYI4MaMCdbtPvYm1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:12:10.453052Z"},"content_sha256":"7fa7f686dd3ff4e6c7f27e566814592bcbedc39964b4c8c855cb893b68aaca64","schema_version":"1.0","event_id":"sha256:7fa7f686dd3ff4e6c7f27e566814592bcbedc39964b4c8c855cb893b68aaca64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GFEYSGXCZTKTLJNG66TDSY6S2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Degree-based Topological Indices for Trees with Given Number of Pendent Vertices + Erratum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mikhail Goubko, Tam\\'as R\\'eti","submitted_at":"2014-05-06T15:00:21Z","abstract_excerpt":"We derive sharp lower bounds for the first and the second Zagreb indices ($M_1$ and $M_2$ respectively) for trees and chemical trees with the given number of pendent vertices and find optimal trees. $M_1$ is minimized by a tree with all internal vertices having degree 4, while $M_2$ is minimized by a tree where each \"stem\" vertex is incident to 3 or 4 pendent vertices and one internal vertex, while the rest internal vertices are incident to 3 other internal vertices. The technique is shown to generalize to the weighted first Zagreb index, the zeroth order general Randi\\'{c} index, as long as t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1293","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCMGu2HItfSlMs8xi3v6h2/Gwxj+ZFYkU13QZLLJZtPbH4RpVjP7+ANegxuDe/JdpYHTaKX2wi0z0TBqxZZiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:12:10.453401Z"},"content_sha256":"9f4949ab72d4eef90be58b449df994cc80b44f8023d8b1b0dfa4807fcd27d2fd","schema_version":"1.0","event_id":"sha256:9f4949ab72d4eef90be58b449df994cc80b44f8023d8b1b0dfa4807fcd27d2fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y/bundle.json","state_url":"https://pith.science/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y/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-07-07T13:12:10Z","links":{"resolver":"https://pith.science/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y","bundle":"https://pith.science/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y/bundle.json","state":"https://pith.science/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFEYSGXCZTKTLJNG66TDSY6S2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GFEYSGXCZTKTLJNG66TDSY6S2Y","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":"cc83fa50f4097547761c01c6c008af1b28d2bf000bcb51cdacaba309c4bacb75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:00:21Z","title_canon_sha256":"f7fccc550144c45367e49d94352baa7d7186d13ba0153a5421f7496514c34119"},"schema_version":"1.0","source":{"id":"1405.1293","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1293","created_at":"2026-05-18T01:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1293v3","created_at":"2026-05-18T01:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1293","created_at":"2026-05-18T01:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"GFEYSGXCZTKT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GFEYSGXCZTKTLJNG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GFEYSGXC","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:9f4949ab72d4eef90be58b449df994cc80b44f8023d8b1b0dfa4807fcd27d2fd","target":"graph","created_at":"2026-05-18T01:36:43Z","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 derive sharp lower bounds for the first and the second Zagreb indices ($M_1$ and $M_2$ respectively) for trees and chemical trees with the given number of pendent vertices and find optimal trees. $M_1$ is minimized by a tree with all internal vertices having degree 4, while $M_2$ is minimized by a tree where each \"stem\" vertex is incident to 3 or 4 pendent vertices and one internal vertex, while the rest internal vertices are incident to 3 other internal vertices. The technique is shown to generalize to the weighted first Zagreb index, the zeroth order general Randi\\'{c} index, as long as t","authors_text":"Mikhail Goubko, Tam\\'as R\\'eti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:00:21Z","title":"Minimizing Degree-based Topological Indices for Trees with Given Number of Pendent Vertices + Erratum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1293","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:7fa7f686dd3ff4e6c7f27e566814592bcbedc39964b4c8c855cb893b68aaca64","target":"record","created_at":"2026-05-18T01:36:43Z","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":"cc83fa50f4097547761c01c6c008af1b28d2bf000bcb51cdacaba309c4bacb75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T15:00:21Z","title_canon_sha256":"f7fccc550144c45367e49d94352baa7d7186d13ba0153a5421f7496514c34119"},"schema_version":"1.0","source":{"id":"1405.1293","kind":"arxiv","version":3}},"canonical_sha256":"3149891ae2ccd535a5a6f7a63963d2d63b50ffb102645b46cb678d087bbdf670","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3149891ae2ccd535a5a6f7a63963d2d63b50ffb102645b46cb678d087bbdf670","first_computed_at":"2026-05-18T01:36:43.861553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:43.861553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bP5PvBpD6ATs5ZxrZpQlfBtHYj0C2G0KhgHw5pXenv60O+U4lcFDX/LcyXhWriUX10zALXjfpVwec3+2XHh0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:43.862154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1293","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fa7f686dd3ff4e6c7f27e566814592bcbedc39964b4c8c855cb893b68aaca64","sha256:9f4949ab72d4eef90be58b449df994cc80b44f8023d8b1b0dfa4807fcd27d2fd"],"state_sha256":"41d02347fdc9f736cf1af810246e12a4083b2d76c255f8c980ee55e9178e54eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+syYV6vLHJzhOCDGhzHo6rZaVIKAk/68ku4MXQ1YrFOZznS6RyelFlkpJbSwES/kDwVTdre7jhokeIE01gQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:12:10.456133Z","bundle_sha256":"87294936e4fecd99099b26d6b8094d8748b7b92ee22ccb0b253ea88751dfb28d"}}