{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GCNCHNUIBQQNZG23ZPWOHJT2OA","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":"3eb0cd049bf78ed0eca3fb406cb797062115cf4f3833cc9c23e97cb4387019ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T08:05:39Z","title_canon_sha256":"f06776fe7882db650c15c3b8bdbf79a16a5cd57a95cf9cbdf689f48c17315237"},"schema_version":"1.0","source":{"id":"1503.03205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03205","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03205v1","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03205","created_at":"2026-05-18T02:25:04Z"},{"alias_kind":"pith_short_12","alias_value":"GCNCHNUIBQQN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCNCHNUIBQQNZG23","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCNCHNUI","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:3a3b83cd3f4b538ada6ae94c50b98754197079bdb4752c84b164b9bb9f4bd92b","target":"graph","created_at":"2026-05-18T02:25:04Z","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":"In this paper, the extremal graph with the maximum RRD-value among all the graphs of order n with given cut vertices or edges is characterized. In addition, an upper bounds on the reciprocal degree distance in terms of the number of cut edges is provided.","authors_text":"Xiao-Xin Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T08:05:39Z","title":"On the reciprocal degree distance of graphs with cut vertices or edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03205","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:3802663768944e977d186bdb1b28fa72ed5447f1ab755607ff6a2787cf965429","target":"record","created_at":"2026-05-18T02:25:04Z","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":"3eb0cd049bf78ed0eca3fb406cb797062115cf4f3833cc9c23e97cb4387019ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T08:05:39Z","title_canon_sha256":"f06776fe7882db650c15c3b8bdbf79a16a5cd57a95cf9cbdf689f48c17315237"},"schema_version":"1.0","source":{"id":"1503.03205","kind":"arxiv","version":1}},"canonical_sha256":"309a23b6880c20dc9b5bcbece3a67a703a222e5679034ba689906e10940a0a3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"309a23b6880c20dc9b5bcbece3a67a703a222e5679034ba689906e10940a0a3b","first_computed_at":"2026-05-18T02:25:04.110623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:04.110623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UUFIj/0sRvYTS0YAfl/eu0tV9THz6viyRY7Z3bzwMX8JF9wXq4C5Yq6xL/857HiKq9WMho2lt8rGF76ARAmeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:04.110978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3802663768944e977d186bdb1b28fa72ed5447f1ab755607ff6a2787cf965429","sha256:3a3b83cd3f4b538ada6ae94c50b98754197079bdb4752c84b164b9bb9f4bd92b"],"state_sha256":"305088b4c0b665ecb6a83bf286eb75610c75f0154c8b291a45106fcd1d3facf7"}