{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LJYJSDTXRCHIFOE6JFCRASFFTU","short_pith_number":"pith:LJYJSDTX","schema_version":"1.0","canonical_sha256":"5a70990e77888e82b89e49451048a59d15a62519960d169ae723805d203ea0a1","source":{"kind":"arxiv","id":"1603.06871","version":1},"attestation_state":"computed","paper":{"title":"Cops, Robber and Medianwidth Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Konstantinos Stavropoulos","submitted_at":"2016-03-22T17:06:39Z","abstract_excerpt":"In previous work, we introduced median decompositions, a generalisation of tree decompositions where a graph can be modelled after any median graph, along with a hierarchy of $i$-medianwidth parameters $(mw_i)_{i\\geq 1}$ starting from treewidth and converging to the clique number.\n  We introduce another graph parameter based on the concept of median decompositions, to be called $i$-latticewidth and denoted by $lw_i$, for which we restrict the modelling median graph of a decomposition to be isometrically embeddable into the Cartesian product of $i$ paths. The sequence $(lw_i)_{i\\geq 1}$ gives r"},"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":"1603.06871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-22T17:06:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"318378dc8cd84fe0a0ed08028e645f1f38311a6faf40478e77ab22ee17370c54","abstract_canon_sha256":"390380cdedb0b18fa5e3abf6a407400c8608752ccc6e282519e0307fefcecded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.534430Z","signature_b64":"+UzmSCDKWr9GkgUwptlwki9dy3N1uCosYP77J/Q/zJ21SCyNHg7D+tGMtIk4AgtXE8Gpdcr1TfY8IeTiV+akBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a70990e77888e82b89e49451048a59d15a62519960d169ae723805d203ea0a1","last_reissued_at":"2026-05-18T01:18:34.533946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.533946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cops, Robber and Medianwidth Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Konstantinos Stavropoulos","submitted_at":"2016-03-22T17:06:39Z","abstract_excerpt":"In previous work, we introduced median decompositions, a generalisation of tree decompositions where a graph can be modelled after any median graph, along with a hierarchy of $i$-medianwidth parameters $(mw_i)_{i\\geq 1}$ starting from treewidth and converging to the clique number.\n  We introduce another graph parameter based on the concept of median decompositions, to be called $i$-latticewidth and denoted by $lw_i$, for which we restrict the modelling median graph of a decomposition to be isometrically embeddable into the Cartesian product of $i$ paths. The sequence $(lw_i)_{i\\geq 1}$ gives r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06871","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.06871","created_at":"2026-05-18T01:18:34.534022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06871v1","created_at":"2026-05-18T01:18:34.534022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06871","created_at":"2026-05-18T01:18:34.534022+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJYJSDTXRCHI","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJYJSDTXRCHIFOE6","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJYJSDTX","created_at":"2026-05-18T12:30:29.479603+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/LJYJSDTXRCHIFOE6JFCRASFFTU","json":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU.json","graph_json":"https://pith.science/api/pith-number/LJYJSDTXRCHIFOE6JFCRASFFTU/graph.json","events_json":"https://pith.science/api/pith-number/LJYJSDTXRCHIFOE6JFCRASFFTU/events.json","paper":"https://pith.science/paper/LJYJSDTX"},"agent_actions":{"view_html":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU","download_json":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU.json","view_paper":"https://pith.science/paper/LJYJSDTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06871&json=true","fetch_graph":"https://pith.science/api/pith-number/LJYJSDTXRCHIFOE6JFCRASFFTU/graph.json","fetch_events":"https://pith.science/api/pith-number/LJYJSDTXRCHIFOE6JFCRASFFTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU/action/storage_attestation","attest_author":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU/action/author_attestation","sign_citation":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU/action/citation_signature","submit_replication":"https://pith.science/pith/LJYJSDTXRCHIFOE6JFCRASFFTU/action/replication_record"}},"created_at":"2026-05-18T01:18:34.534022+00:00","updated_at":"2026-05-18T01:18:34.534022+00:00"}