{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FR6AAXB3NBAQZLEIQMM2ACY3HY","short_pith_number":"pith:FR6AAXB3","schema_version":"1.0","canonical_sha256":"2c7c005c3b68410cac888319a00b1b3e2bea857acab7ea3d8aba66f0d1fcbee9","source":{"kind":"arxiv","id":"1406.3646","version":2},"attestation_state":"computed","paper":{"title":"Finitary reducibility on equivalence relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Keng Meng Ng, Russell Miller","submitted_at":"2014-06-13T21:10:09Z","abstract_excerpt":"We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be $\\Pi_{n+2}$-complete under computable reducibility, we show that, for every $n$, there does exist a natural equivalence relation which is $\\Pi_{n+2}$-complete under finitary reducibility. We also show that our hierarchy of finitary reducibilities does not collapse, and illustrate how it sharpens certain known results. Al"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.3646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-13T21:10:09Z","cross_cats_sorted":[],"title_canon_sha256":"3ee9a34e0105a5587a203cfddbf57c906478fe87a5b9ee6764ca50ce9ec4ef0f","abstract_canon_sha256":"ac83cf9cd61e2ed35e197a8955d8f3558fed3aad8f3e545c6d39f840ec79ac34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.541266Z","signature_b64":"tK1l102zvC0ehnl6YlRWc46PxzW/mSFqKFlz0ubYfBVdD3cAmZw4npAvbHzLLBS+IRgcRKzlOHk5MFeqPZExCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c7c005c3b68410cac888319a00b1b3e2bea857acab7ea3d8aba66f0d1fcbee9","last_reissued_at":"2026-05-18T00:24:02.540885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.540885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finitary reducibility on equivalence relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Keng Meng Ng, Russell Miller","submitted_at":"2014-06-13T21:10:09Z","abstract_excerpt":"We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be $\\Pi_{n+2}$-complete under computable reducibility, we show that, for every $n$, there does exist a natural equivalence relation which is $\\Pi_{n+2}$-complete under finitary reducibility. We also show that our hierarchy of finitary reducibilities does not collapse, and illustrate how it sharpens certain known results. Al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3646","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.3646","created_at":"2026-05-18T00:24:02.540944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3646v2","created_at":"2026-05-18T00:24:02.540944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3646","created_at":"2026-05-18T00:24:02.540944+00:00"},{"alias_kind":"pith_short_12","alias_value":"FR6AAXB3NBAQ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FR6AAXB3NBAQZLEI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FR6AAXB3","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY","json":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY.json","graph_json":"https://pith.science/api/pith-number/FR6AAXB3NBAQZLEIQMM2ACY3HY/graph.json","events_json":"https://pith.science/api/pith-number/FR6AAXB3NBAQZLEIQMM2ACY3HY/events.json","paper":"https://pith.science/paper/FR6AAXB3"},"agent_actions":{"view_html":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY","download_json":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY.json","view_paper":"https://pith.science/paper/FR6AAXB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3646&json=true","fetch_graph":"https://pith.science/api/pith-number/FR6AAXB3NBAQZLEIQMM2ACY3HY/graph.json","fetch_events":"https://pith.science/api/pith-number/FR6AAXB3NBAQZLEIQMM2ACY3HY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY/action/storage_attestation","attest_author":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY/action/author_attestation","sign_citation":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY/action/citation_signature","submit_replication":"https://pith.science/pith/FR6AAXB3NBAQZLEIQMM2ACY3HY/action/replication_record"}},"created_at":"2026-05-18T00:24:02.540944+00:00","updated_at":"2026-05-18T00:24:02.540944+00:00"}