{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GYEHOFHLRAI56T2LQ5AAGHQ7WX","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":"29ad43fc53f40cd5525547c27bd3c454b41356903b7a9879ff300e1e0e58415e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-02-04T04:02:20Z","title_canon_sha256":"13296688e1e91b1949c4ee610d73aa3b224644434af87042ef53e3ff10211c9a"},"schema_version":"1.0","source":{"id":"1302.0580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0580","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0580v2","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0580","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"GYEHOFHLRAI5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"GYEHOFHLRAI56T2L","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"GYEHOFHL","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ecd34bc2e04d0b3eaa89f0616a5590be014ef8b0aec0d8e65ec91f08ac9e2efe","target":"graph","created_at":"2026-05-18T00:24:02Z","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 study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\\le S \\iff \\ex f \\, \\forall x, y \\, [xRy \\lra f(x) Sf(y)]. $ Here $f$ is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and $f$ must be computable. We show that there is a $\\Pi_1$-complete equivalence relation, but no $\\Pi k$-complete for $k \\ge 2$.\n  We show that $\\Sigma k$ preorders arising naturally in the above-mentioned areas are $\\Sigma k$-","authors_text":"Andre Nies, Egor Ianovski, Keng Meng Ng, Russell Miller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-02-04T04:02:20Z","title":"Complexity of equivalence relations and preorders from computability theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0580","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:96aaddbbbbc9ff99c4670e60350771ddc3146310cbf8cfb349847b18313e6a97","target":"record","created_at":"2026-05-18T00:24:02Z","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":"29ad43fc53f40cd5525547c27bd3c454b41356903b7a9879ff300e1e0e58415e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-02-04T04:02:20Z","title_canon_sha256":"13296688e1e91b1949c4ee610d73aa3b224644434af87042ef53e3ff10211c9a"},"schema_version":"1.0","source":{"id":"1302.0580","kind":"arxiv","version":2}},"canonical_sha256":"36087714eb8811df4f4b8740031e1fb5cf1075bb1c1eb04542a6fbb401fc8a95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36087714eb8811df4f4b8740031e1fb5cf1075bb1c1eb04542a6fbb401fc8a95","first_computed_at":"2026-05-18T00:24:02.567025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:02.567025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jyWuYeAQowVmK7Uaor9ooh9A22DPVUeJbHx3fw13qBOuJIjhlsZhXjlzKhycMOdeaToa8p1TGH2ocFqHUjg5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:02.567445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96aaddbbbbc9ff99c4670e60350771ddc3146310cbf8cfb349847b18313e6a97","sha256:ecd34bc2e04d0b3eaa89f0616a5590be014ef8b0aec0d8e65ec91f08ac9e2efe"],"state_sha256":"17c4622a779528c02577766ecf983ebe9938b9165393ae83455e8cf532e4765a"}