{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZKNSTC347RHAGP5W4WQPAOWTXA","short_pith_number":"pith:ZKNSTC34","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"},"canonical_sha256":"ca9b298b7cfc4e033fb6e5a0f03ad3b80850c2c31adaec5ffcc8e613fb74db82","source":{"kind":"arxiv","id":"1610.01185","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01185","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01185v6","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01185","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZKNSTC347RHA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZKNSTC347RHAGP5W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZKNSTC34","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZKNSTC347RHAGP5W4WQPAOWTXA","target":"record","payload":{"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"},"canonical_sha256":"ca9b298b7cfc4e033fb6e5a0f03ad3b80850c2c31adaec5ffcc8e613fb74db82","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"},"source_kind":"arxiv","source_id":"1610.01185","source_version":6,"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:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljxZqOKC1rFfmwMsc2FvzZ2bq8XjZQQPhYjxo+nxVOzMgKk/rBB0g/cXPvi9gAU/NaO8UTBcWgqCHq7selg7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:54:59.022333Z"},"content_sha256":"9a44bf919a6263daf9980e27059ef4cd29d6582f34cb1165912d47842212dadd","schema_version":"1.0","event_id":"sha256:9a44bf919a6263daf9980e27059ef4cd29d6582f34cb1165912d47842212dadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZKNSTC347RHAGP5W4WQPAOWTXA","target":"graph","payload":{"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"},"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:29:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfrkUJoSb5o3F71jLa9hKjDUshop8O3Vm1UZxrbZgt3N/kEif+k9WFBykw01CHSqUax9bYtyEQtf7T3La4glDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:54:59.022990Z"},"content_sha256":"ff9c6cd09ef438c0678d71b97995a662a3b49552678a04f1028f294c364d607b","schema_version":"1.0","event_id":"sha256:ff9c6cd09ef438c0678d71b97995a662a3b49552678a04f1028f294c364d607b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/bundle.json","state_url":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/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-05-27T05:54:59Z","links":{"resolver":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA","bundle":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/bundle.json","state":"https://pith.science/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKNSTC347RHAGP5W4WQPAOWTXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZKNSTC347RHAGP5W4WQPAOWTXA","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":"f05932fec1bf738e0a80281bf1e9542795cbfff6ef498fdd850511329c35be56","cross_cats_sorted":["cs.CC","cs.FL","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T20:18:40Z","title_canon_sha256":"911625e8e32d22e3c728573caf5efaa0025e641a40e977619cac3708004543b0"},"schema_version":"1.0","source":{"id":"1610.01185","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01185","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01185v6","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01185","created_at":"2026-05-18T00:29:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZKNSTC347RHA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZKNSTC347RHAGP5W","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZKNSTC34","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:ff9c6cd09ef438c0678d71b97995a662a3b49552678a04f1028f294c364d607b","target":"graph","created_at":"2026-05-18T00:29:01Z","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":"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","authors_text":"Daniel Rubery, Lane A. Hemaspaandra","cross_cats":["cs.CC","cs.FL","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T20:18:40Z","title":"Recursion-Theoretic Ranking and Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01185","kind":"arxiv","version":6},"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:9a44bf919a6263daf9980e27059ef4cd29d6582f34cb1165912d47842212dadd","target":"record","created_at":"2026-05-18T00:29:01Z","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":"f05932fec1bf738e0a80281bf1e9542795cbfff6ef498fdd850511329c35be56","cross_cats_sorted":["cs.CC","cs.FL","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-04T20:18:40Z","title_canon_sha256":"911625e8e32d22e3c728573caf5efaa0025e641a40e977619cac3708004543b0"},"schema_version":"1.0","source":{"id":"1610.01185","kind":"arxiv","version":6}},"canonical_sha256":"ca9b298b7cfc4e033fb6e5a0f03ad3b80850c2c31adaec5ffcc8e613fb74db82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca9b298b7cfc4e033fb6e5a0f03ad3b80850c2c31adaec5ffcc8e613fb74db82","first_computed_at":"2026-05-18T00:29:01.846844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:01.846844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"65LqaU4rwBSBF2r7s86UoO9TG/Y+6EPmNHSd7g8CrKMG26+CxYXDqFM7rveeIeXvto8nFNmf88DC3A4gKKNKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:01.847295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01185","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a44bf919a6263daf9980e27059ef4cd29d6582f34cb1165912d47842212dadd","sha256:ff9c6cd09ef438c0678d71b97995a662a3b49552678a04f1028f294c364d607b"],"state_sha256":"eea95058cda61b178a4b43100c2a7c971342279095c22185684bf97c48c63830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPyLCVSBLL8ho81vKt0yT/WnBKpn9sK5XC4Xe9sDVOvIJ2QxDpMuxNZu1ZuYUtMdzzAQJigqtZgylM3rJcWXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:54:59.026631Z","bundle_sha256":"c467e6ee8b0e7fd6447b13a61f6295b88ec4d4b3edf0c051c47d37c7ddf8cb50"}}