{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MORN5M7ZI5WGI3JDC6T2VMSA7A","short_pith_number":"pith:MORN5M7Z","schema_version":"1.0","canonical_sha256":"63a2deb3f9476c646d2317a7aab240f80236acd69660f39f51543c184d189d8c","source":{"kind":"arxiv","id":"1608.01542","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds on the mim-width of Some Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Stefan Mengel","submitted_at":"2016-08-04T14:26:32Z","abstract_excerpt":"mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs, co-comparability graphs and circle graphs. This improves and refines lower bounds that were known before, some of them only conditionally. In the case of strongly chordal graphs not even a conditional lower bound was known before. All of the bounds given are optimal up to constants."},"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":"1608.01542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-04T14:26:32Z","cross_cats_sorted":[],"title_canon_sha256":"f89b03810a05587a3257e1001c043aef3ddd585d9e9e43c2882a0654999b229c","abstract_canon_sha256":"93df9029b94e42ac4468fcf869a90f04b0c54018d5b5fc726e6d894149d755fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:24.303677Z","signature_b64":"xHAI7ankXaBdvPoZhDf3QEBVTDW8twLgJbJUJ7jjtFTQjp63Th7+e0QkoqXSgeBTsLWt8PrUtTWUXqMpnuiXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63a2deb3f9476c646d2317a7aab240f80236acd69660f39f51543c184d189d8c","last_reissued_at":"2026-05-18T00:53:24.303233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:24.303233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on the mim-width of Some Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Stefan Mengel","submitted_at":"2016-08-04T14:26:32Z","abstract_excerpt":"mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs, co-comparability graphs and circle graphs. This improves and refines lower bounds that were known before, some of them only conditionally. In the case of strongly chordal graphs not even a conditional lower bound was known before. All of the bounds given are optimal up to constants."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01542","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":"1608.01542","created_at":"2026-05-18T00:53:24.303310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01542v2","created_at":"2026-05-18T00:53:24.303310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01542","created_at":"2026-05-18T00:53:24.303310+00:00"},{"alias_kind":"pith_short_12","alias_value":"MORN5M7ZI5WG","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MORN5M7ZI5WGI3JD","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MORN5M7Z","created_at":"2026-05-18T12:30:32.724797+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/MORN5M7ZI5WGI3JDC6T2VMSA7A","json":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A.json","graph_json":"https://pith.science/api/pith-number/MORN5M7ZI5WGI3JDC6T2VMSA7A/graph.json","events_json":"https://pith.science/api/pith-number/MORN5M7ZI5WGI3JDC6T2VMSA7A/events.json","paper":"https://pith.science/paper/MORN5M7Z"},"agent_actions":{"view_html":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A","download_json":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A.json","view_paper":"https://pith.science/paper/MORN5M7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01542&json=true","fetch_graph":"https://pith.science/api/pith-number/MORN5M7ZI5WGI3JDC6T2VMSA7A/graph.json","fetch_events":"https://pith.science/api/pith-number/MORN5M7ZI5WGI3JDC6T2VMSA7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A/action/storage_attestation","attest_author":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A/action/author_attestation","sign_citation":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A/action/citation_signature","submit_replication":"https://pith.science/pith/MORN5M7ZI5WGI3JDC6T2VMSA7A/action/replication_record"}},"created_at":"2026-05-18T00:53:24.303310+00:00","updated_at":"2026-05-18T00:53:24.303310+00:00"}