{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FL53I4ITONLDFVZRFVY3KVQ4C3","short_pith_number":"pith:FL53I4IT","schema_version":"1.0","canonical_sha256":"2afbb47113735632d7312d71b5561c16ec0d94a8b6caca993a96c96f85123520","source":{"kind":"arxiv","id":"2607.16889","version":1},"attestation_state":"computed","paper":{"title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau, Florent Foucaud, Ga\\'etan Berthe, Tuomo Lehtil\\\"a","submitted_at":"2026-07-18T17:11:16Z","abstract_excerpt":"The neighbourhood complexity $nc(G,k)$ of a graph $G$ is a quantity measuring, for a graph $G$ and an integer $k$, the maximum possible number (over all vertex subsets $S$ of size $k$) $|\\{N[v]\\cap S, v\\in V(G)\\}|$ of $S$-neighbourhoods in $G$. This notion is important in structural graph theory and algorithm design (especially in parameterized complexity, in particular model checking and kernelization).\n  While generally $nc(G,k)\\leq 2^k$ and this bound can be achieved, it is known that sparse graphs and structured dense graphs have linear neighbourhood complexity, that is, $nc(G,k)\\in O(k)$ "},"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.16889","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-18T17:11:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0477da420d4a68435383e175ea462cc082336c0e69c9de2785b206bd12ad4e4a","abstract_canon_sha256":"c906e1cb85a2f677032e0faf0e57c2301244f5e5e79e47e3edc7ce05b81c0428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:04.061429Z","signature_b64":"bBekwQqraVdYSzLlYRxLIF9ociXZZ4yOARym3sRxTcUJZyrZTYhP8OZgqRZRgEs00jl+7NLDa1n6ki7n14XGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afbb47113735632d7312d71b5561c16ec0d94a8b6caca993a96c96f85123520","last_reissued_at":"2026-07-21T01:21:04.060566Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:04.060566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Aline Parreau, Florent Foucaud, Ga\\'etan Berthe, Tuomo Lehtil\\\"a","submitted_at":"2026-07-18T17:11:16Z","abstract_excerpt":"The neighbourhood complexity $nc(G,k)$ of a graph $G$ is a quantity measuring, for a graph $G$ and an integer $k$, the maximum possible number (over all vertex subsets $S$ of size $k$) $|\\{N[v]\\cap S, v\\in V(G)\\}|$ of $S$-neighbourhoods in $G$. This notion is important in structural graph theory and algorithm design (especially in parameterized complexity, in particular model checking and kernelization).\n  While generally $nc(G,k)\\leq 2^k$ and this bound can be achieved, it is known that sparse graphs and structured dense graphs have linear neighbourhood complexity, that is, $nc(G,k)\\in O(k)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16889","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.16889/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.16889","created_at":"2026-07-21T01:21:04.061010+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.16889v1","created_at":"2026-07-21T01:21:04.061010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16889","created_at":"2026-07-21T01:21:04.061010+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL53I4ITONLD","created_at":"2026-07-21T01:21:04.061010+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL53I4ITONLDFVZR","created_at":"2026-07-21T01:21:04.061010+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL53I4IT","created_at":"2026-07-21T01:21:04.061010+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/FL53I4ITONLDFVZRFVY3KVQ4C3","json":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3.json","graph_json":"https://pith.science/api/pith-number/FL53I4ITONLDFVZRFVY3KVQ4C3/graph.json","events_json":"https://pith.science/api/pith-number/FL53I4ITONLDFVZRFVY3KVQ4C3/events.json","paper":"https://pith.science/paper/FL53I4IT"},"agent_actions":{"view_html":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3","download_json":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3.json","view_paper":"https://pith.science/paper/FL53I4IT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.16889&json=true","fetch_graph":"https://pith.science/api/pith-number/FL53I4ITONLDFVZRFVY3KVQ4C3/graph.json","fetch_events":"https://pith.science/api/pith-number/FL53I4ITONLDFVZRFVY3KVQ4C3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3/action/storage_attestation","attest_author":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3/action/author_attestation","sign_citation":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3/action/citation_signature","submit_replication":"https://pith.science/pith/FL53I4ITONLDFVZRFVY3KVQ4C3/action/replication_record"}},"created_at":"2026-07-21T01:21:04.061010+00:00","updated_at":"2026-07-21T01:21:04.061010+00:00"}