{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XAVE3VUBI3ZTOEZFIW2YZK2V73","short_pith_number":"pith:XAVE3VUB","schema_version":"1.0","canonical_sha256":"b82a4dd68146f337132545b58cab55feec45f96036c71791a05b0e854b128e04","source":{"kind":"arxiv","id":"1307.0192","version":1},"attestation_state":"computed","paper":{"title":"Tricyclic graphs with maximal revised Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Chen, Mengmeng Liu, Xueliang Li","submitted_at":"2013-06-30T10:02:29Z","abstract_excerpt":"The revised Szeged index of a graph $G$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. In this paper, we give an upper bound of the revised Szeged index for a connected tricyclic graph, and also characterize those graphs that achieve the upper bound."},"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":"1307.0192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-30T10:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"dfa0e7ab65bb53b6664088ab2426ca437ef2443e7dac4511cca0c444a67a2b1f","abstract_canon_sha256":"e4f8ec8e699b25e549384685757edb790b63508483cba270bf4ac87ed3adb206"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.020772Z","signature_b64":"FmvhnivZBqF1WBysXwPpJF6qvRONfsgF13p+t26MfoF2JWsTrWWZQJ8Rm6cxp93L4Sy6IzF3vqgKLNql/50EAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b82a4dd68146f337132545b58cab55feec45f96036c71791a05b0e854b128e04","last_reissued_at":"2026-05-18T03:19:34.020249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.020249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tricyclic graphs with maximal revised Szeged index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lily Chen, Mengmeng Liu, Xueliang Li","submitted_at":"2013-06-30T10:02:29Z","abstract_excerpt":"The revised Szeged index of a graph $G$ is defined as $Sz^*(G)=\\sum_{e=uv \\in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$, and $n_0(e)$ is the number of vertices equidistant to $u$ and $v$. In this paper, we give an upper bound of the revised Szeged index for a connected tricyclic graph, and also characterize those graphs that achieve the upper bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0192","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":"1307.0192","created_at":"2026-05-18T03:19:34.020335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.0192v1","created_at":"2026-05-18T03:19:34.020335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0192","created_at":"2026-05-18T03:19:34.020335+00:00"},{"alias_kind":"pith_short_12","alias_value":"XAVE3VUBI3ZT","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XAVE3VUBI3ZTOEZF","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XAVE3VUB","created_at":"2026-05-18T12:28:06.772260+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/XAVE3VUBI3ZTOEZFIW2YZK2V73","json":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73.json","graph_json":"https://pith.science/api/pith-number/XAVE3VUBI3ZTOEZFIW2YZK2V73/graph.json","events_json":"https://pith.science/api/pith-number/XAVE3VUBI3ZTOEZFIW2YZK2V73/events.json","paper":"https://pith.science/paper/XAVE3VUB"},"agent_actions":{"view_html":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73","download_json":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73.json","view_paper":"https://pith.science/paper/XAVE3VUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.0192&json=true","fetch_graph":"https://pith.science/api/pith-number/XAVE3VUBI3ZTOEZFIW2YZK2V73/graph.json","fetch_events":"https://pith.science/api/pith-number/XAVE3VUBI3ZTOEZFIW2YZK2V73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73/action/storage_attestation","attest_author":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73/action/author_attestation","sign_citation":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73/action/citation_signature","submit_replication":"https://pith.science/pith/XAVE3VUBI3ZTOEZFIW2YZK2V73/action/replication_record"}},"created_at":"2026-05-18T03:19:34.020335+00:00","updated_at":"2026-05-18T03:19:34.020335+00:00"}