{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GCNCHNUIBQQNZG23ZPWOHJT2OA","short_pith_number":"pith:GCNCHNUI","schema_version":"1.0","canonical_sha256":"309a23b6880c20dc9b5bcbece3a67a703a222e5679034ba689906e10940a0a3b","source":{"kind":"arxiv","id":"1503.03205","version":1},"attestation_state":"computed","paper":{"title":"On the reciprocal degree distance of graphs with cut vertices or edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Xin Li","submitted_at":"2015-03-11T08:05:39Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.03205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-11T08:05:39Z","cross_cats_sorted":[],"title_canon_sha256":"f06776fe7882db650c15c3b8bdbf79a16a5cd57a95cf9cbdf689f48c17315237","abstract_canon_sha256":"3eb0cd049bf78ed0eca3fb406cb797062115cf4f3833cc9c23e97cb4387019ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.110978Z","signature_b64":"UUFIj/0sRvYTS0YAfl/eu0tV9THz6viyRY7Z3bzwMX8JF9wXq4C5Yq6xL/857HiKq9WMho2lt8rGF76ARAmeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309a23b6880c20dc9b5bcbece3a67a703a222e5679034ba689906e10940a0a3b","last_reissued_at":"2026-05-18T02:25:04.110623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.110623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the reciprocal degree distance of graphs with cut vertices or edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Xin Li","submitted_at":"2015-03-11T08:05:39Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03205","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.03205","created_at":"2026-05-18T02:25:04.110684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03205v1","created_at":"2026-05-18T02:25:04.110684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03205","created_at":"2026-05-18T02:25:04.110684+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCNCHNUIBQQN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCNCHNUIBQQNZG23","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCNCHNUI","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA","json":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA.json","graph_json":"https://pith.science/api/pith-number/GCNCHNUIBQQNZG23ZPWOHJT2OA/graph.json","events_json":"https://pith.science/api/pith-number/GCNCHNUIBQQNZG23ZPWOHJT2OA/events.json","paper":"https://pith.science/paper/GCNCHNUI"},"agent_actions":{"view_html":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA","download_json":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA.json","view_paper":"https://pith.science/paper/GCNCHNUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03205&json=true","fetch_graph":"https://pith.science/api/pith-number/GCNCHNUIBQQNZG23ZPWOHJT2OA/graph.json","fetch_events":"https://pith.science/api/pith-number/GCNCHNUIBQQNZG23ZPWOHJT2OA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA/action/storage_attestation","attest_author":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA/action/author_attestation","sign_citation":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA/action/citation_signature","submit_replication":"https://pith.science/pith/GCNCHNUIBQQNZG23ZPWOHJT2OA/action/replication_record"}},"created_at":"2026-05-18T02:25:04.110684+00:00","updated_at":"2026-05-18T02:25:04.110684+00:00"}