{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZXKNZUUGGVYQJCNURMIPPW7J2N","short_pith_number":"pith:ZXKNZUUG","schema_version":"1.0","canonical_sha256":"cdd4dcd28635710489b48b10f7dbe9d376858bdad15ba289964b7119bef94760","source":{"kind":"arxiv","id":"1805.06578","version":2},"attestation_state":"computed","paper":{"title":"Some useful lemmas on the edge Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shengjie He","submitted_at":"2018-05-17T02:09:05Z","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."},"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":"1805.06578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-17T02:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"d2b1ba52ee85dacf3aba2c2765247a6d5d6c3cb2e3358de9334693b57502f971","abstract_canon_sha256":"448e9f3647f5537500d4b53c4eb22aac4f62e0507f84468b625536d6b5445056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:13.572073Z","signature_b64":"lhOcaXNK1diK99RmWB9+RZjgkWETN0BCBLo9IiXtD9Rlr0Qw6NQ4pHaY67bnNbr0g4AsesJvER+UzTKjC55PCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd4dcd28635710489b48b10f7dbe9d376858bdad15ba289964b7119bef94760","last_reissued_at":"2026-05-18T00:14:13.571395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:13.571395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some useful lemmas on the edge Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shengjie He","submitted_at":"2018-05-17T02:09:05Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06578","kind":"arxiv","version":2},"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":"1805.06578","created_at":"2026-05-18T00:14:13.571486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06578v2","created_at":"2026-05-18T00:14:13.571486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06578","created_at":"2026-05-18T00:14:13.571486+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXKNZUUGGVYQ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXKNZUUGGVYQJCNU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXKNZUUG","created_at":"2026-05-18T12:33:07.085635+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/ZXKNZUUGGVYQJCNURMIPPW7J2N","json":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N.json","graph_json":"https://pith.science/api/pith-number/ZXKNZUUGGVYQJCNURMIPPW7J2N/graph.json","events_json":"https://pith.science/api/pith-number/ZXKNZUUGGVYQJCNURMIPPW7J2N/events.json","paper":"https://pith.science/paper/ZXKNZUUG"},"agent_actions":{"view_html":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N","download_json":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N.json","view_paper":"https://pith.science/paper/ZXKNZUUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06578&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXKNZUUGGVYQJCNURMIPPW7J2N/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXKNZUUGGVYQJCNURMIPPW7J2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N/action/storage_attestation","attest_author":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N/action/author_attestation","sign_citation":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N/action/citation_signature","submit_replication":"https://pith.science/pith/ZXKNZUUGGVYQJCNURMIPPW7J2N/action/replication_record"}},"created_at":"2026-05-18T00:14:13.571486+00:00","updated_at":"2026-05-18T00:14:13.571486+00:00"}