{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HOSJYNEE43W5NTRMVYOO625PVX","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":"d224d58e83ae7daa224a6812c4643ab4b88511bdaf3b706de10f4a6c60b94c94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T21:28:30Z","title_canon_sha256":"1c55e65c9aef87bd0e1e3e8c79eecf28415a3e89547550e4d2f746b6aa21969f"},"schema_version":"1.0","source":{"id":"1606.01281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01281","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01281v1","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01281","created_at":"2026-05-18T01:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"HOSJYNEE43W5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HOSJYNEE43W5NTRM","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HOSJYNEE","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:1d73b8c2830baa8ab075eaa106fca1655c3abf12bbd6bcccf0b96dd191bc6fc6","target":"graph","created_at":"2026-05-18T01:12: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":"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","authors_text":"Jia-Bao Liu, Sakander Hayat, Shaohui Wang, Si-Qi Zhangb, Xiang-Feng Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T21:28:30Z","title":"Bicyclic graphs with extremal degree resistance distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01281","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:f205f52bb7d77ea3359ba84bb8fa22a7232620844ae117867d819ffd6065c229","target":"record","created_at":"2026-05-18T01:12: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":"d224d58e83ae7daa224a6812c4643ab4b88511bdaf3b706de10f4a6c60b94c94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-03T21:28:30Z","title_canon_sha256":"1c55e65c9aef87bd0e1e3e8c79eecf28415a3e89547550e4d2f746b6aa21969f"},"schema_version":"1.0","source":{"id":"1606.01281","kind":"arxiv","version":1}},"canonical_sha256":"3ba49c3484e6edd6ce2cae1cef6bafaddbe4d90e802735f6d363e93db273bb6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ba49c3484e6edd6ce2cae1cef6bafaddbe4d90e802735f6d363e93db273bb6e","first_computed_at":"2026-05-18T01:12:54.461783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:54.461783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZWfb/+keekbjr47S/ukuOktsH2SPl31rg7GLhAJ2vKhMHwyAbBvnijMZt9hISLR90WtNx1CvCpCab8A+JvApDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:54.462114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f205f52bb7d77ea3359ba84bb8fa22a7232620844ae117867d819ffd6065c229","sha256:1d73b8c2830baa8ab075eaa106fca1655c3abf12bbd6bcccf0b96dd191bc6fc6"],"state_sha256":"1288497d14f13baabff3c7dd8cabf5401728d5ff39d662a9ec5fbd33c429782d"}