{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6CYSEQNJHWHLK5VHJ5ELJ37VMF","short_pith_number":"pith:6CYSEQNJ","schema_version":"1.0","canonical_sha256":"f0b12241a93d8eb576a74f48b4eff561595c1b44d44918570dd16ee5bb02bbcf","source":{"kind":"arxiv","id":"1104.2816","version":1},"attestation_state":"computed","paper":{"title":"On the optimal compression of sets in PSPACE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2011-04-14T16:11:38Z","abstract_excerpt":"We show that if DTIME[2^{O(n)}] is not included in DSPACE[2^{o(n)}], then, for every set B in PSPACE, all strings x in B of length n can be represented by a string compressed(x) of length at most log (|B^{=n}|) + O(log n), such that a polynomial-time algorithm, given compressed(x), can distinguish x from all the other strings in B^{=n}. Modulo the O(log n) additive trem, this achieves the information-theoretical optimum for string compression."},"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":"1104.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-14T16:11:38Z","cross_cats_sorted":[],"title_canon_sha256":"b8ec5b821d47408b27b785d66c0cc50dff1eb196d14fd5a0a11d26468ddce40f","abstract_canon_sha256":"f6c1d3683d617187b99d5aca0ec96f55148b9108446f651911095d406443e6b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:26.775665Z","signature_b64":"MDA1Ri5kfIW8p6b3HGr2DjMQIGEYlLEf6wdL3zRxzY5S8uacxNZqm6D3UTARohXvPsFKSjO783uETvLTHhu4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0b12241a93d8eb576a74f48b4eff561595c1b44d44918570dd16ee5bb02bbcf","last_reissued_at":"2026-05-18T04:24:26.774890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:26.774890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the optimal compression of sets in PSPACE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marius Zimand","submitted_at":"2011-04-14T16:11:38Z","abstract_excerpt":"We show that if DTIME[2^{O(n)}] is not included in DSPACE[2^{o(n)}], then, for every set B in PSPACE, all strings x in B of length n can be represented by a string compressed(x) of length at most log (|B^{=n}|) + O(log n), such that a polynomial-time algorithm, given compressed(x), can distinguish x from all the other strings in B^{=n}. Modulo the O(log n) additive trem, this achieves the information-theoretical optimum for string compression."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2816","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":"1104.2816","created_at":"2026-05-18T04:24:26.774995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2816v1","created_at":"2026-05-18T04:24:26.774995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2816","created_at":"2026-05-18T04:24:26.774995+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CYSEQNJHWHL","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CYSEQNJHWHLK5VH","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CYSEQNJ","created_at":"2026-05-18T12:26:22.705136+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/6CYSEQNJHWHLK5VHJ5ELJ37VMF","json":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF.json","graph_json":"https://pith.science/api/pith-number/6CYSEQNJHWHLK5VHJ5ELJ37VMF/graph.json","events_json":"https://pith.science/api/pith-number/6CYSEQNJHWHLK5VHJ5ELJ37VMF/events.json","paper":"https://pith.science/paper/6CYSEQNJ"},"agent_actions":{"view_html":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF","download_json":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF.json","view_paper":"https://pith.science/paper/6CYSEQNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2816&json=true","fetch_graph":"https://pith.science/api/pith-number/6CYSEQNJHWHLK5VHJ5ELJ37VMF/graph.json","fetch_events":"https://pith.science/api/pith-number/6CYSEQNJHWHLK5VHJ5ELJ37VMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF/action/storage_attestation","attest_author":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF/action/author_attestation","sign_citation":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF/action/citation_signature","submit_replication":"https://pith.science/pith/6CYSEQNJHWHLK5VHJ5ELJ37VMF/action/replication_record"}},"created_at":"2026-05-18T04:24:26.774995+00:00","updated_at":"2026-05-18T04:24:26.774995+00:00"}