{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5HM2ZCAKENXFSOIAWWFUULW5BR","short_pith_number":"pith:5HM2ZCAK","schema_version":"1.0","canonical_sha256":"e9d9ac880a236e593900b58b4a2edd0c780d4110dcfda7aa156eb3ff58ce5c6c","source":{"kind":"arxiv","id":"2304.06453","version":1},"attestation_state":"computed","paper":{"title":"On a generalization of median graphs: $k$-median graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu","submitted_at":"2023-04-13T12:46:36Z","abstract_excerpt":"Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. To be more formal, a graph $G$ is a median graph if, for all $\\mu, u,v\\in V(G)$, it holds that $|I(\\mu,u)\\cap I(\\mu,v)\\cap I(u,v)|=1$ where $I(x,y)$ denotes the set of all vertices that lie on shortest paths connecting $x$ and $y$. In this paper we are interested in a natural generalization of median graphs, called $k$-median graphs. A graph $G$ is a $k$-median graph, if there are $k$ vertices $\\mu_1,\\dots,\\mu_k\\in V(G)$ such that"},"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":"2304.06453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-04-13T12:46:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5180989f5bd73b7d20e6edd934b12f17ca5eb17d52562c1841e85a8403af885d","abstract_canon_sha256":"de164dc173c0c788bc6cf2f7d97aa35ec7bbe4ee4d37585120531a37280130c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:00:43.545199Z","signature_b64":"0wknNrPSmhbosk6smpluPtLXKzXU6F4gWJFb2ZDSQGwz874Vakxw3gZsRYlULU2qr25Tf1ueEaiIx7pEYPpyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d9ac880a236e593900b58b4a2edd0c780d4110dcfda7aa156eb3ff58ce5c6c","last_reissued_at":"2026-07-05T06:00:43.544791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:00:43.544791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a generalization of median graphs: $k$-median graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu","submitted_at":"2023-04-13T12:46:36Z","abstract_excerpt":"Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. To be more formal, a graph $G$ is a median graph if, for all $\\mu, u,v\\in V(G)$, it holds that $|I(\\mu,u)\\cap I(\\mu,v)\\cap I(u,v)|=1$ where $I(x,y)$ denotes the set of all vertices that lie on shortest paths connecting $x$ and $y$. In this paper we are interested in a natural generalization of median graphs, called $k$-median graphs. A graph $G$ is a $k$-median graph, if there are $k$ vertices $\\mu_1,\\dots,\\mu_k\\in V(G)$ such that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.06453","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.06453/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.06453","created_at":"2026-07-05T06:00:43.544856+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.06453v1","created_at":"2026-07-05T06:00:43.544856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.06453","created_at":"2026-07-05T06:00:43.544856+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HM2ZCAKENXF","created_at":"2026-07-05T06:00:43.544856+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HM2ZCAKENXFSOIA","created_at":"2026-07-05T06:00:43.544856+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HM2ZCAK","created_at":"2026-07-05T06:00:43.544856+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/5HM2ZCAKENXFSOIAWWFUULW5BR","json":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR.json","graph_json":"https://pith.science/api/pith-number/5HM2ZCAKENXFSOIAWWFUULW5BR/graph.json","events_json":"https://pith.science/api/pith-number/5HM2ZCAKENXFSOIAWWFUULW5BR/events.json","paper":"https://pith.science/paper/5HM2ZCAK"},"agent_actions":{"view_html":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR","download_json":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR.json","view_paper":"https://pith.science/paper/5HM2ZCAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.06453&json=true","fetch_graph":"https://pith.science/api/pith-number/5HM2ZCAKENXFSOIAWWFUULW5BR/graph.json","fetch_events":"https://pith.science/api/pith-number/5HM2ZCAKENXFSOIAWWFUULW5BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR/action/storage_attestation","attest_author":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR/action/author_attestation","sign_citation":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR/action/citation_signature","submit_replication":"https://pith.science/pith/5HM2ZCAKENXFSOIAWWFUULW5BR/action/replication_record"}},"created_at":"2026-07-05T06:00:43.544856+00:00","updated_at":"2026-07-05T06:00:43.544856+00:00"}