{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4R6RTXSP4JCZKSTNZ7FJY3O4WI","short_pith_number":"pith:4R6RTXSP","canonical_record":{"source":{"id":"1705.09336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-25T19:22:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"58bff59b80e40c4a423f540306d3e862e8377b7df0faba5eb51729df7c41d0ef","abstract_canon_sha256":"356c93adabbb7b50dedebe649d5ad8433ea4aa2467589f467d38683637e5baec"},"schema_version":"1.0"},"canonical_sha256":"e47d19de4fe245954a6dcfca9c6ddcb20998324611a046340de6eac442811f0a","source":{"kind":"arxiv","id":"1705.09336","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09336","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09336v2","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09336","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"4R6RTXSP4JCZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4R6RTXSP4JCZKSTN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4R6RTXSP","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4R6RTXSP4JCZKSTNZ7FJY3O4WI","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09336","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-25T19:22:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"58bff59b80e40c4a423f540306d3e862e8377b7df0faba5eb51729df7c41d0ef","abstract_canon_sha256":"356c93adabbb7b50dedebe649d5ad8433ea4aa2467589f467d38683637e5baec"},"schema_version":"1.0"},"canonical_sha256":"e47d19de4fe245954a6dcfca9c6ddcb20998324611a046340de6eac442811f0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:19.370450Z","signature_b64":"UcVofzFZUSAbBb4M/cHfxAgucasZ1Vbw4FTcwHWXgj2LOVHobkTh5oYDGwVD5YSDgVTPZBVGtJRl6ZBEg2Q8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e47d19de4fe245954a6dcfca9c6ddcb20998324611a046340de6eac442811f0a","last_reissued_at":"2026-05-18T00:31:19.369584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:19.369584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09336","source_version":2,"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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTFuAyUN52sSd7DxyxDaviOUmW7TnUGNAoquYxr2Re3I/EyFgzp8FNOBXI8KBp9IbJzXpJANOw8IxrxF1gtfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:45:40.851979Z"},"content_sha256":"a55eac95513257e2f0d3ad2734ef8a998b0e1ac2cae2b2ae01bcaaa6dfb0f0fb","schema_version":"1.0","event_id":"sha256:a55eac95513257e2f0d3ad2734ef8a998b0e1ac2cae2b2ae01bcaaa6dfb0f0fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4R6RTXSP4JCZKSTNZ7FJY3O4WI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of types in sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","submitted_at":"2017-05-25T19:22:25Z","abstract_excerpt":"We prove that for every class of graphs $\\mathcal{C}$ which is nowhere dense, as defined by Nesetril and Ossona de Mendez, and for every first order formula $\\phi(\\bar x,\\bar y)$, whenever one draws a graph $G\\in \\mathcal{C}$ and a subset of its nodes $A$, the number of subsets of $A^{|\\bar y|}$ which are of the form $\\{\\bar v\\in A^{|\\bar y|}\\, \\colon\\, G\\models\\phi(\\bar u,\\bar v)\\}$ for some valuation $\\bar u$ of $\\bar x$ in $G$ is bounded by $\\mathcal{O}(|A|^{|\\bar x|+\\epsilon})$, for every $\\epsilon>0$. This provides optimal bounds on the VC-density of first-order definable set systems in n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09336","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"},"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:31:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8m2X3w+2LaIFxT9p2L+0uWdFUSSBypTvpqR9r2zGabIBvEHm/avOg1uMBf9+/A7c1OWq68Jlk23OzBDTwTjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:45:40.852553Z"},"content_sha256":"072ede858988406b1bebb744b8cfbb43be255f3c4ebb47faa74ec037cea91af3","schema_version":"1.0","event_id":"sha256:072ede858988406b1bebb744b8cfbb43be255f3c4ebb47faa74ec037cea91af3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/bundle.json","state_url":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/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-27T01:45:40Z","links":{"resolver":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI","bundle":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/bundle.json","state":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4R6RTXSP4JCZKSTNZ7FJY3O4WI","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":"356c93adabbb7b50dedebe649d5ad8433ea4aa2467589f467d38683637e5baec","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-25T19:22:25Z","title_canon_sha256":"58bff59b80e40c4a423f540306d3e862e8377b7df0faba5eb51729df7c41d0ef"},"schema_version":"1.0","source":{"id":"1705.09336","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09336","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09336v2","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09336","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"4R6RTXSP4JCZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4R6RTXSP4JCZKSTN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4R6RTXSP","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:072ede858988406b1bebb744b8cfbb43be255f3c4ebb47faa74ec037cea91af3","target":"graph","created_at":"2026-05-18T00:31:19Z","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 for every class of graphs $\\mathcal{C}$ which is nowhere dense, as defined by Nesetril and Ossona de Mendez, and for every first order formula $\\phi(\\bar x,\\bar y)$, whenever one draws a graph $G\\in \\mathcal{C}$ and a subset of its nodes $A$, the number of subsets of $A^{|\\bar y|}$ which are of the form $\\{\\bar v\\in A^{|\\bar y|}\\, \\colon\\, G\\models\\phi(\\bar u,\\bar v)\\}$ for some valuation $\\bar u$ of $\\bar x$ in $G$ is bounded by $\\mathcal{O}(|A|^{|\\bar x|+\\epsilon})$, for every $\\epsilon>0$. This provides optimal bounds on the VC-density of first-order definable set systems in n","authors_text":"Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-25T19:22:25Z","title":"On the number of types in sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09336","kind":"arxiv","version":2},"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:a55eac95513257e2f0d3ad2734ef8a998b0e1ac2cae2b2ae01bcaaa6dfb0f0fb","target":"record","created_at":"2026-05-18T00:31:19Z","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":"356c93adabbb7b50dedebe649d5ad8433ea4aa2467589f467d38683637e5baec","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-25T19:22:25Z","title_canon_sha256":"58bff59b80e40c4a423f540306d3e862e8377b7df0faba5eb51729df7c41d0ef"},"schema_version":"1.0","source":{"id":"1705.09336","kind":"arxiv","version":2}},"canonical_sha256":"e47d19de4fe245954a6dcfca9c6ddcb20998324611a046340de6eac442811f0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e47d19de4fe245954a6dcfca9c6ddcb20998324611a046340de6eac442811f0a","first_computed_at":"2026-05-18T00:31:19.369584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:19.369584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UcVofzFZUSAbBb4M/cHfxAgucasZ1Vbw4FTcwHWXgj2LOVHobkTh5oYDGwVD5YSDgVTPZBVGtJRl6ZBEg2Q8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:19.370450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09336","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a55eac95513257e2f0d3ad2734ef8a998b0e1ac2cae2b2ae01bcaaa6dfb0f0fb","sha256:072ede858988406b1bebb744b8cfbb43be255f3c4ebb47faa74ec037cea91af3"],"state_sha256":"0672bc83bfe8c2fda87479d60c029e31afd4968fda445178b1de0f13b443b3aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTQwbLNLZWu+1MD73yY3LJSwvZ9eYjgB3DdGtHN7LXQkQv0tWreUyQuEeU+qTqtvMV5bUuiQ9+QualMDDT/EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:45:40.855080Z","bundle_sha256":"2dddf759442ff1d1bcd8a8d1729db8b0b63557c7b6f73c6c561d6e29ab4a28b6"}}