{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4A76XAPUISHHGC75XRGMYN27OT","short_pith_number":"pith:4A76XAPU","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"},"canonical_sha256":"e03feb81f4448e730bfdbc4ccc375f74d3ecee5c1565bc5197333b2d982fdfca","source":{"kind":"arxiv","id":"1809.10767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10767","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10767v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10767","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"4A76XAPUISHH","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4A76XAPUISHHGC75","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4A76XAPU","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4A76XAPUISHHGC75XRGMYN27OT","target":"record","payload":{"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"},"canonical_sha256":"e03feb81f4448e730bfdbc4ccc375f74d3ecee5c1565bc5197333b2d982fdfca","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"},"source_kind":"arxiv","source_id":"1809.10767","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyhefV5neF/7hTDhgigzlG4wH+7ck3B7K4K2FJ1z+sYhmU+UC8nD4XLQTn/7QQtsI6jK1okyL9itGI3Wo0DJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:42:58.268455Z"},"content_sha256":"fdf45c1bdd6bed553c0140a25e01245d82a786b85982c074bde567a85a71a0a5","schema_version":"1.0","event_id":"sha256:fdf45c1bdd6bed553c0140a25e01245d82a786b85982c074bde567a85a71a0a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4A76XAPUISHHGC75XRGMYN27OT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:04:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNnl8kkrVuDyoq9Dx97L3uD95ZfqeqaZUZ3m3+u1pzDY18SkV7Qpe+l1ZrOMc/gSY5c87h2qM7zLyF8QmURhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:42:58.268803Z"},"content_sha256":"fa1ae3b527e36094a03f2a2257ef79c13e49d2804ae34fed985accd051b42581","schema_version":"1.0","event_id":"sha256:fa1ae3b527e36094a03f2a2257ef79c13e49d2804ae34fed985accd051b42581"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/bundle.json","state_url":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4A76XAPUISHHGC75XRGMYN27OT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T22:42:58Z","links":{"resolver":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT","bundle":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/bundle.json","state":"https://pith.science/pith/4A76XAPUISHHGC75XRGMYN27OT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4A76XAPUISHHGC75XRGMYN27OT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4A76XAPUISHHGC75XRGMYN27OT","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":"1378b0c70d780d21306f130ec5efb8975559924e7a924366b288914c14e3b917","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T21:05:44Z","title_canon_sha256":"fdb52805a05c98ca9ef1430eb8ab4b1638af68b1f5971a8cd3ddd1cdf1ec7939"},"schema_version":"1.0","source":{"id":"1809.10767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10767","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10767v1","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10767","created_at":"2026-05-18T00:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"4A76XAPUISHH","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4A76XAPUISHHGC75","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4A76XAPU","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:fa1ae3b527e36094a03f2a2257ef79c13e49d2804ae34fed985accd051b42581","target":"graph","created_at":"2026-05-18T00:04:35Z","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":"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","authors_text":"Ambat Vijayakumar, Matja\\v{z} Kov\\v{s}e, Rasila V A","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T21:05:44Z","title":"Wiener index and Steiner 3-Wiener index of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10767","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:fdf45c1bdd6bed553c0140a25e01245d82a786b85982c074bde567a85a71a0a5","target":"record","created_at":"2026-05-18T00:04:35Z","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":"1378b0c70d780d21306f130ec5efb8975559924e7a924366b288914c14e3b917","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T21:05:44Z","title_canon_sha256":"fdb52805a05c98ca9ef1430eb8ab4b1638af68b1f5971a8cd3ddd1cdf1ec7939"},"schema_version":"1.0","source":{"id":"1809.10767","kind":"arxiv","version":1}},"canonical_sha256":"e03feb81f4448e730bfdbc4ccc375f74d3ecee5c1565bc5197333b2d982fdfca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e03feb81f4448e730bfdbc4ccc375f74d3ecee5c1565bc5197333b2d982fdfca","first_computed_at":"2026-05-18T00:04:35.148927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:35.148927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+X1ioCHayPMq3J8xK9HSe4BPSFbeY5UmOdE7D4t7Lf1wbyA4IrEuOmQ75ycz9i4uydGfKgXs41Cd9m0f/BxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:35.149394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdf45c1bdd6bed553c0140a25e01245d82a786b85982c074bde567a85a71a0a5","sha256:fa1ae3b527e36094a03f2a2257ef79c13e49d2804ae34fed985accd051b42581"],"state_sha256":"4337da5ca3e0f2bf2d890f4b9ea61bc725b8d25f5b69d5573c5880d7e1e2717a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMs8Qv/VZxU4D+IsiMEvPKBi1ftrrnd9XX20TCD57oG2KMna61AV/GS0n1wBx5DCM2pnpE9mOrE5mpK1Y5J9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:42:58.270803Z","bundle_sha256":"091b6f59501cf8b3b6d3fd58aefea1c46f91044bda4980d852c105db9c525ee6"}}