{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZKNSTC347RHAGP5W4WQPAOWTXA","short_pith_number":"pith:ZKNSTC34","schema_version":"1.0","canonical_sha256":"ca9b298b7cfc4e033fb6e5a0f03ad3b80850c2c31adaec5ffcc8e613fb74db82","source":{"kind":"arxiv","id":"1610.01185","version":6},"attestation_state":"computed","paper":{"title":"Recursion-Theoretic Ranking and Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.LO"],"primary_cat":"cs.LO","authors_text":"Daniel Rubery, Lane A. Hemaspaandra","submitted_at":"2016-10-04T20:18:40Z","abstract_excerpt":"For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\\Sigma^*$? And for which sets A does there exist such a mapping that respects the lexicographical ordering within A? Both cases are types of perfect, minimal hash functions. The complexity-theoretic versions of these notions are known as compression functions and ranking functions. The present paper defines and studies the recursion-theoretic versions of compression and ranking functions, and in particular studi"},"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":"1610.01185","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T20:18:40Z","cross_cats_sorted":["cs.CC","cs.FL","math.LO"],"title_canon_sha256":"911625e8e32d22e3c728573caf5efaa0025e641a40e977619cac3708004543b0","abstract_canon_sha256":"f05932fec1bf738e0a80281bf1e9542795cbfff6ef498fdd850511329c35be56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:01.847295Z","signature_b64":"65LqaU4rwBSBF2r7s86UoO9TG/Y+6EPmNHSd7g8CrKMG26+CxYXDqFM7rveeIeXvto8nFNmf88DC3A4gKKNKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca9b298b7cfc4e033fb6e5a0f03ad3b80850c2c31adaec5ffcc8e613fb74db82","last_reissued_at":"2026-05-18T00:29:01.846844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:01.846844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursion-Theoretic Ranking and Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.LO"],"primary_cat":"cs.LO","authors_text":"Daniel Rubery, Lane A. Hemaspaandra","submitted_at":"2016-10-04T20:18:40Z","abstract_excerpt":"For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\\Sigma^*$? And for which sets A does there exist such a mapping that respects the lexicographical ordering within A? Both cases are types of perfect, minimal hash functions. The complexity-theoretic versions of these notions are known as compression functions and ranking functions. The present paper defines and studies the recursion-theoretic versions of compression and ranking functions, and in particular studi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01185","kind":"arxiv","version":6},"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":"1610.01185","created_at":"2026-05-18T00:29:01.846917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01185v6","created_at":"2026-05-18T00:29:01.846917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01185","created_at":"2026-05-18T00:29:01.846917+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKNSTC347RHA","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKNSTC347RHAGP5W","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKNSTC34","created_at":"2026-05-18T12:30:53.716459+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/ZKNSTC347RHAGP5W4WQPAOWTXA","json":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA.json","graph_json":"https://pith.science/api/pith-number/ZKNSTC347RHAGP5W4WQPAOWTXA/graph.json","events_json":"https://pith.science/api/pith-number/ZKNSTC347RHAGP5W4WQPAOWTXA/events.json","paper":"https://pith.science/paper/ZKNSTC34"},"agent_actions":{"view_html":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA","download_json":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA.json","view_paper":"https://pith.science/paper/ZKNSTC34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01185&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKNSTC347RHAGP5W4WQPAOWTXA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKNSTC347RHAGP5W4WQPAOWTXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/action/storage_attestation","attest_author":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/action/author_attestation","sign_citation":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/action/citation_signature","submit_replication":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/action/replication_record"}},"created_at":"2026-05-18T00:29:01.846917+00:00","updated_at":"2026-05-18T00:29:01.846917+00:00"}