{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:H2MGLROIPHQD2IXIJISSVCEKR2","short_pith_number":"pith:H2MGLROI","schema_version":"1.0","canonical_sha256":"3e9865c5c879e03d22e84a252a888a8e8d5885120e8eb63381b783d69cc8fdbd","source":{"kind":"arxiv","id":"1603.09532","version":2},"attestation_state":"computed","paper":{"title":"Characterising Bounded Expansion by Neighbourhood Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, Konstantinos Stavropoulos","submitted_at":"2016-03-31T11:34:48Z","abstract_excerpt":"We show that a graph class $\\cal G$ has bounded expansion if and only if it has bounded $r$-neighbourhood complexity, i.e. for any vertex set $X$ of any subgraph $H$ of $G\\in\\cal G$, the number of subsets of $X$ which are exact $r$-neighbourhoods of vertices of $H$ on $X$ is linear to the size of $X$. This is established by bounding the $r$-neighbourhood complexity of a graph in terms of both its $r$-centred colouring number and its weak $r$-colouring number, which provide known characterisations to the property of bounded expansion."},"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.09532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-31T11:34:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"50f52d6625e36a123bc9f7a8e880fed53dd4b23c6b8ac76f0ce7f85ad400833c","abstract_canon_sha256":"461cc721db828040d0563805af9fcf731ea5c14dc027fa058e8b7dc57dae14cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:39.467711Z","signature_b64":"mVqqbZmMORbhjqx3TFLAGZe/YahhPG4OZQSp5blvJmzublJNDJSdYeFuB5gPUDjg1//ostKkcNaU+rJ6lDgjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e9865c5c879e03d22e84a252a888a8e8d5885120e8eb63381b783d69cc8fdbd","last_reissued_at":"2026-05-18T01:00:39.467271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:39.467271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterising Bounded Expansion by Neighbourhood Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, Konstantinos Stavropoulos","submitted_at":"2016-03-31T11:34:48Z","abstract_excerpt":"We show that a graph class $\\cal G$ has bounded expansion if and only if it has bounded $r$-neighbourhood complexity, i.e. for any vertex set $X$ of any subgraph $H$ of $G\\in\\cal G$, the number of subsets of $X$ which are exact $r$-neighbourhoods of vertices of $H$ on $X$ is linear to the size of $X$. This is established by bounding the $r$-neighbourhood complexity of a graph in terms of both its $r$-centred colouring number and its weak $r$-colouring number, which provide known characterisations to the property of bounded expansion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09532","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":"1603.09532","created_at":"2026-05-18T01:00:39.467339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09532v2","created_at":"2026-05-18T01:00:39.467339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09532","created_at":"2026-05-18T01:00:39.467339+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2MGLROIPHQD","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2MGLROIPHQD2IXI","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2MGLROI","created_at":"2026-05-18T12:30:19.053100+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/H2MGLROIPHQD2IXIJISSVCEKR2","json":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2.json","graph_json":"https://pith.science/api/pith-number/H2MGLROIPHQD2IXIJISSVCEKR2/graph.json","events_json":"https://pith.science/api/pith-number/H2MGLROIPHQD2IXIJISSVCEKR2/events.json","paper":"https://pith.science/paper/H2MGLROI"},"agent_actions":{"view_html":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2","download_json":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2.json","view_paper":"https://pith.science/paper/H2MGLROI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09532&json=true","fetch_graph":"https://pith.science/api/pith-number/H2MGLROIPHQD2IXIJISSVCEKR2/graph.json","fetch_events":"https://pith.science/api/pith-number/H2MGLROIPHQD2IXIJISSVCEKR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2/action/storage_attestation","attest_author":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2/action/author_attestation","sign_citation":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2/action/citation_signature","submit_replication":"https://pith.science/pith/H2MGLROIPHQD2IXIJISSVCEKR2/action/replication_record"}},"created_at":"2026-05-18T01:00:39.467339+00:00","updated_at":"2026-05-18T01:00:39.467339+00:00"}