{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GYEHOFHLRAI56T2LQ5AAGHQ7WX","short_pith_number":"pith:GYEHOFHL","canonical_record":{"source":{"id":"1302.0580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-02-04T04:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"13296688e1e91b1949c4ee610d73aa3b224644434af87042ef53e3ff10211c9a","abstract_canon_sha256":"29ad43fc53f40cd5525547c27bd3c454b41356903b7a9879ff300e1e0e58415e"},"schema_version":"1.0"},"canonical_sha256":"36087714eb8811df4f4b8740031e1fb5cf1075bb1c1eb04542a6fbb401fc8a95","source":{"kind":"arxiv","id":"1302.0580","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GYEHOFHLRAI56T2LQ5AAGHQ7WX","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-02-04T04:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"13296688e1e91b1949c4ee610d73aa3b224644434af87042ef53e3ff10211c9a","abstract_canon_sha256":"29ad43fc53f40cd5525547c27bd3c454b41356903b7a9879ff300e1e0e58415e"},"schema_version":"1.0"},"canonical_sha256":"36087714eb8811df4f4b8740031e1fb5cf1075bb1c1eb04542a6fbb401fc8a95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.567445Z","signature_b64":"jyWuYeAQowVmK7Uaor9ooh9A22DPVUeJbHx3fw13qBOuJIjhlsZhXjlzKhycMOdeaToa8p1TGH2ocFqHUjg5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36087714eb8811df4f4b8740031e1fb5cf1075bb1c1eb04542a6fbb401fc8a95","last_reissued_at":"2026-05-18T00:24:02.567025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.567025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0580","source_version":2,"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-05-18T00:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+ICS+eOmMudcTxIcOZyIMl6KBH1m31IgI0zwVPuTTwR5MhDjvzi58AKDvMS5JSUBo/2pPUMOhBsChbVdXceAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:16:15.617972Z"},"content_sha256":"96aaddbbbbc9ff99c4670e60350771ddc3146310cbf8cfb349847b18313e6a97","schema_version":"1.0","event_id":"sha256:96aaddbbbbc9ff99c4670e60350771ddc3146310cbf8cfb349847b18313e6a97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GYEHOFHLRAI56T2LQ5AAGHQ7WX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of equivalence relations and preorders from computability theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andre Nies, Egor Ianovski, Keng Meng Ng, Russell Miller","submitted_at":"2013-02-04T04:02:20Z","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$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0580","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdtcKNRUbzC/04gZSfRW3Gha6q8e14/LCKwiO4W7nUatWblswvj1NG1De6GktDe4Gp1q3A29Zdg3nnfB8MZdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:16:15.618338Z"},"content_sha256":"ecd34bc2e04d0b3eaa89f0616a5590be014ef8b0aec0d8e65ec91f08ac9e2efe","schema_version":"1.0","event_id":"sha256:ecd34bc2e04d0b3eaa89f0616a5590be014ef8b0aec0d8e65ec91f08ac9e2efe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX/bundle.json","state_url":"https://pith.science/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX/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-06-03T08:16:15Z","links":{"resolver":"https://pith.science/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX","bundle":"https://pith.science/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX/bundle.json","state":"https://pith.science/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYEHOFHLRAI56T2LQ5AAGHQ7WX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEql6PM7vFmWK4F6lMPEZTFWaQubvrBjgGoXH9mqO9XF7gqbfDsSHE8dyZdB/o9J3eBvofBqwiCR9QwnjLzYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:16:15.620270Z","bundle_sha256":"e8c5b0de8f91d66c17d173e340eb299bac020c003640768535aba64a87cb4722"}}