{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HOSJYNEE43W5NTRMVYOO625PVX","short_pith_number":"pith:HOSJYNEE","schema_version":"1.0","canonical_sha256":"3ba49c3484e6edd6ce2cae1cef6bafaddbe4d90e802735f6d363e93db273bb6e","source":{"kind":"arxiv","id":"1606.01281","version":1},"attestation_state":"computed","paper":{"title":"Bicyclic graphs with extremal degree resistance distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia-Bao Liu, Sakander Hayat, Shaohui Wang, Si-Qi Zhangb, Xiang-Feng Pan","submitted_at":"2016-06-03T21:28:30Z","abstract_excerpt":"Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$ with a unit resistor. The degree resistance distance of a simple graph $G$ is defined as ${D_R}(G) = \\sum\\limits_{\\{u,v\\} \\subseteq V(G)} {[d(u) + d(v)]r(u,v)},$ where $d(u)$ is the degree of the vertex $u$. In this paper, the bicyclic graphs with extremal degree resistance distance are strong-minded. We first determine the $n$-vertex bicyclic graphs having pre"},"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":"1606.01281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T21:28:30Z","cross_cats_sorted":[],"title_canon_sha256":"1c55e65c9aef87bd0e1e3e8c79eecf28415a3e89547550e4d2f746b6aa21969f","abstract_canon_sha256":"d224d58e83ae7daa224a6812c4643ab4b88511bdaf3b706de10f4a6c60b94c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.462114Z","signature_b64":"ZWfb/+keekbjr47S/ukuOktsH2SPl31rg7GLhAJ2vKhMHwyAbBvnijMZt9hISLR90WtNx1CvCpCab8A+JvApDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba49c3484e6edd6ce2cae1cef6bafaddbe4d90e802735f6d363e93db273bb6e","last_reissued_at":"2026-05-18T01:12:54.461783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.461783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bicyclic graphs with extremal degree resistance distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia-Bao Liu, Sakander Hayat, Shaohui Wang, Si-Qi Zhangb, Xiang-Feng Pan","submitted_at":"2016-06-03T21:28:30Z","abstract_excerpt":"Let $r(u,v)$ be the resistance distance between two vertices $u, v$ of a simple graph $G$, which is the effective resistance between the vertices in the corresponding electrical network constructed from $G$ by replacing each edge of $G$ with a unit resistor. The degree resistance distance of a simple graph $G$ is defined as ${D_R}(G) = \\sum\\limits_{\\{u,v\\} \\subseteq V(G)} {[d(u) + d(v)]r(u,v)},$ where $d(u)$ is the degree of the vertex $u$. In this paper, the bicyclic graphs with extremal degree resistance distance are strong-minded. We first determine the $n$-vertex bicyclic graphs having pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01281","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":"1606.01281","created_at":"2026-05-18T01:12:54.461839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01281v1","created_at":"2026-05-18T01:12:54.461839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01281","created_at":"2026-05-18T01:12:54.461839+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOSJYNEE43W5","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOSJYNEE43W5NTRM","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOSJYNEE","created_at":"2026-05-18T12:30:19.053100+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/HOSJYNEE43W5NTRMVYOO625PVX","json":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX.json","graph_json":"https://pith.science/api/pith-number/HOSJYNEE43W5NTRMVYOO625PVX/graph.json","events_json":"https://pith.science/api/pith-number/HOSJYNEE43W5NTRMVYOO625PVX/events.json","paper":"https://pith.science/paper/HOSJYNEE"},"agent_actions":{"view_html":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX","download_json":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX.json","view_paper":"https://pith.science/paper/HOSJYNEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01281&json=true","fetch_graph":"https://pith.science/api/pith-number/HOSJYNEE43W5NTRMVYOO625PVX/graph.json","fetch_events":"https://pith.science/api/pith-number/HOSJYNEE43W5NTRMVYOO625PVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX/action/storage_attestation","attest_author":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX/action/author_attestation","sign_citation":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX/action/citation_signature","submit_replication":"https://pith.science/pith/HOSJYNEE43W5NTRMVYOO625PVX/action/replication_record"}},"created_at":"2026-05-18T01:12:54.461839+00:00","updated_at":"2026-05-18T01:12:54.461839+00:00"}