{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ONTL3437J7THDNP33ZA5YFIEDD","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":"8307320ab4fe6dcebe3fed0a8673a2691523908cfa37b5744a8dddbc8df16bf1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-22T12:12:57Z","title_canon_sha256":"5e66498d62f2537d2f85d124158a009ce8f1416296be8e7fe1c1841bbe488421"},"schema_version":"1.0","source":{"id":"1407.5833","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5833","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5833v3","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5833","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"ONTL3437J7TH","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONTL3437J7THDNP3","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONTL3437","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:1cf9b49b0d5bbfaf017662a3f20b1e4d075dbb0b670581ccf51e081153e04e67","target":"graph","created_at":"2026-05-18T00:46:22Z","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":"An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We show a dichotomy for the size of the smallest identifying code in classes of graphs closed under induced subgraphs. Our dichotomy is derived from the VC-dimension of the considered class C, that is the maximum VC-dimension over the hypergraphs formed by the closed neighbourhoods of elements of C. We show that hereditary classes with infinite VC-dimension have infinitely many graphs with an identifying code of size logarithmic in ","authors_text":"Aline Parreau, Aur\\'elie Lagoutte, Nicolas Bousquet, St\\'ephan Thomass\\'e, Zhentao Li","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-22T12:12:57Z","title":"Identifying codes in hereditary classes of graphs and VC-dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5833","kind":"arxiv","version":3},"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:6bcc2ce94c5f68348e2da1376ad84f602f4a581619a2595a57921c318d22010b","target":"record","created_at":"2026-05-18T00:46:22Z","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":"8307320ab4fe6dcebe3fed0a8673a2691523908cfa37b5744a8dddbc8df16bf1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-22T12:12:57Z","title_canon_sha256":"5e66498d62f2537d2f85d124158a009ce8f1416296be8e7fe1c1841bbe488421"},"schema_version":"1.0","source":{"id":"1407.5833","kind":"arxiv","version":3}},"canonical_sha256":"7366bdf37f4fe671b5fbde41dc150418c1a181bfdb1f1d0a85b8e72f440c699a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7366bdf37f4fe671b5fbde41dc150418c1a181bfdb1f1d0a85b8e72f440c699a","first_computed_at":"2026-05-18T00:46:22.700658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:22.700658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I0+sjkWBdbyOKQG28g3zpGdAE6Ldh04aCHGzHdZ11JN9ZdIpSatmdMn4hB7me093lno7rhixJqss9wWsuefPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:22.701003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5833","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bcc2ce94c5f68348e2da1376ad84f602f4a581619a2595a57921c318d22010b","sha256:1cf9b49b0d5bbfaf017662a3f20b1e4d075dbb0b670581ccf51e081153e04e67"],"state_sha256":"3290b5744c9b824c47fe996c70129e0fd462c6d798260c8a956c36e5340ae8ab"}