{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RZ74E4VQ43CWLS253YXK7FWUNZ","short_pith_number":"pith:RZ74E4VQ","canonical_record":{"source":{"id":"1512.01104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-03T15:09:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1cd254932d6894989c3a8e359b8a80f01538dab2a247ade9c6ad05d86d67e7e8","abstract_canon_sha256":"233be5227bd395f98fb2e0e375a1f620cd056baa39bc74e9ee68ffabd15b9842"},"schema_version":"1.0"},"canonical_sha256":"8e7fc272b0e6c565cb5dde2eaf96d46e67f3720cf6b461bf36ed6fb00a9b2d27","source":{"kind":"arxiv","id":"1512.01104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01104","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01104v2","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01104","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"RZ74E4VQ43CW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RZ74E4VQ43CWLS25","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RZ74E4VQ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RZ74E4VQ43CWLS253YXK7FWUNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-03T15:09:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1cd254932d6894989c3a8e359b8a80f01538dab2a247ade9c6ad05d86d67e7e8","abstract_canon_sha256":"233be5227bd395f98fb2e0e375a1f620cd056baa39bc74e9ee68ffabd15b9842"},"schema_version":"1.0"},"canonical_sha256":"8e7fc272b0e6c565cb5dde2eaf96d46e67f3720cf6b461bf36ed6fb00a9b2d27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:44.349959Z","signature_b64":"u03P653HU98hWoSjjiVYHGY4RlRFZaG2oNTKjtQOIhzW7ipY0l5O4tV6lPRPSC9qme7uVZxts2nBSqeBHVaRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7fc272b0e6c565cb5dde2eaf96d46e67f3720cf6b461bf36ed6fb00a9b2d27","last_reissued_at":"2026-05-18T01:21:44.349350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:44.349350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01104","source_version":2,"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-18T01:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKRIOk2/FNX1xlRJ6VlIzBfM2CaWjUrntIx23AwLyyqc8cQn5Fduxx01hzcm0n7z4n9tJGKuEipzuaGmsItdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T01:42:57.274292Z"},"content_sha256":"192014f93d99d3c7a43d88a4e84a57a17c0fa3ee63b5e4c2e71d15ee32496f60","schema_version":"1.0","event_id":"sha256:192014f93d99d3c7a43d88a4e84a57a17c0fa3ee63b5e4c2e71d15ee32496f60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RZ74E4VQ43CWLS253YXK7FWUNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Medianwidth of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Konstantinos Stavropoulos","submitted_at":"2015-12-03T15:09:17Z","abstract_excerpt":"A median graph is a connected graph, such that for any three vertices $u,v,w$ there is exactly one vertex $x$ that lies simultaneously on a shortest $(u,v)$-path, a shortest $(v,w)$-path and a shortest $(w,u)$-path. Examples of median graphs are trees and hypercubes.\n  We introduce and study a generalisation of tree decompositions, to be called median decompositions, where instead of decomposing a graph $G$ in a treelike fashion, we use general median graphs as the underlying graph of the decomposition. We show that the corresponding width parameter $\\text{mw}(G)$, the medianwidth of $G$, is e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01104","kind":"arxiv","version":2},"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-18T01:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzYol4cGVKE5BER2vjNXmlOgzv6RtJE/jwcdNMkBkbUPsBLhQr2rCZZYabljkv48UxQwWByXswV/QMurBYCaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T01:42:57.274655Z"},"content_sha256":"5f669065f0bade809b74a32c4b3826be1c6501ea4da2328e81a8a7106ca7a3bd","schema_version":"1.0","event_id":"sha256:5f669065f0bade809b74a32c4b3826be1c6501ea4da2328e81a8a7106ca7a3bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/bundle.json","state_url":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/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-07-01T01:42:57Z","links":{"resolver":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ","bundle":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/bundle.json","state":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RZ74E4VQ43CWLS253YXK7FWUNZ","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":"233be5227bd395f98fb2e0e375a1f620cd056baa39bc74e9ee68ffabd15b9842","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-03T15:09:17Z","title_canon_sha256":"1cd254932d6894989c3a8e359b8a80f01538dab2a247ade9c6ad05d86d67e7e8"},"schema_version":"1.0","source":{"id":"1512.01104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01104","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01104v2","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01104","created_at":"2026-05-18T01:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"RZ74E4VQ43CW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RZ74E4VQ43CWLS25","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RZ74E4VQ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5f669065f0bade809b74a32c4b3826be1c6501ea4da2328e81a8a7106ca7a3bd","target":"graph","created_at":"2026-05-18T01:21:44Z","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":"A median graph is a connected graph, such that for any three vertices $u,v,w$ there is exactly one vertex $x$ that lies simultaneously on a shortest $(u,v)$-path, a shortest $(v,w)$-path and a shortest $(w,u)$-path. Examples of median graphs are trees and hypercubes.\n  We introduce and study a generalisation of tree decompositions, to be called median decompositions, where instead of decomposing a graph $G$ in a treelike fashion, we use general median graphs as the underlying graph of the decomposition. We show that the corresponding width parameter $\\text{mw}(G)$, the medianwidth of $G$, is e","authors_text":"Konstantinos Stavropoulos","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-03T15:09:17Z","title":"On the Medianwidth of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01104","kind":"arxiv","version":2},"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:192014f93d99d3c7a43d88a4e84a57a17c0fa3ee63b5e4c2e71d15ee32496f60","target":"record","created_at":"2026-05-18T01:21:44Z","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":"233be5227bd395f98fb2e0e375a1f620cd056baa39bc74e9ee68ffabd15b9842","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-03T15:09:17Z","title_canon_sha256":"1cd254932d6894989c3a8e359b8a80f01538dab2a247ade9c6ad05d86d67e7e8"},"schema_version":"1.0","source":{"id":"1512.01104","kind":"arxiv","version":2}},"canonical_sha256":"8e7fc272b0e6c565cb5dde2eaf96d46e67f3720cf6b461bf36ed6fb00a9b2d27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e7fc272b0e6c565cb5dde2eaf96d46e67f3720cf6b461bf36ed6fb00a9b2d27","first_computed_at":"2026-05-18T01:21:44.349350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:44.349350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u03P653HU98hWoSjjiVYHGY4RlRFZaG2oNTKjtQOIhzW7ipY0l5O4tV6lPRPSC9qme7uVZxts2nBSqeBHVaRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:44.349959Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:192014f93d99d3c7a43d88a4e84a57a17c0fa3ee63b5e4c2e71d15ee32496f60","sha256:5f669065f0bade809b74a32c4b3826be1c6501ea4da2328e81a8a7106ca7a3bd"],"state_sha256":"d4514c6108dee04c7e19174944c1afff310a22df4076960e9d3b5cae4fa1c72f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lul3QGxTvNGOuxFTMFuhvxARvvt2sa8y3YmyhVrN47JIuKGtWCsonEsZdtdyLgQcUk9HI5eLAnJ2hV5JjuuvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T01:42:57.276559Z","bundle_sha256":"79b5047b67efe6cf6a4080af54d8581933a1f8a020dd8d971e84ed81e7c61615"}}