{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:LRGBQDAXJ3FLMOJ6SQIU4DJ5PV","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":"73cedb7915392db05f0d24d6e236c024087e82561d8cfc45d7d53b856642106c","cross_cats_sorted":[],"license":"","primary_cat":"math.LO","submitted_at":"1995-07-24T00:00:00Z","title_canon_sha256":"a9708ddecdc5e86eac98e764a69f9ea9f5002b372441bdfdc0f85c1cd8d3b7ab"},"schema_version":"1.0","source":{"id":"math/9507212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9507212","created_at":"2026-05-18T01:05:48Z"},{"alias_kind":"arxiv_version","alias_value":"math/9507212v1","created_at":"2026-05-18T01:05:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9507212","created_at":"2026-05-18T01:05:48Z"},{"alias_kind":"pith_short_12","alias_value":"LRGBQDAXJ3FL","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"LRGBQDAXJ3FLMOJ6","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"LRGBQDAX","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:164a5778dbfa2664aa84cc35ea785c2b2f99b5e7b8cc61e6637d42eb8bd3cf21","target":"graph","created_at":"2026-05-18T01:05:48Z","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":"A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of Shelah it is proved:\n - The complexity of the class in every regular uncountable $\\l>\\aleph_1$ is at least $\\lambda^+ + \\sup\\{\\mu^{\\aleph_0}:\\mu^+<\\lambda\\}$\n - For all regular uncountable $\\lambda>\\aleph_1$ there are $2^\\lambda$ pairwise non embeddable graphs in the class having strong homogeneity properties.\n - It is characterized when some invariants of a g","authors_text":"Menachem Kojman","cross_cats":[],"headline":"","license":"","primary_cat":"math.LO","submitted_at":"1995-07-24T00:00:00Z","title":"Representing embeddability as set inclusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9507212","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:64a7876994e7714834be3ab09313f71ad43b79815b3d5eccfde70350f63d13aa","target":"record","created_at":"2026-05-18T01:05:48Z","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":"73cedb7915392db05f0d24d6e236c024087e82561d8cfc45d7d53b856642106c","cross_cats_sorted":[],"license":"","primary_cat":"math.LO","submitted_at":"1995-07-24T00:00:00Z","title_canon_sha256":"a9708ddecdc5e86eac98e764a69f9ea9f5002b372441bdfdc0f85c1cd8d3b7ab"},"schema_version":"1.0","source":{"id":"math/9507212","kind":"arxiv","version":1}},"canonical_sha256":"5c4c180c174ecab6393e94114e0d3d7d570e47f8b3ee15a7fad68db87be41203","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c4c180c174ecab6393e94114e0d3d7d570e47f8b3ee15a7fad68db87be41203","first_computed_at":"2026-05-18T01:05:48.503293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:48.503293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"njTZnop+zEVPPX7KMZUZuEzxz6H0nrMDJ+Aebrh3vNhn10v5I7ZapiNUGQBPdI+B8JgBnqMAiXMQGdwtPUY9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:48.503725Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9507212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64a7876994e7714834be3ab09313f71ad43b79815b3d5eccfde70350f63d13aa","sha256:164a5778dbfa2664aa84cc35ea785c2b2f99b5e7b8cc61e6637d42eb8bd3cf21"],"state_sha256":"6b4539696e67e3ae2f9ac390b60d15565b3dd64f9740094809a8aa327610ce35"}