{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RC2DYNKZTMRWZOCPAEST3JKBNM","short_pith_number":"pith:RC2DYNKZ","schema_version":"1.0","canonical_sha256":"88b43c35599b236cb84f01253da5416b22bc42bdd17be67135b4d7595cb4d4e7","source":{"kind":"arxiv","id":"2504.08266","version":2},"attestation_state":"computed","paper":{"title":"$\\chi$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Colin Geniet, Marthe Bonamy","submitted_at":"2025-04-11T05:43:21Z","abstract_excerpt":"Merge-width, recently introduced by Dreier and Toru\\'nczyk, is a common generalisation of bounded expansion classes and twin-width for which the first-order model checking problem remains tractable. We prove that a number of basic properties shared by bounded expansion and bounded twin-width graphs also hold for bounded merge-width graphs: they are $\\chi$-bounded, they satisfy the strong Erd\\H{o}s-Hajnal property, and their neighbourhood complexity is linear."},"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":"2504.08266","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-11T05:43:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4b2a60d249b2e5f982558c34ca6f7bc858f1a119d3a21867c47aecfa05dd4bab","abstract_canon_sha256":"c8d29f51352dfa12e252f4531846bb010f0ed5850a89b0cc09f48c2f47f1a874"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:45.408957Z","signature_b64":"NOmp+V7Fq2YiqWLcSaec/dfAa8PI1U4+1QqwLnniBc2B+099vIJMg8Yb3GisGEYRmZ1BG16pFUVKc+y6whaXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b43c35599b236cb84f01253da5416b22bc42bdd17be67135b4d7595cb4d4e7","last_reissued_at":"2026-07-05T11:21:45.408284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:45.408284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\chi$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Colin Geniet, Marthe Bonamy","submitted_at":"2025-04-11T05:43:21Z","abstract_excerpt":"Merge-width, recently introduced by Dreier and Toru\\'nczyk, is a common generalisation of bounded expansion classes and twin-width for which the first-order model checking problem remains tractable. We prove that a number of basic properties shared by bounded expansion and bounded twin-width graphs also hold for bounded merge-width graphs: they are $\\chi$-bounded, they satisfy the strong Erd\\H{o}s-Hajnal property, and their neighbourhood complexity is linear."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08266","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.08266/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":"2504.08266","created_at":"2026-07-05T11:21:45.408373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.08266v2","created_at":"2026-07-05T11:21:45.408373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08266","created_at":"2026-07-05T11:21:45.408373+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC2DYNKZTMRW","created_at":"2026-07-05T11:21:45.408373+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC2DYNKZTMRWZOCP","created_at":"2026-07-05T11:21:45.408373+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC2DYNKZ","created_at":"2026-07-05T11:21:45.408373+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09785","citing_title":"Biclique decompositions from Welzl orders","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31369","citing_title":"Constant-factor approximation of maximum distance-2 independent set in graphs of bounded merge-width","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM","json":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM.json","graph_json":"https://pith.science/api/pith-number/RC2DYNKZTMRWZOCPAEST3JKBNM/graph.json","events_json":"https://pith.science/api/pith-number/RC2DYNKZTMRWZOCPAEST3JKBNM/events.json","paper":"https://pith.science/paper/RC2DYNKZ"},"agent_actions":{"view_html":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM","download_json":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM.json","view_paper":"https://pith.science/paper/RC2DYNKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.08266&json=true","fetch_graph":"https://pith.science/api/pith-number/RC2DYNKZTMRWZOCPAEST3JKBNM/graph.json","fetch_events":"https://pith.science/api/pith-number/RC2DYNKZTMRWZOCPAEST3JKBNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM/action/storage_attestation","attest_author":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM/action/author_attestation","sign_citation":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM/action/citation_signature","submit_replication":"https://pith.science/pith/RC2DYNKZTMRWZOCPAEST3JKBNM/action/replication_record"}},"created_at":"2026-07-05T11:21:45.408373+00:00","updated_at":"2026-07-05T11:21:45.408373+00:00"}