{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AGHOER5F62JMJXQZKC66D5JP4T","short_pith_number":"pith:AGHOER5F","schema_version":"1.0","canonical_sha256":"018ee247a5f692c4de1950bde1f52fe4e0dcaa315f0c0c361d8abc2040859d76","source":{"kind":"arxiv","id":"1711.02394","version":1},"attestation_state":"computed","paper":{"title":"On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aimei Yu, Rong-Xia Hao, Shengjie He","submitted_at":"2017-11-07T11:07:01Z","abstract_excerpt":"The edge Szeged index and edge-vertex Szeged index of a graph are defined as $Sz_{e}(G)=\\sum\\limits_{uv\\in E(G)}m_{u}(uv|G)m_{v}(uv|G)$ and $Sz_{ev}(G)=\\frac{1}{2} \\sum\\limits_{uv \\in E(G)}[n_{u}(uv|G)m_{v}(uv|G)+n_{v}(uv|G)m_{u}(uv|G)],$ respectively, 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$), and $n_{u}(uv|G)$ (resp., $n_{v}(uv|G)$) is the number of vertices whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), respectively. A "},"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":"1711.02394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-07T11:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"1c46fa9fce134b0fa4828a4028a69934e1a9a631296ebcca5ce0693b9597eccd","abstract_canon_sha256":"57ee7f39909e4c0e2efaf3b96163ccef1c97555c55090955944141726e44a795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:08.010886Z","signature_b64":"txDJxvKnwoGJdhOxqftHGK6LExahavllnCayKjkPnh6fuY3XhYOIME1PG3tlGQrexN99PBgvdXnHx9RvUv+kAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"018ee247a5f692c4de1950bde1f52fe4e0dcaa315f0c0c361d8abc2040859d76","last_reissued_at":"2026-05-18T00:31:08.010274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:08.010274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aimei Yu, Rong-Xia Hao, Shengjie He","submitted_at":"2017-11-07T11:07:01Z","abstract_excerpt":"The edge Szeged index and edge-vertex Szeged index of a graph are defined as $Sz_{e}(G)=\\sum\\limits_{uv\\in E(G)}m_{u}(uv|G)m_{v}(uv|G)$ and $Sz_{ev}(G)=\\frac{1}{2} \\sum\\limits_{uv \\in E(G)}[n_{u}(uv|G)m_{v}(uv|G)+n_{v}(uv|G)m_{u}(uv|G)],$ respectively, 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$), and $n_{u}(uv|G)$ (resp., $n_{v}(uv|G)$) is the number of vertices whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), respectively. A "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02394","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":"1711.02394","created_at":"2026-05-18T00:31:08.010394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02394v1","created_at":"2026-05-18T00:31:08.010394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02394","created_at":"2026-05-18T00:31:08.010394+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGHOER5F62JM","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGHOER5F62JMJXQZ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGHOER5F","created_at":"2026-05-18T12:31:05.417338+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/AGHOER5F62JMJXQZKC66D5JP4T","json":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T.json","graph_json":"https://pith.science/api/pith-number/AGHOER5F62JMJXQZKC66D5JP4T/graph.json","events_json":"https://pith.science/api/pith-number/AGHOER5F62JMJXQZKC66D5JP4T/events.json","paper":"https://pith.science/paper/AGHOER5F"},"agent_actions":{"view_html":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T","download_json":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T.json","view_paper":"https://pith.science/paper/AGHOER5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02394&json=true","fetch_graph":"https://pith.science/api/pith-number/AGHOER5F62JMJXQZKC66D5JP4T/graph.json","fetch_events":"https://pith.science/api/pith-number/AGHOER5F62JMJXQZKC66D5JP4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T/action/storage_attestation","attest_author":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T/action/author_attestation","sign_citation":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T/action/citation_signature","submit_replication":"https://pith.science/pith/AGHOER5F62JMJXQZKC66D5JP4T/action/replication_record"}},"created_at":"2026-05-18T00:31:08.010394+00:00","updated_at":"2026-05-18T00:31:08.010394+00:00"}