{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ELDYJVHBTIY7U75CE3IVGZUFCU","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":"2d30f81b15369b94c8936bc59e74b1a56fcd7a4dd2d8e89fe73a8c7148e1633a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-17T01:32:02Z","title_canon_sha256":"0c8e50be176ecfe872875336683517e4e52863bbb9f88bed376249507b051ccd"},"schema_version":"1.0","source":{"id":"1804.06009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06009","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06009v1","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06009","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"ELDYJVHBTIY7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ELDYJVHBTIY7U75C","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ELDYJVHB","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:20814c35c8951790ff3cb13f463bf088cc39ea006ec4bb7ce95a69214f3829bc","target":"graph","created_at":"2026-05-18T00:18:22Z","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 $G$ be a connected graph. The edge revised Szeged index of $G$ is defined as $Sz^{\\ast}_{e}(G)=\\sum\\limits_{e=uv\\in E(G)}(m_{u}(e|G)+\\frac{m_{0}(e|G)}{2})(m_{v}(e|G)+\\frac{m_{0}(e|G)}{2})$, where $m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), and $m_{0}(e|G)$ is the number of edges equidistant from both ends of $e$. In this paper, we give the minimal and the second minimal edge revised Szeged index of cacti with order $n$ and $k$ cycles, and all the graphs that achieve the minimal ","authors_text":"Deming Li, Rong-Xia Hao, Shengjie He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-17T01:32:02Z","title":"On extremal cacti with respect to the edge revised Szeged index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06009","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:e938f8e483b1c22c09f529939bd66789c161d417a5534abfb6159fb2ebb1de6a","target":"record","created_at":"2026-05-18T00:18:22Z","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":"2d30f81b15369b94c8936bc59e74b1a56fcd7a4dd2d8e89fe73a8c7148e1633a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-17T01:32:02Z","title_canon_sha256":"0c8e50be176ecfe872875336683517e4e52863bbb9f88bed376249507b051ccd"},"schema_version":"1.0","source":{"id":"1804.06009","kind":"arxiv","version":1}},"canonical_sha256":"22c784d4e19a31fa7fa226d15366851534a7034804295756b649f240574a2b28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22c784d4e19a31fa7fa226d15366851534a7034804295756b649f240574a2b28","first_computed_at":"2026-05-18T00:18:22.055728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:22.055728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZGkr73gDS/sn82JyfcuFGaIyMjf6kqzTCAJqaVHxYse6+m1oATckgJXd/B8DrzZ+29dYLTVtM0l8TyX+1uibBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:22.056374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e938f8e483b1c22c09f529939bd66789c161d417a5534abfb6159fb2ebb1de6a","sha256:20814c35c8951790ff3cb13f463bf088cc39ea006ec4bb7ce95a69214f3829bc"],"state_sha256":"e62dcf1b60ba7639ddb4f50935da3097cbe24b1835992aff9ab6736dd17b4b12"}