{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4R6RTXSP4JCZKSTNZ7FJY3O4WI","short_pith_number":"pith:4R6RTXSP","schema_version":"1.0","canonical_sha256":"e47d19de4fe245954a6dcfca9c6ddcb20998324611a046340de6eac442811f0a","source":{"kind":"arxiv","id":"1705.09336","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.09336","created_at":"2026-05-18T00:31:19.369722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09336v2","created_at":"2026-05-18T00:31:19.369722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09336","created_at":"2026-05-18T00:31:19.369722+00:00"},{"alias_kind":"pith_short_12","alias_value":"4R6RTXSP4JCZ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4R6RTXSP4JCZKSTN","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4R6RTXSP","created_at":"2026-05-18T12:31:00.734936+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/4R6RTXSP4JCZKSTNZ7FJY3O4WI","json":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI.json","graph_json":"https://pith.science/api/pith-number/4R6RTXSP4JCZKSTNZ7FJY3O4WI/graph.json","events_json":"https://pith.science/api/pith-number/4R6RTXSP4JCZKSTNZ7FJY3O4WI/events.json","paper":"https://pith.science/paper/4R6RTXSP"},"agent_actions":{"view_html":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI","download_json":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI.json","view_paper":"https://pith.science/paper/4R6RTXSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09336&json=true","fetch_graph":"https://pith.science/api/pith-number/4R6RTXSP4JCZKSTNZ7FJY3O4WI/graph.json","fetch_events":"https://pith.science/api/pith-number/4R6RTXSP4JCZKSTNZ7FJY3O4WI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/action/storage_attestation","attest_author":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/action/author_attestation","sign_citation":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/action/citation_signature","submit_replication":"https://pith.science/pith/4R6RTXSP4JCZKSTNZ7FJY3O4WI/action/replication_record"}},"created_at":"2026-05-18T00:31:19.369722+00:00","updated_at":"2026-05-18T00:31:19.369722+00:00"}