{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BKRTFA74QL6UH2Q7I3K3K5RMKO","short_pith_number":"pith:BKRTFA74","canonical_record":{"source":{"id":"1701.08389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T14:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"e1839dc031122c99c038e6900a3af16ca3edf103097f97367e610894a2e29558","abstract_canon_sha256":"0cf5db16079d2d4fab00d0979ddaf86218ea5ddf14720af818509fed02a5b383"},"schema_version":"1.0"},"canonical_sha256":"0aa33283fc82fd43ea1f46d5b5762c53b51217ffb8fdf7e2a8efd6ad5f5a4b37","source":{"kind":"arxiv","id":"1701.08389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08389","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08389v2","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08389","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"BKRTFA74QL6U","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKRTFA74QL6UH2Q7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKRTFA74","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BKRTFA74QL6UH2Q7I3K3K5RMKO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T14:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"e1839dc031122c99c038e6900a3af16ca3edf103097f97367e610894a2e29558","abstract_canon_sha256":"0cf5db16079d2d4fab00d0979ddaf86218ea5ddf14720af818509fed02a5b383"},"schema_version":"1.0"},"canonical_sha256":"0aa33283fc82fd43ea1f46d5b5762c53b51217ffb8fdf7e2a8efd6ad5f5a4b37","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:30.082194Z","signature_b64":"Ko30ZX8RzLrUFJRi8PSaFh9G7pnVrC+duYfehA/wj2pqPdk2SmRBHjv/C3/5UN6PmtTVSpja1orI+lEeBF/7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aa33283fc82fd43ea1f46d5b5762c53b51217ffb8fdf7e2a8efd6ad5f5a4b37","last_reissued_at":"2026-05-18T00:45:30.081821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:30.081821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08389","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-18T00:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kigD3B9FYi+R2uqFymA4erVNBMdy9z4f74tM73XkzOL8umb2/yKFbI7NYNoKpJEH+W6NXotjKYh7+3RxjTh+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:02.011478Z"},"content_sha256":"28a36a6c3bba9d088e60465e296261da20cb8113bb7ea9ed4c555fdfc74e8938","schema_version":"1.0","event_id":"sha256:28a36a6c3bba9d088e60465e296261da20cb8113bb7ea9ed4c555fdfc74e8938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BKRTFA74QL6UH2Q7I3K3K5RMKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunxiang Wang, Jia-Bao Liu, Shaohui Wang","submitted_at":"2017-01-29T14:53:48Z","abstract_excerpt":"The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges. In our work, we explore the multiplicative Zagreb indices of bipartite graphs of order $n$ with diameter $d$, and sharp upper bounds are obtained for these indices of graphs in $\\mathcal{B}(n,d)$, where $\\mathcal{B}(n, d)$ is the set of all $n$-vertex bipartite graphs with the diameter $d$. In addition, we explore the relationship between the maximal multiplicative Zagreb indices of graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08389","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-18T00:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zytJ/LQC70BxuVHkK6NQWJGjzlqLC/WtB8unnCzOtbuJeSTjauvgYib21mNXlrrfyL7h7d+A0a0HQoTDqD6UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:48:02.012036Z"},"content_sha256":"883612166eb8a3b8a78f1bc39d75f1c79e5e2520ab84cf95f36ba733d05c4480","schema_version":"1.0","event_id":"sha256:883612166eb8a3b8a78f1bc39d75f1c79e5e2520ab84cf95f36ba733d05c4480"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO/bundle.json","state_url":"https://pith.science/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO/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-26T09:48:02Z","links":{"resolver":"https://pith.science/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO","bundle":"https://pith.science/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO/bundle.json","state":"https://pith.science/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKRTFA74QL6UH2Q7I3K3K5RMKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BKRTFA74QL6UH2Q7I3K3K5RMKO","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":"0cf5db16079d2d4fab00d0979ddaf86218ea5ddf14720af818509fed02a5b383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T14:53:48Z","title_canon_sha256":"e1839dc031122c99c038e6900a3af16ca3edf103097f97367e610894a2e29558"},"schema_version":"1.0","source":{"id":"1701.08389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08389","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08389v2","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08389","created_at":"2026-05-18T00:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"BKRTFA74QL6U","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKRTFA74QL6UH2Q7","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKRTFA74","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:883612166eb8a3b8a78f1bc39d75f1c79e5e2520ab84cf95f36ba733d05c4480","target":"graph","created_at":"2026-05-18T00:45:30Z","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 multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges. In our work, we explore the multiplicative Zagreb indices of bipartite graphs of order $n$ with diameter $d$, and sharp upper bounds are obtained for these indices of graphs in $\\mathcal{B}(n,d)$, where $\\mathcal{B}(n, d)$ is the set of all $n$-vertex bipartite graphs with the diameter $d$. In addition, we explore the relationship between the maximal multiplicative Zagreb indices of graph","authors_text":"Chunxiang Wang, Jia-Bao Liu, Shaohui Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T14:53:48Z","title":"Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08389","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:28a36a6c3bba9d088e60465e296261da20cb8113bb7ea9ed4c555fdfc74e8938","target":"record","created_at":"2026-05-18T00:45:30Z","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":"0cf5db16079d2d4fab00d0979ddaf86218ea5ddf14720af818509fed02a5b383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-29T14:53:48Z","title_canon_sha256":"e1839dc031122c99c038e6900a3af16ca3edf103097f97367e610894a2e29558"},"schema_version":"1.0","source":{"id":"1701.08389","kind":"arxiv","version":2}},"canonical_sha256":"0aa33283fc82fd43ea1f46d5b5762c53b51217ffb8fdf7e2a8efd6ad5f5a4b37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0aa33283fc82fd43ea1f46d5b5762c53b51217ffb8fdf7e2a8efd6ad5f5a4b37","first_computed_at":"2026-05-18T00:45:30.081821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:30.081821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ko30ZX8RzLrUFJRi8PSaFh9G7pnVrC+duYfehA/wj2pqPdk2SmRBHjv/C3/5UN6PmtTVSpja1orI+lEeBF/7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:30.082194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28a36a6c3bba9d088e60465e296261da20cb8113bb7ea9ed4c555fdfc74e8938","sha256:883612166eb8a3b8a78f1bc39d75f1c79e5e2520ab84cf95f36ba733d05c4480"],"state_sha256":"9aee54be51a98b8f3d6a5e889dc007ffd253eb4b6e68fabdbd241d3fcbf40157"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SptZSVaMOex8S2xlGHepG5yV+NC7wYAH9uOI1qYNbbigTDXRd+sW/3zYLCv/OkNObadnn3+FS7TutLCRlK1gBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:48:02.016180Z","bundle_sha256":"db5420627d2f414b3f71f6f20bd70eec3e36aa8aae6c395b29773527be6b28fd"}}