{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:OMDTTK7GXVFQ56QGONVKGN3OFY","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":"509f8d6b859485f6657327de0d9fbec837a3f4bf4a9ea9967695360d5381d58e","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-12-13T09:59:56Z","title_canon_sha256":"4ff8538b4353c474e761fc5834389a8194f26207fe2ab49a1bd5d95ef0cf298b"},"schema_version":"1.0","source":{"id":"cs/0612069","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0612069","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0612069v2","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0612069","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"OMDTTK7GXVFQ","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"OMDTTK7GXVFQ56QG","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"OMDTTK7G","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:11029e39adaf031868314414076304935d7af7b88200e85f165d0bcb2ad6fc13","target":"graph","created_at":"2026-05-18T00:53:03Z","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 relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a core, i.e., has an endomorphism such that the structure induced by its image is a core; moreover, the core is unique up to isomorphism. Weprove that every \\omega -categorical structure has a core. Moreover, every \\omega-categorical structure is homomorphically equivalent to a model-complete core, which is unique up to isomorphism, and which is finite or \\ome","authors_text":"Manuel Bodirsky","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2006-12-13T09:59:56Z","title":"Cores of Countably Categorical Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0612069","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:b0c603300be2a4874829a4a64d6ca00dc66e3e9eb33746c9b1f9df4d25f25378","target":"record","created_at":"2026-05-18T00:53:03Z","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":"509f8d6b859485f6657327de0d9fbec837a3f4bf4a9ea9967695360d5381d58e","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-12-13T09:59:56Z","title_canon_sha256":"4ff8538b4353c474e761fc5834389a8194f26207fe2ab49a1bd5d95ef0cf298b"},"schema_version":"1.0","source":{"id":"cs/0612069","kind":"arxiv","version":2}},"canonical_sha256":"730739abe6bd4b0efa06736aa3376e2e25d8d38f68070e06cb4ab9c71f62d47f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"730739abe6bd4b0efa06736aa3376e2e25d8d38f68070e06cb4ab9c71f62d47f","first_computed_at":"2026-05-18T00:53:03.263016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.263016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JwaOyQ62sKqEJeI92r2JOwfzYEeG7o3sVdJl/HQ5uE+5HF7SEWeDlch7f7PZgJTLFrG7eT2ZPsqUshKSVVq+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.263479Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0612069","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0c603300be2a4874829a4a64d6ca00dc66e3e9eb33746c9b1f9df4d25f25378","sha256:11029e39adaf031868314414076304935d7af7b88200e85f165d0bcb2ad6fc13"],"state_sha256":"7494d74332e1fcc9aab6bf351e2fa19a061d8c259032bc92dec4cb513b80abf3"}