{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WDJBLIJQM2IIXXK2L7DFJOCVGM","short_pith_number":"pith:WDJBLIJQ","schema_version":"1.0","canonical_sha256":"b0d215a13066908bdd5a5fc654b855333b72f7de8dda75ca175d248709d7d982","source":{"kind":"arxiv","id":"1611.01696","version":6},"attestation_state":"computed","paper":{"title":"Closure and Nonclosure Properties of the Compressible and Rankable Sets","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, Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon","submitted_at":"2016-11-05T20:31:58Z","abstract_excerpt":"The rankable and compressible sets have been studied for more than a quarter of a century, ever since Allender [1] and Goldberg and Sipser [6] introduced the formal study of polynomial-time ranking. Yet even after all that time, whether the rankable and compressible sets are closed under the most important boolean and other operations remains essentially unexplored. The present paper studies these questions for both polynomial-time and recursion-theoretic compression and ranking, and for almost every case arrives at a Closed, a Not-Closed, or a Closed-Iff-Well-Known-Complexity-Classes-Collapse"},"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":"1611.01696","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-05T20:31:58Z","cross_cats_sorted":["cs.CC","cs.FL","math.LO"],"title_canon_sha256":"1592ae2d0cd191037565193de17b3f46f1c632367d2950dc2e41a5fef679498b","abstract_canon_sha256":"ec500c82be62159f69a237e0b08aabad5eaedaf9a1b00cda5cf98db490e8f6ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:53.728702Z","signature_b64":"HCFuDryVfzxlNcuOwL38zIK3vUD0uK7BcvtrF83xV0EXOeFp0dpWWYHhF2l51IAp7eSiKi/w3OQO44mOkuLFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d215a13066908bdd5a5fc654b855333b72f7de8dda75ca175d248709d7d982","last_reissued_at":"2026-05-18T00:01:53.728255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:53.728255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closure and Nonclosure Properties of the Compressible and Rankable Sets","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, Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon","submitted_at":"2016-11-05T20:31:58Z","abstract_excerpt":"The rankable and compressible sets have been studied for more than a quarter of a century, ever since Allender [1] and Goldberg and Sipser [6] introduced the formal study of polynomial-time ranking. Yet even after all that time, whether the rankable and compressible sets are closed under the most important boolean and other operations remains essentially unexplored. The present paper studies these questions for both polynomial-time and recursion-theoretic compression and ranking, and for almost every case arrives at a Closed, a Not-Closed, or a Closed-Iff-Well-Known-Complexity-Classes-Collapse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01696","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":"1611.01696","created_at":"2026-05-18T00:01:53.728324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01696v6","created_at":"2026-05-18T00:01:53.728324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01696","created_at":"2026-05-18T00:01:53.728324+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDJBLIJQM2II","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDJBLIJQM2IIXXK2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDJBLIJQ","created_at":"2026-05-18T12:30:48.956258+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/WDJBLIJQM2IIXXK2L7DFJOCVGM","json":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM.json","graph_json":"https://pith.science/api/pith-number/WDJBLIJQM2IIXXK2L7DFJOCVGM/graph.json","events_json":"https://pith.science/api/pith-number/WDJBLIJQM2IIXXK2L7DFJOCVGM/events.json","paper":"https://pith.science/paper/WDJBLIJQ"},"agent_actions":{"view_html":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM","download_json":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM.json","view_paper":"https://pith.science/paper/WDJBLIJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01696&json=true","fetch_graph":"https://pith.science/api/pith-number/WDJBLIJQM2IIXXK2L7DFJOCVGM/graph.json","fetch_events":"https://pith.science/api/pith-number/WDJBLIJQM2IIXXK2L7DFJOCVGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM/action/storage_attestation","attest_author":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM/action/author_attestation","sign_citation":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM/action/citation_signature","submit_replication":"https://pith.science/pith/WDJBLIJQM2IIXXK2L7DFJOCVGM/action/replication_record"}},"created_at":"2026-05-18T00:01:53.728324+00:00","updated_at":"2026-05-18T00:01:53.728324+00:00"}