{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O6CDFBTWHJQYQOG2MFPP6K4B7H","short_pith_number":"pith:O6CDFBTW","schema_version":"1.0","canonical_sha256":"77843286763a618838da615eff2b81f9df4a91f59cc1224028f06be5aa55be6f","source":{"kind":"arxiv","id":"1612.08197","version":1},"attestation_state":"computed","paper":{"title":"Neighborhood complexity and kernelization for nowhere dense classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Archontia C. Giannopoulou, Kord Eickmeyer, Micha{\\l} Pilipczuk, O-joung Kwon, Roman Rabinovich, Sebastian Siebertz, Stephan Kreutzer","submitted_at":"2016-12-24T16:03:30Z","abstract_excerpt":"We prove that whenever $G$ is a graph from a nowhere dense graph class $\\mathcal{C}$, and $A$ is a subset of vertices of $G$, then the number of subsets of $A$ that are realized as intersections of $A$ with $r$-neighborhoods of vertices of $G$ is at most $f(r,\\epsilon)\\cdot |A|^{1+\\epsilon}$, where $r$ is any positive integer, $\\epsilon$ is any positive real, and $f$ is a function that depends only on the class $\\mathcal{C}$. This yields a characterization of nowhere dense classes of graphs in terms of neighborhood complexity, which answers a question posed by Reidl et al. As an algorithmic ap"},"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":"1612.08197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-24T16:03:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"874c6a235851775e5cf440bf6b5729ee5e24f911571955be41b4f5b8eaaba9d2","abstract_canon_sha256":"5ad9dbd64c1d1ec49ba498437b8a67892bf25116318f45ee9736d0e1ff6fad9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:04.285877Z","signature_b64":"lwQ3FGWNGF8TfcDvu3ug0OS7Qd8nhL/Ho2IXB4BKeAwRaXfm2suTA03PcwcUX0K39TjnZlm6GMEruj3jiF2YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77843286763a618838da615eff2b81f9df4a91f59cc1224028f06be5aa55be6f","last_reissued_at":"2026-05-18T00:54:04.285300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:04.285300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighborhood complexity and kernelization for nowhere dense classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Archontia C. Giannopoulou, Kord Eickmeyer, Micha{\\l} Pilipczuk, O-joung Kwon, Roman Rabinovich, Sebastian Siebertz, Stephan Kreutzer","submitted_at":"2016-12-24T16:03:30Z","abstract_excerpt":"We prove that whenever $G$ is a graph from a nowhere dense graph class $\\mathcal{C}$, and $A$ is a subset of vertices of $G$, then the number of subsets of $A$ that are realized as intersections of $A$ with $r$-neighborhoods of vertices of $G$ is at most $f(r,\\epsilon)\\cdot |A|^{1+\\epsilon}$, where $r$ is any positive integer, $\\epsilon$ is any positive real, and $f$ is a function that depends only on the class $\\mathcal{C}$. This yields a characterization of nowhere dense classes of graphs in terms of neighborhood complexity, which answers a question posed by Reidl et al. As an algorithmic ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08197","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":""},"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":"1612.08197","created_at":"2026-05-18T00:54:04.285411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08197v1","created_at":"2026-05-18T00:54:04.285411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08197","created_at":"2026-05-18T00:54:04.285411+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6CDFBTWHJQY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6CDFBTWHJQYQOG2","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6CDFBTW","created_at":"2026-05-18T12:30:36.002864+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/O6CDFBTWHJQYQOG2MFPP6K4B7H","json":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H.json","graph_json":"https://pith.science/api/pith-number/O6CDFBTWHJQYQOG2MFPP6K4B7H/graph.json","events_json":"https://pith.science/api/pith-number/O6CDFBTWHJQYQOG2MFPP6K4B7H/events.json","paper":"https://pith.science/paper/O6CDFBTW"},"agent_actions":{"view_html":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H","download_json":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H.json","view_paper":"https://pith.science/paper/O6CDFBTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08197&json=true","fetch_graph":"https://pith.science/api/pith-number/O6CDFBTWHJQYQOG2MFPP6K4B7H/graph.json","fetch_events":"https://pith.science/api/pith-number/O6CDFBTWHJQYQOG2MFPP6K4B7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/action/storage_attestation","attest_author":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/action/author_attestation","sign_citation":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/action/citation_signature","submit_replication":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/action/replication_record"}},"created_at":"2026-05-18T00:54:04.285411+00:00","updated_at":"2026-05-18T00:54:04.285411+00:00"}