{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6TQBWDKIC57A4SCU6WCDQ2DB3S","short_pith_number":"pith:6TQBWDKI","schema_version":"1.0","canonical_sha256":"f4e01b0d48177e0e4854f584386861dca3ffab21b41231953c214f33bbdc1573","source":{"kind":"arxiv","id":"2607.10941","version":1},"attestation_state":"computed","paper":{"title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Jan Dreier, Micha{\\l} Pilipczuk, Nikolas M\\\"ahlmann, Rose McCarty, Szymon Toru\\'nczyk","submitted_at":"2026-07-12T22:04:50Z","abstract_excerpt":"Monadic dependence is a proposed structural dividing line for fixed-parameter tractability of first-order model checking on hereditary graph classes. A graph class is \\emph{monadically dependent} if the class of all graphs cannot be interpreted in its vertex-colored members using a fixed first-order formula. We prove two structural consequences of monadic dependence. First, every monadically dependent class has \\emph{almost linear neighborhood complexity}: for every graph $G$ in the class and every set $A\\subseteq V(G)$, the family $\\{N_G(v)\\cap A : v\\in V(G)\\}$ has size $|A|^{1+o(1)}$. Second"},"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":"2607.10941","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-12T22:04:50Z","cross_cats_sorted":["cs.DS","cs.LO","math.CO"],"title_canon_sha256":"cdfa4bda647d15d68fd9d6de13bc534071950eba8d2342019e75e6a387b0d283","abstract_canon_sha256":"09c10a101fbcb6f9291e709910776b647a3522d2c650d353315f5ec15c4fe84a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:48.710645Z","signature_b64":"LxwT2WVZpDkUh721TItoBJsUWldLEY2cb5eyr7H/LcHpxT/+Wu5FJS37Sf0bys56vj9y2IsxfihRLrEVq18UDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e01b0d48177e0e4854f584386861dca3ffab21b41231953c214f33bbdc1573","last_reissued_at":"2026-07-14T01:21:48.709592Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:48.709592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighborhood Complexity and Radius-1 Merge-Width in Monadically Dependent Graph Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LO","math.CO"],"primary_cat":"cs.DM","authors_text":"Jan Dreier, Micha{\\l} Pilipczuk, Nikolas M\\\"ahlmann, Rose McCarty, Szymon Toru\\'nczyk","submitted_at":"2026-07-12T22:04:50Z","abstract_excerpt":"Monadic dependence is a proposed structural dividing line for fixed-parameter tractability of first-order model checking on hereditary graph classes. A graph class is \\emph{monadically dependent} if the class of all graphs cannot be interpreted in its vertex-colored members using a fixed first-order formula. We prove two structural consequences of monadic dependence. First, every monadically dependent class has \\emph{almost linear neighborhood complexity}: for every graph $G$ in the class and every set $A\\subseteq V(G)$, the family $\\{N_G(v)\\cap A : v\\in V(G)\\}$ has size $|A|^{1+o(1)}$. Second"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10941","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/2607.10941/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":"2607.10941","created_at":"2026-07-14T01:21:48.710062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10941v1","created_at":"2026-07-14T01:21:48.710062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10941","created_at":"2026-07-14T01:21:48.710062+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TQBWDKIC57A","created_at":"2026-07-14T01:21:48.710062+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TQBWDKIC57A4SCU","created_at":"2026-07-14T01:21:48.710062+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TQBWDKI","created_at":"2026-07-14T01:21:48.710062+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/6TQBWDKIC57A4SCU6WCDQ2DB3S","json":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S.json","graph_json":"https://pith.science/api/pith-number/6TQBWDKIC57A4SCU6WCDQ2DB3S/graph.json","events_json":"https://pith.science/api/pith-number/6TQBWDKIC57A4SCU6WCDQ2DB3S/events.json","paper":"https://pith.science/paper/6TQBWDKI"},"agent_actions":{"view_html":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S","download_json":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S.json","view_paper":"https://pith.science/paper/6TQBWDKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10941&json=true","fetch_graph":"https://pith.science/api/pith-number/6TQBWDKIC57A4SCU6WCDQ2DB3S/graph.json","fetch_events":"https://pith.science/api/pith-number/6TQBWDKIC57A4SCU6WCDQ2DB3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S/action/storage_attestation","attest_author":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S/action/author_attestation","sign_citation":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S/action/citation_signature","submit_replication":"https://pith.science/pith/6TQBWDKIC57A4SCU6WCDQ2DB3S/action/replication_record"}},"created_at":"2026-07-14T01:21:48.710062+00:00","updated_at":"2026-07-14T01:21:48.710062+00:00"}