{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O6CDFBTWHJQYQOG2MFPP6K4B7H","short_pith_number":"pith:O6CDFBTW","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"},"canonical_sha256":"77843286763a618838da615eff2b81f9df4a91f59cc1224028f06be5aa55be6f","source":{"kind":"arxiv","id":"1612.08197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08197","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08197v1","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08197","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"O6CDFBTWHJQY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O6CDFBTWHJQYQOG2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O6CDFBTW","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O6CDFBTWHJQYQOG2MFPP6K4B7H","target":"record","payload":{"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"},"canonical_sha256":"77843286763a618838da615eff2b81f9df4a91f59cc1224028f06be5aa55be6f","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"},"source_kind":"arxiv","source_id":"1612.08197","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rh6cZjtxXDSXeYhEW/yZ++67oZ7L5tTJmU23izhc1IA4kY1pq8CjD6KsiPBOTu5KETuxA85z6PywOlaQFv0aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:22:51.257252Z"},"content_sha256":"affca12c0ef5ce7d0a0868c1cf865f12bf6b4188fbfa67cc2bde3267c731760a","schema_version":"1.0","event_id":"sha256:affca12c0ef5ce7d0a0868c1cf865f12bf6b4188fbfa67cc2bde3267c731760a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O6CDFBTWHJQYQOG2MFPP6K4B7H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6ohxjxpgYQRZ46oDbrN++MHJk0Tcgi7ED99TbSVxzr1BdYjI8iIdII46Bn4RFbwg5Tw5LDiIRhy56e2Nf2WCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:22:51.258206Z"},"content_sha256":"33aebb8cb146958f54d39a995f9c0252100a8d039c21c22461758d929b6b9d9e","schema_version":"1.0","event_id":"sha256:33aebb8cb146958f54d39a995f9c0252100a8d039c21c22461758d929b6b9d9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/bundle.json","state_url":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T19:22:51Z","links":{"resolver":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H","bundle":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/bundle.json","state":"https://pith.science/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6CDFBTWHJQYQOG2MFPP6K4B7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O6CDFBTWHJQYQOG2MFPP6K4B7H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5ad9dbd64c1d1ec49ba498437b8a67892bf25116318f45ee9736d0e1ff6fad9f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-24T16:03:30Z","title_canon_sha256":"874c6a235851775e5cf440bf6b5729ee5e24f911571955be41b4f5b8eaaba9d2"},"schema_version":"1.0","source":{"id":"1612.08197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08197","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08197v1","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08197","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"O6CDFBTWHJQY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O6CDFBTWHJQYQOG2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O6CDFBTW","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:33aebb8cb146958f54d39a995f9c0252100a8d039c21c22461758d929b6b9d9e","target":"graph","created_at":"2026-05-18T00:54:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Archontia C. Giannopoulou, Kord Eickmeyer, Micha{\\l} Pilipczuk, O-joung Kwon, Roman Rabinovich, Sebastian Siebertz, Stephan Kreutzer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-24T16:03:30Z","title":"Neighborhood complexity and kernelization for nowhere dense classes of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08197","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:affca12c0ef5ce7d0a0868c1cf865f12bf6b4188fbfa67cc2bde3267c731760a","target":"record","created_at":"2026-05-18T00:54:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5ad9dbd64c1d1ec49ba498437b8a67892bf25116318f45ee9736d0e1ff6fad9f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-12-24T16:03:30Z","title_canon_sha256":"874c6a235851775e5cf440bf6b5729ee5e24f911571955be41b4f5b8eaaba9d2"},"schema_version":"1.0","source":{"id":"1612.08197","kind":"arxiv","version":1}},"canonical_sha256":"77843286763a618838da615eff2b81f9df4a91f59cc1224028f06be5aa55be6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77843286763a618838da615eff2b81f9df4a91f59cc1224028f06be5aa55be6f","first_computed_at":"2026-05-18T00:54:04.285300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:04.285300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwQ3FGWNGF8TfcDvu3ug0OS7Qd8nhL/Ho2IXB4BKeAwRaXfm2suTA03PcwcUX0K39TjnZlm6GMEruj3jiF2YAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:04.285877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:affca12c0ef5ce7d0a0868c1cf865f12bf6b4188fbfa67cc2bde3267c731760a","sha256:33aebb8cb146958f54d39a995f9c0252100a8d039c21c22461758d929b6b9d9e"],"state_sha256":"81423db54571513d518be1f2a5a7eb95cf00a231099d0b0ab4da171c7c86192a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+lCZCunIW+1+b0JJiLTr30mDnQ0l9cHMwyFCVTq00dTIxn/s9vDPbkEq7ADtYLCkKP1fRDaXJEoociwyZsgBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:22:51.262326Z","bundle_sha256":"56a0bb3828cd4baa8c9ff104c8eddc141dee8746e5d21a2aa1a6918f37189133"}}