{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HYNGRCBO4VEAHMS555GR5LKZXD","short_pith_number":"pith:HYNGRCBO","schema_version":"1.0","canonical_sha256":"3e1a68882ee54803b25def4d1ead59b8c0df74269772930336ced11fe401de6a","source":{"kind":"arxiv","id":"1806.10363","version":1},"attestation_state":"computed","paper":{"title":"Measuring the complexity of reductions between equivalence relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dino Rossegger, Ekaterina Fokina, Luca San Mauro","submitted_at":"2018-06-27T09:18:46Z","abstract_excerpt":"Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility spectrum of computably enumerable"},"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":"1806.10363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-06-27T09:18:46Z","cross_cats_sorted":[],"title_canon_sha256":"ce628d1c18f26d5680a9a1bf37899f34faebcaec2c91f878fbd558e248c9591f","abstract_canon_sha256":"e429d2b9c93c214605015c5af52b93231cddbfed58d284ef32369e4377ed0059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:55.721172Z","signature_b64":"kclCWWyc5vXIU0mOBWTvKKqbQiwCoTCMml7lElytiTnF0VKhx28gr5RjtZ1sSEL4JxHQT8/5w7kE/5PMkMUpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1a68882ee54803b25def4d1ead59b8c0df74269772930336ced11fe401de6a","last_reissued_at":"2026-05-18T00:03:55.720711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:55.720711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measuring the complexity of reductions between equivalence relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dino Rossegger, Ekaterina Fokina, Luca San Mauro","submitted_at":"2018-06-27T09:18:46Z","abstract_excerpt":"Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility spectrum of computably enumerable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10363","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":""},"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":"1806.10363","created_at":"2026-05-18T00:03:55.720786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10363v1","created_at":"2026-05-18T00:03:55.720786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10363","created_at":"2026-05-18T00:03:55.720786+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYNGRCBO4VEA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYNGRCBO4VEAHMS5","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYNGRCBO","created_at":"2026-05-18T12:32:28.185984+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/HYNGRCBO4VEAHMS555GR5LKZXD","json":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD.json","graph_json":"https://pith.science/api/pith-number/HYNGRCBO4VEAHMS555GR5LKZXD/graph.json","events_json":"https://pith.science/api/pith-number/HYNGRCBO4VEAHMS555GR5LKZXD/events.json","paper":"https://pith.science/paper/HYNGRCBO"},"agent_actions":{"view_html":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD","download_json":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD.json","view_paper":"https://pith.science/paper/HYNGRCBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10363&json=true","fetch_graph":"https://pith.science/api/pith-number/HYNGRCBO4VEAHMS555GR5LKZXD/graph.json","fetch_events":"https://pith.science/api/pith-number/HYNGRCBO4VEAHMS555GR5LKZXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD/action/storage_attestation","attest_author":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD/action/author_attestation","sign_citation":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD/action/citation_signature","submit_replication":"https://pith.science/pith/HYNGRCBO4VEAHMS555GR5LKZXD/action/replication_record"}},"created_at":"2026-05-18T00:03:55.720786+00:00","updated_at":"2026-05-18T00:03:55.720786+00:00"}