{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2T3XT3CN7PVJP36N4EC7IQTHEL","short_pith_number":"pith:2T3XT3CN","canonical_record":{"source":{"id":"1709.01542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T18:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"63fb8db71fc1dde036331462df458d235c29d04062ddacd5cb9573a3d1a0f4f8","abstract_canon_sha256":"38f30e509b4ba9dda6f3582782b954e799569fb0154aabe5c3077810be776948"},"schema_version":"1.0"},"canonical_sha256":"d4f779ec4dfbea97efcde105f4426722e12baf74aa780ef8577f61df35977748","source":{"kind":"arxiv","id":"1709.01542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01542","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01542v1","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01542","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"2T3XT3CN7PVJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2T3XT3CN7PVJP36N","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2T3XT3CN","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2T3XT3CN7PVJP36N4EC7IQTHEL","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T18:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"63fb8db71fc1dde036331462df458d235c29d04062ddacd5cb9573a3d1a0f4f8","abstract_canon_sha256":"38f30e509b4ba9dda6f3582782b954e799569fb0154aabe5c3077810be776948"},"schema_version":"1.0"},"canonical_sha256":"d4f779ec4dfbea97efcde105f4426722e12baf74aa780ef8577f61df35977748","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:54.852298Z","signature_b64":"+Onr+TJV93IlioN+l4BTvrtqB6RkN442ThA8jOEICy5KpJ4FS6wwh75Sak2IqE9/lFHAi1m2kbrAZdQN5t7hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f779ec4dfbea97efcde105f4426722e12baf74aa780ef8577f61df35977748","last_reissued_at":"2026-05-18T00:35:54.851818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:54.851818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01542","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:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sa3vnTq5EwsabJVLprUTotHJfVkbs7KINTwI9unOHGFc42JPE+eAkuP8ekZHZz2LgT+l/uCSrJe9JOLhOS2RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:13:01.297875Z"},"content_sha256":"01312f667d69543fa73c0d59d5fb04d593dca3eb42b1c76f80d8c4dba4a6d136","schema_version":"1.0","event_id":"sha256:01312f667d69543fa73c0d59d5fb04d593dca3eb42b1c76f80d8c4dba4a6d136"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2T3XT3CN7PVJP36N4EC7IQTHEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shaohui Wang, Shengjin Ji","submitted_at":"2017-09-05T18:31:51Z","abstract_excerpt":"The first Zagreb index of a graph $G$ is the sum of the square of every vertex degree, while the second Zagreb index is the sum of the product of vertex degrees of each edge over all edges. In our work, we solve an open question about Zagreb indices of graphs with given number of cut vertices. The sharp lower bounds are obtained for these indices of graphs in $\\mathbb{V}_{n,k}$, where $\\mathbb{V}_{n, k}$ denotes the set of all $n$-vertex graphs with $k$ cut vertices and at least one cycle. As consequences, those graphs with the smallest Zagreb indices are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01542","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:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0CWAN6bR/yKPzA/SRxZZg3ScPkn+1Lk6r2FqoHdOZkzM7uHpg+F9Te5UrLnWktICUZ9GRbNf8PgMAMw2QksCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T08:13:01.298218Z"},"content_sha256":"19945522f954bff4543073170595835dff0b2d094f2063f392bce3f02b3bc30e","schema_version":"1.0","event_id":"sha256:19945522f954bff4543073170595835dff0b2d094f2063f392bce3f02b3bc30e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2T3XT3CN7PVJP36N4EC7IQTHEL/bundle.json","state_url":"https://pith.science/pith/2T3XT3CN7PVJP36N4EC7IQTHEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2T3XT3CN7PVJP36N4EC7IQTHEL/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-29T08:13:01Z","links":{"resolver":"https://pith.science/pith/2T3XT3CN7PVJP36N4EC7IQTHEL","bundle":"https://pith.science/pith/2T3XT3CN7PVJP36N4EC7IQTHEL/bundle.json","state":"https://pith.science/pith/2T3XT3CN7PVJP36N4EC7IQTHEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2T3XT3CN7PVJP36N4EC7IQTHEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2T3XT3CN7PVJP36N4EC7IQTHEL","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":"38f30e509b4ba9dda6f3582782b954e799569fb0154aabe5c3077810be776948","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T18:31:51Z","title_canon_sha256":"63fb8db71fc1dde036331462df458d235c29d04062ddacd5cb9573a3d1a0f4f8"},"schema_version":"1.0","source":{"id":"1709.01542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01542","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01542v1","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01542","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"2T3XT3CN7PVJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2T3XT3CN7PVJP36N","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2T3XT3CN","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:19945522f954bff4543073170595835dff0b2d094f2063f392bce3f02b3bc30e","target":"graph","created_at":"2026-05-18T00:35:54Z","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 first Zagreb index of a graph $G$ is the sum of the square of every vertex degree, while the second Zagreb index is the sum of the product of vertex degrees of each edge over all edges. In our work, we solve an open question about Zagreb indices of graphs with given number of cut vertices. The sharp lower bounds are obtained for these indices of graphs in $\\mathbb{V}_{n,k}$, where $\\mathbb{V}_{n, k}$ denotes the set of all $n$-vertex graphs with $k$ cut vertices and at least one cycle. As consequences, those graphs with the smallest Zagreb indices are characterized.","authors_text":"Shaohui Wang, Shengjin Ji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T18:31:51Z","title":"On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01542","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:01312f667d69543fa73c0d59d5fb04d593dca3eb42b1c76f80d8c4dba4a6d136","target":"record","created_at":"2026-05-18T00:35:54Z","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":"38f30e509b4ba9dda6f3582782b954e799569fb0154aabe5c3077810be776948","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T18:31:51Z","title_canon_sha256":"63fb8db71fc1dde036331462df458d235c29d04062ddacd5cb9573a3d1a0f4f8"},"schema_version":"1.0","source":{"id":"1709.01542","kind":"arxiv","version":1}},"canonical_sha256":"d4f779ec4dfbea97efcde105f4426722e12baf74aa780ef8577f61df35977748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4f779ec4dfbea97efcde105f4426722e12baf74aa780ef8577f61df35977748","first_computed_at":"2026-05-18T00:35:54.851818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:54.851818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Onr+TJV93IlioN+l4BTvrtqB6RkN442ThA8jOEICy5KpJ4FS6wwh75Sak2IqE9/lFHAi1m2kbrAZdQN5t7hDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:54.852298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01312f667d69543fa73c0d59d5fb04d593dca3eb42b1c76f80d8c4dba4a6d136","sha256:19945522f954bff4543073170595835dff0b2d094f2063f392bce3f02b3bc30e"],"state_sha256":"a5158665eb949be4179c3fbc4793eb6be7b85b7d040d8e38ce9ac033b9eee0f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmt5OBHE0chseXc3jwuN8X5oTNb4LEz9Vr6rBM4QGmGtjInGluQJiI+3u54Y61hQN6lIsqb7qn2ArLwu3Wy9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T08:13:01.300038Z","bundle_sha256":"c4b540cc14aecf89c6c396fe19a14594595d87a058d058c5d7bfa9fcacf561f1"}}