{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QM7DXW5DVSJZ5ZKKL5X67FQ5G3","short_pith_number":"pith:QM7DXW5D","canonical_record":{"source":{"id":"1708.00970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T02:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"bf45179014571b93c8ee5f548e93ec40d43dc5464e8b2a445ab435dd3d230628","abstract_canon_sha256":"fb9bc1b016a94e917fd91896cd807d11aa8690b236ed7cc08169f66e963a94e1"},"schema_version":"1.0"},"canonical_sha256":"833e3bdba3ac939ee54a5f6fef961d36e58a25773ba28ff78fb14d596b412408","source":{"kind":"arxiv","id":"1708.00970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00970","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00970v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00970","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"QM7DXW5DVSJZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QM7DXW5DVSJZ5ZKK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QM7DXW5D","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QM7DXW5DVSJZ5ZKKL5X67FQ5G3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T02:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"bf45179014571b93c8ee5f548e93ec40d43dc5464e8b2a445ab435dd3d230628","abstract_canon_sha256":"fb9bc1b016a94e917fd91896cd807d11aa8690b236ed7cc08169f66e963a94e1"},"schema_version":"1.0"},"canonical_sha256":"833e3bdba3ac939ee54a5f6fef961d36e58a25773ba28ff78fb14d596b412408","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.986671Z","signature_b64":"y87blrbp0VrcnSmNrNN6gYQStuB4Z7tDRwGwqQoeuUh+f83dyrAWHhdz3AAEFhrjHiSpEGAjwzf8Racw993/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"833e3bdba3ac939ee54a5f6fef961d36e58a25773ba28ff78fb14d596b412408","last_reissued_at":"2026-05-18T00:38:40.985991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.985991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00970","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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SJvBCBEdQqjYNbkyx2+/jjv91rXXNilTS7MlQi6awM4TDqqJtV1kpLu8z/wmDWMKl7JLUOXbR1hrspkMMFODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:26:39.878802Z"},"content_sha256":"2689d23240a498bc0506dd9c3031c15d91f286811e438998b7303dda05c6ae1a","schema_version":"1.0","event_id":"sha256:2689d23240a498bc0506dd9c3031c15d91f286811e438998b7303dda05c6ae1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QM7DXW5DVSJZ5ZKKL5X67FQ5G3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs having extremal monotonic topological indices with bounded vertex $k$-partiteness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Duo Duo Zhao, Fang Gao, Jia-Bao Liu, Xiao-Xin Li","submitted_at":"2017-08-03T02:19:44Z","abstract_excerpt":"The vertex $k$-partiteness $v_k(G)$ of graph $G$ is defined as the fewest number of vertices whose deletion from $G$ yields a $k$-partite graph. In this paper, we introduce two concepts: monotonic decreasing topological index and monotonic increasing topological index, and characterize the extremal graphs having the minimum Wiener index, the maximum Harry index, the maximum reciprocal degree distance, the minimum eccentricity distance sum, the minimum adjacent eccentric distance sum index, the maximum connective eccentricity index, the maximum Zagreb indices among graphs with a fixed number $n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00970","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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwkmZ8o5NohHwyHTM8kvskniahxjEVpGnQItbd/OY97rpRvEREzP74cvA/TRtjzGihtNNB7y8yTYN+k+t125Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:26:39.879457Z"},"content_sha256":"f741225e93f1012b1f68492b1a63ba507e17b22c656c647ff981e83627df23cf","schema_version":"1.0","event_id":"sha256:f741225e93f1012b1f68492b1a63ba507e17b22c656c647ff981e83627df23cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3/bundle.json","state_url":"https://pith.science/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3/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-31T10:26:39Z","links":{"resolver":"https://pith.science/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3","bundle":"https://pith.science/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3/bundle.json","state":"https://pith.science/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QM7DXW5DVSJZ5ZKKL5X67FQ5G3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QM7DXW5DVSJZ5ZKKL5X67FQ5G3","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":"fb9bc1b016a94e917fd91896cd807d11aa8690b236ed7cc08169f66e963a94e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T02:19:44Z","title_canon_sha256":"bf45179014571b93c8ee5f548e93ec40d43dc5464e8b2a445ab435dd3d230628"},"schema_version":"1.0","source":{"id":"1708.00970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00970","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00970v1","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00970","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"QM7DXW5DVSJZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QM7DXW5DVSJZ5ZKK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QM7DXW5D","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:f741225e93f1012b1f68492b1a63ba507e17b22c656c647ff981e83627df23cf","target":"graph","created_at":"2026-05-18T00:38:40Z","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 vertex $k$-partiteness $v_k(G)$ of graph $G$ is defined as the fewest number of vertices whose deletion from $G$ yields a $k$-partite graph. In this paper, we introduce two concepts: monotonic decreasing topological index and monotonic increasing topological index, and characterize the extremal graphs having the minimum Wiener index, the maximum Harry index, the maximum reciprocal degree distance, the minimum eccentricity distance sum, the minimum adjacent eccentric distance sum index, the maximum connective eccentricity index, the maximum Zagreb indices among graphs with a fixed number $n","authors_text":"Duo Duo Zhao, Fang Gao, Jia-Bao Liu, Xiao-Xin Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T02:19:44Z","title":"Graphs having extremal monotonic topological indices with bounded vertex $k$-partiteness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00970","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:2689d23240a498bc0506dd9c3031c15d91f286811e438998b7303dda05c6ae1a","target":"record","created_at":"2026-05-18T00:38:40Z","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":"fb9bc1b016a94e917fd91896cd807d11aa8690b236ed7cc08169f66e963a94e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-03T02:19:44Z","title_canon_sha256":"bf45179014571b93c8ee5f548e93ec40d43dc5464e8b2a445ab435dd3d230628"},"schema_version":"1.0","source":{"id":"1708.00970","kind":"arxiv","version":1}},"canonical_sha256":"833e3bdba3ac939ee54a5f6fef961d36e58a25773ba28ff78fb14d596b412408","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"833e3bdba3ac939ee54a5f6fef961d36e58a25773ba28ff78fb14d596b412408","first_computed_at":"2026-05-18T00:38:40.985991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.985991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y87blrbp0VrcnSmNrNN6gYQStuB4Z7tDRwGwqQoeuUh+f83dyrAWHhdz3AAEFhrjHiSpEGAjwzf8Racw993/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.986671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2689d23240a498bc0506dd9c3031c15d91f286811e438998b7303dda05c6ae1a","sha256:f741225e93f1012b1f68492b1a63ba507e17b22c656c647ff981e83627df23cf"],"state_sha256":"08d24a9460d86329bd3ba50cf24d39cb2e8de78a2421f0a8f1d8d13f40d91782"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPcGcupl1fwXZpl5NrMrVso8ECyaCmUvzNigd+4jjgPlz3ovFmloSygF3vuS49Y8bQm1FCqG46K9PuCFh9lXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:26:39.882682Z","bundle_sha256":"fcfc18a805357e93b0f3d50ca4e02cb79c44c2832b1b813df8557de4f79e3d6a"}}