{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:J6TYJMHX63TP62KOLHNVGTWG4Y","short_pith_number":"pith:J6TYJMHX","schema_version":"1.0","canonical_sha256":"4fa784b0f7f6e6ff694e59db534ec6e63cf1307b5f6f43850e1983e7fb6f64d9","source":{"kind":"arxiv","id":"1905.13621","version":1},"attestation_state":"computed","paper":{"title":"Steiner (revised) Szeged index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamid Reza Maimani, Mina Rajabi-Parsa, Modjtaba Ghorbani, Shaghayegh Rahmani, Xueliang Li, Yaping Mao","submitted_at":"2019-05-31T13:56:39Z","abstract_excerpt":"The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least 2 and $S\\subseteq V(G)$, the Steiner distance $d_G(S)$ of the set $S$ of vertices in $G$ is the minimum size of a connected subgraph whose vertex set contains or connects $S$. In this paper, we introduce the concept of the Steiner (revised) Szeged index ($rSz_k(G)$) $Sz_k(G)$ of a graph $G$, which is a natural generalization of the well-known (revised) Szeged index of chemical use. We determine the $Sz_k(G)$"},"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":"1905.13621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-31T13:56:39Z","cross_cats_sorted":[],"title_canon_sha256":"43e2a8102f19eef6701491f11d209e6db6ae0efb57c669709bef122722f92d2c","abstract_canon_sha256":"839e6973a491772bd1252d86178711458e6fabb2fde8cbb13c1bb9c6749e6aea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:34.395753Z","signature_b64":"OlRcgQGteols6gvkQJ3kNx8dE/rDKa9pu079UD4Gr4uAXcUr1HhanseX7X/uc8pLTKLMJaxDHa/7BgecmOXlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fa784b0f7f6e6ff694e59db534ec6e63cf1307b5f6f43850e1983e7fb6f64d9","last_reissued_at":"2026-05-17T23:44:34.395252Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:34.395252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Steiner (revised) Szeged index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hamid Reza Maimani, Mina Rajabi-Parsa, Modjtaba Ghorbani, Shaghayegh Rahmani, Xueliang Li, Yaping Mao","submitted_at":"2019-05-31T13:56:39Z","abstract_excerpt":"The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least 2 and $S\\subseteq V(G)$, the Steiner distance $d_G(S)$ of the set $S$ of vertices in $G$ is the minimum size of a connected subgraph whose vertex set contains or connects $S$. In this paper, we introduce the concept of the Steiner (revised) Szeged index ($rSz_k(G)$) $Sz_k(G)$ of a graph $G$, which is a natural generalization of the well-known (revised) Szeged index of chemical use. We determine the $Sz_k(G)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13621","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":"1905.13621","created_at":"2026-05-17T23:44:34.395327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13621v1","created_at":"2026-05-17T23:44:34.395327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13621","created_at":"2026-05-17T23:44:34.395327+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6TYJMHX63TP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6TYJMHX63TP62KO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6TYJMHX","created_at":"2026-05-18T12:33:18.533446+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/J6TYJMHX63TP62KOLHNVGTWG4Y","json":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y.json","graph_json":"https://pith.science/api/pith-number/J6TYJMHX63TP62KOLHNVGTWG4Y/graph.json","events_json":"https://pith.science/api/pith-number/J6TYJMHX63TP62KOLHNVGTWG4Y/events.json","paper":"https://pith.science/paper/J6TYJMHX"},"agent_actions":{"view_html":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y","download_json":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y.json","view_paper":"https://pith.science/paper/J6TYJMHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13621&json=true","fetch_graph":"https://pith.science/api/pith-number/J6TYJMHX63TP62KOLHNVGTWG4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/J6TYJMHX63TP62KOLHNVGTWG4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y/action/storage_attestation","attest_author":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y/action/author_attestation","sign_citation":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y/action/citation_signature","submit_replication":"https://pith.science/pith/J6TYJMHX63TP62KOLHNVGTWG4Y/action/replication_record"}},"created_at":"2026-05-17T23:44:34.395327+00:00","updated_at":"2026-05-17T23:44:34.395327+00:00"}