{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:UBRWKOBW6VEAKF7OJE6DKPAQXL","short_pith_number":"pith:UBRWKOBW","canonical_record":{"source":{"id":"0805.1887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2008-05-13T17:15:36Z","cross_cats_sorted":[],"title_canon_sha256":"bda3e43ed7605f6c6e72bf73312bc0b5b715bbdb947dea53c3c0d8105ca11b02","abstract_canon_sha256":"5f81df7a83d3ec0b03b2928b326304e26011183e7ed95ba8331677384ef17319"},"schema_version":"1.0"},"canonical_sha256":"a063653836f5480517ee493c353c10baf7ae262a0857889295253dd9acdab7fa","source":{"kind":"arxiv","id":"0805.1887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1887","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1887v1","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1887","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"UBRWKOBW6VEA","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"pith_short_16","alias_value":"UBRWKOBW6VEAKF7O","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"pith_short_8","alias_value":"UBRWKOBW","created_at":"2026-07-04T15:11:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:UBRWKOBW6VEAKF7OJE6DKPAQXL","target":"record","payload":{"canonical_record":{"source":{"id":"0805.1887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2008-05-13T17:15:36Z","cross_cats_sorted":[],"title_canon_sha256":"bda3e43ed7605f6c6e72bf73312bc0b5b715bbdb947dea53c3c0d8105ca11b02","abstract_canon_sha256":"5f81df7a83d3ec0b03b2928b326304e26011183e7ed95ba8331677384ef17319"},"schema_version":"1.0"},"canonical_sha256":"a063653836f5480517ee493c353c10baf7ae262a0857889295253dd9acdab7fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:32.630355Z","signature_b64":"uu90IqY4CrPluD1VU5pVMf1BR34xo1lKfzLB9RznAUG8yObhVcpOm6F2vYC9VqjB7jZW6MjWo97sc/8XdzsmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a063653836f5480517ee493c353c10baf7ae262a0857889295253dd9acdab7fa","last_reissued_at":"2026-07-04T15:11:32.629925Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:32.629925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.1887","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T15:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sYfGChFRTHX816sdUcjetbXHH9yDgR4gSYieEZHsnI7o7hhnz0yn//VNH4MsTpmNqnFnoSZvl3G3WdHsrE3EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:02:40.247971Z"},"content_sha256":"98beecf1e0a7dd1b421c60aedd11aafdbbe216286aad57a2b1812db916fb4a41","schema_version":"1.0","event_id":"sha256:98beecf1e0a7dd1b421c60aedd11aafdbbe216286aad57a2b1812db916fb4a41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:UBRWKOBW6VEAKF7OJE6DKPAQXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective categoricity of equivalence Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"A. Morozov, D. Cenzer, V. S. Harizanov, W. Calvert","submitted_at":"2008-05-13T17:15:36Z","abstract_excerpt":"An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\\Delta^0_\\alpha$ categorical if for any computable structure B isomorphic to A there is a $\\Delta^0_\\alpha$ function witnessing that the two are isomorphic.\n  The present paper gives an exact characterization of $\\Delta^0_\\alpha$ equivalence structures where $\\alpha = 1$ or $\\alpha \\geq 3$. Extensive results for $\\alpha = 2$ are also given, and open cases are exhaustively described."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1887","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0805.1887/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T15:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERRR32h6xeEHepQfz5OMSHGMbabMIXQMM049ACP4kREnfatufG0GKXB8bb+QbBSgzyCAaSaQrXvIp7ZtgUi5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:02:40.248616Z"},"content_sha256":"91fd896b0d0e6463495490a4e9255c261061c88b930884b00f2948326b31483c","schema_version":"1.0","event_id":"sha256:91fd896b0d0e6463495490a4e9255c261061c88b930884b00f2948326b31483c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL/bundle.json","state_url":"https://pith.science/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T00:02:40Z","links":{"resolver":"https://pith.science/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL","bundle":"https://pith.science/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL/bundle.json","state":"https://pith.science/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBRWKOBW6VEAKF7OJE6DKPAQXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:UBRWKOBW6VEAKF7OJE6DKPAQXL","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":"5f81df7a83d3ec0b03b2928b326304e26011183e7ed95ba8331677384ef17319","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2008-05-13T17:15:36Z","title_canon_sha256":"bda3e43ed7605f6c6e72bf73312bc0b5b715bbdb947dea53c3c0d8105ca11b02"},"schema_version":"1.0","source":{"id":"0805.1887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1887","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1887v1","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1887","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"UBRWKOBW6VEA","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"pith_short_16","alias_value":"UBRWKOBW6VEAKF7O","created_at":"2026-07-04T15:11:32Z"},{"alias_kind":"pith_short_8","alias_value":"UBRWKOBW","created_at":"2026-07-04T15:11:32Z"}],"graph_snapshots":[{"event_id":"sha256:91fd896b0d0e6463495490a4e9255c261061c88b930884b00f2948326b31483c","target":"graph","created_at":"2026-07-04T15:11:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0805.1887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\\Delta^0_\\alpha$ categorical if for any computable structure B isomorphic to A there is a $\\Delta^0_\\alpha$ function witnessing that the two are isomorphic.\n  The present paper gives an exact characterization of $\\Delta^0_\\alpha$ equivalence structures where $\\alpha = 1$ or $\\alpha \\geq 3$. Extensive results for $\\alpha = 2$ are also given, and open cases are exhaustively described.","authors_text":"A. Morozov, D. Cenzer, V. S. Harizanov, W. Calvert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2008-05-13T17:15:36Z","title":"Effective categoricity of equivalence Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1887","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:98beecf1e0a7dd1b421c60aedd11aafdbbe216286aad57a2b1812db916fb4a41","target":"record","created_at":"2026-07-04T15:11:32Z","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":"5f81df7a83d3ec0b03b2928b326304e26011183e7ed95ba8331677384ef17319","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2008-05-13T17:15:36Z","title_canon_sha256":"bda3e43ed7605f6c6e72bf73312bc0b5b715bbdb947dea53c3c0d8105ca11b02"},"schema_version":"1.0","source":{"id":"0805.1887","kind":"arxiv","version":1}},"canonical_sha256":"a063653836f5480517ee493c353c10baf7ae262a0857889295253dd9acdab7fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a063653836f5480517ee493c353c10baf7ae262a0857889295253dd9acdab7fa","first_computed_at":"2026-07-04T15:11:32.629925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:32.629925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uu90IqY4CrPluD1VU5pVMf1BR34xo1lKfzLB9RznAUG8yObhVcpOm6F2vYC9VqjB7jZW6MjWo97sc/8XdzsmCw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:32.630355Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.1887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98beecf1e0a7dd1b421c60aedd11aafdbbe216286aad57a2b1812db916fb4a41","sha256:91fd896b0d0e6463495490a4e9255c261061c88b930884b00f2948326b31483c"],"state_sha256":"4cc1874eae9e37ce35e264e1945fb7225d11d08dbd8ad5bea4c67af4025d2505"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUWalBIRIN45NQ+7G0uKp5ZIXPEslAYnLSyEyfhXRNduEYmbRH+3xGUSkm5TuI8u/bBy8maZYDvWMfbgjtCJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:02:40.287039Z","bundle_sha256":"eefd7a21dac39ce02f1062855d526df16ceb3c7d190fc898976e74e94306180f"}}