{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZXKNZUUGGVYQJCNURMIPPW7J2N","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":"448e9f3647f5537500d4b53c4eb22aac4f62e0507f84468b625536d6b5445056","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T02:09:05Z","title_canon_sha256":"d2b1ba52ee85dacf3aba2c2765247a6d5d6c3cb2e3358de9334693b57502f971"},"schema_version":"1.0","source":{"id":"1805.06578","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06578","created_at":"2026-05-18T00:14:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06578v2","created_at":"2026-05-18T00:14:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06578","created_at":"2026-05-18T00:14:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZXKNZUUGGVYQ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZXKNZUUGGVYQJCNU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZXKNZUUG","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f7e380a79a2edd39db16614f9cee7c48a014386071ccc4766f0c6ccad924100b","target":"graph","created_at":"2026-05-18T00:14:13Z","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":"The edge Szeged index of a graph $G$ is defined as $Sz_{e}(G)=\\sum\\limits_{uv\\in E(G)}m_{u}(uv|G)m_{v}(uv|G)$, where $m_{u}(uv|G)$ (resp., $m_{v}(uv|G)$) is the number of edges whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), respectively. In this paper, we characterize the graph with minimum edge Szeged index among all the unicyclic graphs with given order and diameter.","authors_text":"Shengjie He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T02:09:05Z","title":"Some useful lemmas on the edge Szeged index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06578","kind":"arxiv","version":2},"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:dce4db981abfe64b44251724abea3116437c4eab914a18d31407a8660ffdb299","target":"record","created_at":"2026-05-18T00:14:13Z","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":"448e9f3647f5537500d4b53c4eb22aac4f62e0507f84468b625536d6b5445056","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T02:09:05Z","title_canon_sha256":"d2b1ba52ee85dacf3aba2c2765247a6d5d6c3cb2e3358de9334693b57502f971"},"schema_version":"1.0","source":{"id":"1805.06578","kind":"arxiv","version":2}},"canonical_sha256":"cdd4dcd28635710489b48b10f7dbe9d376858bdad15ba289964b7119bef94760","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdd4dcd28635710489b48b10f7dbe9d376858bdad15ba289964b7119bef94760","first_computed_at":"2026-05-18T00:14:13.571395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:13.571395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lhOcaXNK1diK99RmWB9+RZjgkWETN0BCBLo9IiXtD9Rlr0Qw6NQ4pHaY67bnNbr0g4AsesJvER+UzTKjC55PCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:13.572073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06578","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dce4db981abfe64b44251724abea3116437c4eab914a18d31407a8660ffdb299","sha256:f7e380a79a2edd39db16614f9cee7c48a014386071ccc4766f0c6ccad924100b"],"state_sha256":"41927faac95ecc94facecdca8c2bb3a7d9aeefd1bd59a035df3069e113df1883"}