{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1998:HZ6AOATA2BPLXA67A22ZIAPSDX","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":"7bb94438e4ee9bcac51500df869fd074ed50cb642572566df8c56a3094ed05e0","cross_cats_sorted":[],"license":"","primary_cat":"math.LO","submitted_at":"1998-09-15T00:00:00Z","title_canon_sha256":"6cfa8e21cd034860ad84baa22956b8a482a840fa60dd65311aece8b1af9816f6"},"schema_version":"1.0","source":{"id":"math/9809202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9809202","created_at":"2026-05-18T01:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"math/9809202v1","created_at":"2026-05-18T01:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9809202","created_at":"2026-05-18T01:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"HZ6AOATA2BPL","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"HZ6AOATA2BPLXA67","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"HZ6AOATA","created_at":"2026-05-18T12:25:49Z"}],"graph_snapshots":[{"event_id":"sha256:6748bb1f796cf1fcbf80ad31d728eb7b9f6b551bd7411dbb620610e03de0f1ef","target":"graph","created_at":"2026-05-18T01:05:33Z","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 apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an associated''algebraic closure'' operator. The main applications are new examples of universal graphs with forbidden subgraphs and simplified treatments of some previously known cases.","authors_text":"Gregory Cherlin, Niandong Shi, Saharon Shelah","cross_cats":[],"headline":"","license":"","primary_cat":"math.LO","submitted_at":"1998-09-15T00:00:00Z","title":"Universal graphs with forbidden subgraphs and algebraic closure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9809202","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:fcb413f5d73a67f8559480a4fec82d9ddeeddce9b1965639fb821c1c3abefd40","target":"record","created_at":"2026-05-18T01:05:33Z","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":"7bb94438e4ee9bcac51500df869fd074ed50cb642572566df8c56a3094ed05e0","cross_cats_sorted":[],"license":"","primary_cat":"math.LO","submitted_at":"1998-09-15T00:00:00Z","title_canon_sha256":"6cfa8e21cd034860ad84baa22956b8a482a840fa60dd65311aece8b1af9816f6"},"schema_version":"1.0","source":{"id":"math/9809202","kind":"arxiv","version":1}},"canonical_sha256":"3e7c070260d05ebb83df06b59401f21dd064084c00a2c89578e4d790a542b72c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e7c070260d05ebb83df06b59401f21dd064084c00a2c89578e4d790a542b72c","first_computed_at":"2026-05-18T01:05:33.681873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:33.681873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u9XXXQgL0lqkrxScH/LJ6xwniM6ZR3NwgoDmP/3P4eamTm0JORCD57u7WcxkIlwJW7aXuHaMnGZ2rJNwAqOdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:33.682479Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9809202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcb413f5d73a67f8559480a4fec82d9ddeeddce9b1965639fb821c1c3abefd40","sha256:6748bb1f796cf1fcbf80ad31d728eb7b9f6b551bd7411dbb620610e03de0f1ef"],"state_sha256":"63d34beb9bc555b0eefe9e57ec8b6c00f16b5f7dd14e4d76f20c1413f16cfd92"}