{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FNI5FMU4JJHL7FTW4TR3MI6JHR","short_pith_number":"pith:FNI5FMU4","canonical_record":{"source":{"id":"1705.02482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T13:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"df5c6e2360f6337e493cc121bddda0c10ab4e197e670e32dc51efaa14a0b6b2d","abstract_canon_sha256":"4e96acdee8b3010b505fea7cbcb554d7f78ab3982375653959ea42f57b843e21"},"schema_version":"1.0"},"canonical_sha256":"2b51d2b29c4a4ebf9676e4e3b623c93c794b72aa871141d38622cc414fbc390f","source":{"kind":"arxiv","id":"1705.02482","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02482","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02482v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02482","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"FNI5FMU4JJHL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FNI5FMU4JJHL7FTW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FNI5FMU4","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FNI5FMU4JJHL7FTW4TR3MI6JHR","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T13:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"df5c6e2360f6337e493cc121bddda0c10ab4e197e670e32dc51efaa14a0b6b2d","abstract_canon_sha256":"4e96acdee8b3010b505fea7cbcb554d7f78ab3982375653959ea42f57b843e21"},"schema_version":"1.0"},"canonical_sha256":"2b51d2b29c4a4ebf9676e4e3b623c93c794b72aa871141d38622cc414fbc390f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:56.415736Z","signature_b64":"270dQcmWYpFnCx5lpXw7iM3RgLagtZq+XmijsWAsBxhkhSVkg5OSjgQmyYvquOlrFer+uF0tTJN0oHLEDZi5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b51d2b29c4a4ebf9676e4e3b623c93c794b72aa871141d38622cc414fbc390f","last_reissued_at":"2026-05-18T00:44:56.415128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:56.415128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02482","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:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJrvrFseud/FBw7+tecPjmDpcAILLAT7KUgwv4g/54PFLd6LpMsqYiSFkKTEEcKP/zaneLjEN0NEJe18FuSUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T08:09:57.203448Z"},"content_sha256":"a7717741ce99cbbf6d303ce281ec4ac2a6e388d041479bd1230fcad0fc013de5","schema_version":"1.0","event_id":"sha256:a7717741ce99cbbf6d303ce281ec4ac2a6e388d041479bd1230fcad0fc013de5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FNI5FMU4JJHL7FTW4TR3MI6JHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunxiang Wang, Lin Chen, Shaohui Wang","submitted_at":"2017-05-06T13:06:09Z","abstract_excerpt":"For a molecular graph, the first multiplicative Zagreb index $\\Pi_1$ is equal to the product of the square of the degree of the vertices, while the second multiplicative Zagreb index $\\Pi_2$ is equal to the product of the endvertex degree of each edge over all edges. Denote by $\\mathbb{G}_{n,k}$ the set of graphs with $n$ vertices and $k$ cut edges. In this paper, we explore graphs in terms of a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges are provided. Furthermore, we characterize graphs with the largest and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02482","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:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm/8tZ4h8TIKNwj2fdSJIXlrZ2EWaiLOqv6xgZne97usXeCF6SPp33fHllu1xIrYD/QbGoUOfL3PJRKzFR2rAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T08:09:57.204121Z"},"content_sha256":"a1478b7ec99f105256087aab58ef081086d8a3822f91dafe530d7a5e5b5695f0","schema_version":"1.0","event_id":"sha256:a1478b7ec99f105256087aab58ef081086d8a3822f91dafe530d7a5e5b5695f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR/bundle.json","state_url":"https://pith.science/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR/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-08T08:09:57Z","links":{"resolver":"https://pith.science/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR","bundle":"https://pith.science/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR/bundle.json","state":"https://pith.science/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNI5FMU4JJHL7FTW4TR3MI6JHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FNI5FMU4JJHL7FTW4TR3MI6JHR","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":"4e96acdee8b3010b505fea7cbcb554d7f78ab3982375653959ea42f57b843e21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T13:06:09Z","title_canon_sha256":"df5c6e2360f6337e493cc121bddda0c10ab4e197e670e32dc51efaa14a0b6b2d"},"schema_version":"1.0","source":{"id":"1705.02482","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02482","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02482v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02482","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"FNI5FMU4JJHL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FNI5FMU4JJHL7FTW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FNI5FMU4","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:a1478b7ec99f105256087aab58ef081086d8a3822f91dafe530d7a5e5b5695f0","target":"graph","created_at":"2026-05-18T00:44:56Z","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":"For a molecular graph, the first multiplicative Zagreb index $\\Pi_1$ is equal to the product of the square of the degree of the vertices, while the second multiplicative Zagreb index $\\Pi_2$ is equal to the product of the endvertex degree of each edge over all edges. Denote by $\\mathbb{G}_{n,k}$ the set of graphs with $n$ vertices and $k$ cut edges. In this paper, we explore graphs in terms of a number of cut edges. In addition, the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges are provided. Furthermore, we characterize graphs with the largest and s","authors_text":"Chunxiang Wang, Lin Chen, Shaohui Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T13:06:09Z","title":"On the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02482","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:a7717741ce99cbbf6d303ce281ec4ac2a6e388d041479bd1230fcad0fc013de5","target":"record","created_at":"2026-05-18T00:44:56Z","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":"4e96acdee8b3010b505fea7cbcb554d7f78ab3982375653959ea42f57b843e21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T13:06:09Z","title_canon_sha256":"df5c6e2360f6337e493cc121bddda0c10ab4e197e670e32dc51efaa14a0b6b2d"},"schema_version":"1.0","source":{"id":"1705.02482","kind":"arxiv","version":1}},"canonical_sha256":"2b51d2b29c4a4ebf9676e4e3b623c93c794b72aa871141d38622cc414fbc390f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b51d2b29c4a4ebf9676e4e3b623c93c794b72aa871141d38622cc414fbc390f","first_computed_at":"2026-05-18T00:44:56.415128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:56.415128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"270dQcmWYpFnCx5lpXw7iM3RgLagtZq+XmijsWAsBxhkhSVkg5OSjgQmyYvquOlrFer+uF0tTJN0oHLEDZi5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:56.415736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02482","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7717741ce99cbbf6d303ce281ec4ac2a6e388d041479bd1230fcad0fc013de5","sha256:a1478b7ec99f105256087aab58ef081086d8a3822f91dafe530d7a5e5b5695f0"],"state_sha256":"6b3424fe6493f1b6ade28ecec89f7c0f29b3702b0580f4729bfd209430909bee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4m2qp6c/j7hv7TK1S0JOF0S/Q7tktigE8Z2gv5G4iKsosd94/283Vi39WBtcqelXR7wxe6rWQejyGd7mKXcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T08:09:57.208430Z","bundle_sha256":"0a8131279a1fd6d013839d8b19bb529ba4a05b3371826684fd8d9ba10aa44846"}}