{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4W4TMBVQ5FDX66Y7STI2PLDRKO","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":"e8dbfce54ce10f6f6ef69e7f56ad68ad81c3e67908c61bee215998d506a625a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T07:46:52Z","title_canon_sha256":"319dccbb130c3e7468467bd46c27b0fd6a89b0bedb2a4ba4e861975b604656fe"},"schema_version":"1.0","source":{"id":"1210.5043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5043","created_at":"2026-05-18T03:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5043v1","created_at":"2026-05-18T03:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5043","created_at":"2026-05-18T03:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"4W4TMBVQ5FDX","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4W4TMBVQ5FDX66Y7","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4W4TMBVQ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:35e5e70a185e5c54091d54451b82f1ca7dca0d66997f25a9b7ed66ba17ae5e6a","target":"graph","created_at":"2026-05-18T03:42: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":"We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we deduce the n-vertex unicyclic graphs with the first two maximum sum-connectivity indices for $n\\ge 4$.","authors_text":"Bo Zhou, Nenad Trinajstic, Zhibin Du","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T07:46:52Z","title":"Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5043","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:0fa3bc28dd44b83d928c345bff399efd7de8ff7cd5385b7904534ed2af13e93a","target":"record","created_at":"2026-05-18T03:42: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":"e8dbfce54ce10f6f6ef69e7f56ad68ad81c3e67908c61bee215998d506a625a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-18T07:46:52Z","title_canon_sha256":"319dccbb130c3e7468467bd46c27b0fd6a89b0bedb2a4ba4e861975b604656fe"},"schema_version":"1.0","source":{"id":"1210.5043","kind":"arxiv","version":1}},"canonical_sha256":"e5b93606b0e9477f7b1f94d1a7ac7153b8ec6eae87dd4c7323ae124749d529d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5b93606b0e9477f7b1f94d1a7ac7153b8ec6eae87dd4c7323ae124749d529d8","first_computed_at":"2026-05-18T03:42:54.451187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:54.451187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rAdSRSHy8Rzfe/zI/vbpPzwS3qmmDN3nlVql3L+OAN9E5QcLm6ylSc9aiszK38BcW4mI4LjuHsUi15Sx1OLhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:54.451715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa3bc28dd44b83d928c345bff399efd7de8ff7cd5385b7904534ed2af13e93a","sha256:35e5e70a185e5c54091d54451b82f1ca7dca0d66997f25a9b7ed66ba17ae5e6a"],"state_sha256":"80e969f6fc27e08d7e819ec3c4d27e9695b4c5aa3188f42c1b92a68d0a974a50"}