{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CGMELMKZ6KUZ4JWH2QJAH76RPE","short_pith_number":"pith:CGMELMKZ","schema_version":"1.0","canonical_sha256":"119845b159f2a99e26c7d41203ffd17937813e4880bbb072fa6269ca4cf148d2","source":{"kind":"arxiv","id":"2110.09346","version":1},"attestation_state":"computed","paper":{"title":"Planar Median Graphs and Cubesquare-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carsten R. Seemann, Marc Hellmuth, Peter F. Stadler, Vincent Moulton","submitted_at":"2021-10-18T14:21:41Z","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. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph $G$ is a median graph in terms of forbidden subgraphs and the structure of isometric cycles in $G$, and also in terms of subgraphs of $G$ that are contained inside and outside of 4-cycles with respect to an arbitrary planar embedding of $G$. These results lead us to a new characterization of plan"},"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":"2110.09346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-10-18T14:21:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"791caf86b2b99e465ff7a46c5a84a2b611cf1f5a14a8438f50cc3bc4ca88122e","abstract_canon_sha256":"c343daf705ad956bc44be4897b2de3878a38afe0ea6f0f4ed5bc2619e798568b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:27.318427Z","signature_b64":"/VScPqEmK/LP684t9gV9m7arLEQaJKQycSNTYOuYbidDMqGIWD1glwa810y3WyFa8+F1NgNbZ9aT8A866IDmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119845b159f2a99e26c7d41203ffd17937813e4880bbb072fa6269ca4cf148d2","last_reissued_at":"2026-07-05T03:23:27.317980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:27.317980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Median Graphs and Cubesquare-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carsten R. Seemann, Marc Hellmuth, Peter F. Stadler, Vincent Moulton","submitted_at":"2021-10-18T14:21:41Z","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. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph $G$ is a median graph in terms of forbidden subgraphs and the structure of isometric cycles in $G$, and also in terms of subgraphs of $G$ that are contained inside and outside of 4-cycles with respect to an arbitrary planar embedding of $G$. These results lead us to a new characterization of plan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.09346","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/2110.09346/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":"2110.09346","created_at":"2026-07-05T03:23:27.318048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.09346v1","created_at":"2026-07-05T03:23:27.318048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.09346","created_at":"2026-07-05T03:23:27.318048+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGMELMKZ6KUZ","created_at":"2026-07-05T03:23:27.318048+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGMELMKZ6KUZ4JWH","created_at":"2026-07-05T03:23:27.318048+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGMELMKZ","created_at":"2026-07-05T03:23:27.318048+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/CGMELMKZ6KUZ4JWH2QJAH76RPE","json":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE.json","graph_json":"https://pith.science/api/pith-number/CGMELMKZ6KUZ4JWH2QJAH76RPE/graph.json","events_json":"https://pith.science/api/pith-number/CGMELMKZ6KUZ4JWH2QJAH76RPE/events.json","paper":"https://pith.science/paper/CGMELMKZ"},"agent_actions":{"view_html":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE","download_json":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE.json","view_paper":"https://pith.science/paper/CGMELMKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.09346&json=true","fetch_graph":"https://pith.science/api/pith-number/CGMELMKZ6KUZ4JWH2QJAH76RPE/graph.json","fetch_events":"https://pith.science/api/pith-number/CGMELMKZ6KUZ4JWH2QJAH76RPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE/action/storage_attestation","attest_author":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE/action/author_attestation","sign_citation":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE/action/citation_signature","submit_replication":"https://pith.science/pith/CGMELMKZ6KUZ4JWH2QJAH76RPE/action/replication_record"}},"created_at":"2026-07-05T03:23:27.318048+00:00","updated_at":"2026-07-05T03:23:27.318048+00:00"}