{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4A76XAPUISHHGC75XRGMYN27OT","short_pith_number":"pith:4A76XAPU","schema_version":"1.0","canonical_sha256":"e03feb81f4448e730bfdbc4ccc375f74d3ecee5c1565bc5197333b2d982fdfca","source":{"kind":"arxiv","id":"1809.10767","version":1},"attestation_state":"computed","paper":{"title":"Wiener index and Steiner 3-Wiener index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ambat Vijayakumar, Matja\\v{z} Kov\\v{s}e, Rasila V A","submitted_at":"2018-09-27T21:05:44Z","abstract_excerpt":"Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the Steiner $k$-Wiener index, hence for $k=2$ we get the Wiener index. The modular graphs are graphs in which every three vertices $x, y$ and $z$ have at least one median vertex $m(x,y,z)$ that belongs to shortest paths between each pair of $x, y$ and $z$. The Steiner 3-Wiener index of a modular graph is expressed in terms of its Wiener index. As a corollary formul"},"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":"1809.10767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T21:05:44Z","cross_cats_sorted":[],"title_canon_sha256":"fdb52805a05c98ca9ef1430eb8ab4b1638af68b1f5971a8cd3ddd1cdf1ec7939","abstract_canon_sha256":"1378b0c70d780d21306f130ec5efb8975559924e7a924366b288914c14e3b917"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:35.149394Z","signature_b64":"E+X1ioCHayPMq3J8xK9HSe4BPSFbeY5UmOdE7D4t7Lf1wbyA4IrEuOmQ75ycz9i4uydGfKgXs41Cd9m0f/BxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e03feb81f4448e730bfdbc4ccc375f74d3ecee5c1565bc5197333b2d982fdfca","last_reissued_at":"2026-05-18T00:04:35.148927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:35.148927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wiener index and Steiner 3-Wiener index of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ambat Vijayakumar, Matja\\v{z} Kov\\v{s}e, Rasila V A","submitted_at":"2018-09-27T21:05:44Z","abstract_excerpt":"Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the Steiner $k$-Wiener index, hence for $k=2$ we get the Wiener index. The modular graphs are graphs in which every three vertices $x, y$ and $z$ have at least one median vertex $m(x,y,z)$ that belongs to shortest paths between each pair of $x, y$ and $z$. The Steiner 3-Wiener index of a modular graph is expressed in terms of its Wiener index. As a corollary formul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10767","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":"1809.10767","created_at":"2026-05-18T00:04:35.149006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10767v1","created_at":"2026-05-18T00:04:35.149006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10767","created_at":"2026-05-18T00:04:35.149006+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A76XAPUISHH","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A76XAPUISHHGC75","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A76XAPU","created_at":"2026-05-18T12:32:05.422762+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/4A76XAPUISHHGC75XRGMYN27OT","json":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT.json","graph_json":"https://pith.science/api/pith-number/4A76XAPUISHHGC75XRGMYN27OT/graph.json","events_json":"https://pith.science/api/pith-number/4A76XAPUISHHGC75XRGMYN27OT/events.json","paper":"https://pith.science/paper/4A76XAPU"},"agent_actions":{"view_html":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT","download_json":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT.json","view_paper":"https://pith.science/paper/4A76XAPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10767&json=true","fetch_graph":"https://pith.science/api/pith-number/4A76XAPUISHHGC75XRGMYN27OT/graph.json","fetch_events":"https://pith.science/api/pith-number/4A76XAPUISHHGC75XRGMYN27OT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/action/storage_attestation","attest_author":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/action/author_attestation","sign_citation":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/action/citation_signature","submit_replication":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/action/replication_record"}},"created_at":"2026-05-18T00:04:35.149006+00:00","updated_at":"2026-05-18T00:04:35.149006+00:00"}