{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RZ74E4VQ43CWLS253YXK7FWUNZ","short_pith_number":"pith:RZ74E4VQ","schema_version":"1.0","canonical_sha256":"8e7fc272b0e6c565cb5dde2eaf96d46e67f3720cf6b461bf36ed6fb00a9b2d27","source":{"kind":"arxiv","id":"1512.01104","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.01104","created_at":"2026-05-18T01:21:44.349436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01104v2","created_at":"2026-05-18T01:21:44.349436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01104","created_at":"2026-05-18T01:21:44.349436+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZ74E4VQ43CW","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZ74E4VQ43CWLS25","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZ74E4VQ","created_at":"2026-05-18T12:29:39.896362+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/RZ74E4VQ43CWLS253YXK7FWUNZ","json":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ.json","graph_json":"https://pith.science/api/pith-number/RZ74E4VQ43CWLS253YXK7FWUNZ/graph.json","events_json":"https://pith.science/api/pith-number/RZ74E4VQ43CWLS253YXK7FWUNZ/events.json","paper":"https://pith.science/paper/RZ74E4VQ"},"agent_actions":{"view_html":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ","download_json":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ.json","view_paper":"https://pith.science/paper/RZ74E4VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01104&json=true","fetch_graph":"https://pith.science/api/pith-number/RZ74E4VQ43CWLS253YXK7FWUNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RZ74E4VQ43CWLS253YXK7FWUNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/action/storage_attestation","attest_author":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/action/author_attestation","sign_citation":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/action/citation_signature","submit_replication":"https://pith.science/pith/RZ74E4VQ43CWLS253YXK7FWUNZ/action/replication_record"}},"created_at":"2026-05-18T01:21:44.349436+00:00","updated_at":"2026-05-18T01:21:44.349436+00:00"}