{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J6TYJMHX63TP62KOLHNVGTWG4Y","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":"839e6973a491772bd1252d86178711458e6fabb2fde8cbb13c1bb9c6749e6aea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-31T13:56:39Z","title_canon_sha256":"43e2a8102f19eef6701491f11d209e6db6ae0efb57c669709bef122722f92d2c"},"schema_version":"1.0","source":{"id":"1905.13621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13621","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13621v1","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13621","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"J6TYJMHX63TP","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"J6TYJMHX63TP62KO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"J6TYJMHX","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:713a086128a555b4e42dc604d7687f4f92d14b1f49a39db50d2bd29ef4bf08bf","target":"graph","created_at":"2026-05-17T23:44:34Z","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 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)$","authors_text":"Hamid Reza Maimani, Mina Rajabi-Parsa, Modjtaba Ghorbani, Shaghayegh Rahmani, Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-31T13:56:39Z","title":"Steiner (revised) Szeged index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13621","kind":"arxiv","version":1},"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:0c5481cc9b838340491c5f0528416450084d20f9543b4c7536005ce93a1dc454","target":"record","created_at":"2026-05-17T23:44:34Z","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":"839e6973a491772bd1252d86178711458e6fabb2fde8cbb13c1bb9c6749e6aea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-31T13:56:39Z","title_canon_sha256":"43e2a8102f19eef6701491f11d209e6db6ae0efb57c669709bef122722f92d2c"},"schema_version":"1.0","source":{"id":"1905.13621","kind":"arxiv","version":1}},"canonical_sha256":"4fa784b0f7f6e6ff694e59db534ec6e63cf1307b5f6f43850e1983e7fb6f64d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fa784b0f7f6e6ff694e59db534ec6e63cf1307b5f6f43850e1983e7fb6f64d9","first_computed_at":"2026-05-17T23:44:34.395252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:34.395252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OlRcgQGteols6gvkQJ3kNx8dE/rDKa9pu079UD4Gr4uAXcUr1HhanseX7X/uc8pLTKLMJaxDHa/7BgecmOXlBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:34.395753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c5481cc9b838340491c5f0528416450084d20f9543b4c7536005ce93a1dc454","sha256:713a086128a555b4e42dc604d7687f4f92d14b1f49a39db50d2bd29ef4bf08bf"],"state_sha256":"4bd2e5311cf900ba7913966a9ac2abef318ca9930a5b3425550a84d6f9d06d17"}