{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6CYSEQNJHWHLK5VHJ5ELJ37VMF","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":"f6c1d3683d617187b99d5aca0ec96f55148b9108446f651911095d406443e6b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-14T16:11:38Z","title_canon_sha256":"b8ec5b821d47408b27b785d66c0cc50dff1eb196d14fd5a0a11d26468ddce40f"},"schema_version":"1.0","source":{"id":"1104.2816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2816","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2816v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2816","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"6CYSEQNJHWHL","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6CYSEQNJHWHLK5VH","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6CYSEQNJ","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:88c7dc4e286caa40ededf700eb9362c7397c573d9fd3470de89abefd5399048f","target":"graph","created_at":"2026-05-18T04:24:26Z","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":"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.","authors_text":"Marius Zimand","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-14T16:11:38Z","title":"On the optimal compression of sets in PSPACE"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2816","kind":"arxiv","version":1},"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:af6782e09aec36571cb8aee15e4bfd6975c5b423a6f46005517f3a0d97391be8","target":"record","created_at":"2026-05-18T04:24:26Z","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":"f6c1d3683d617187b99d5aca0ec96f55148b9108446f651911095d406443e6b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-14T16:11:38Z","title_canon_sha256":"b8ec5b821d47408b27b785d66c0cc50dff1eb196d14fd5a0a11d26468ddce40f"},"schema_version":"1.0","source":{"id":"1104.2816","kind":"arxiv","version":1}},"canonical_sha256":"f0b12241a93d8eb576a74f48b4eff561595c1b44d44918570dd16ee5bb02bbcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0b12241a93d8eb576a74f48b4eff561595c1b44d44918570dd16ee5bb02bbcf","first_computed_at":"2026-05-18T04:24:26.774890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:26.774890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MDA1Ri5kfIW8p6b3HGr2DjMQIGEYlLEf6wdL3zRxzY5S8uacxNZqm6D3UTARohXvPsFKSjO783uETvLTHhu4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:26.775665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af6782e09aec36571cb8aee15e4bfd6975c5b423a6f46005517f3a0d97391be8","sha256:88c7dc4e286caa40ededf700eb9362c7397c573d9fd3470de89abefd5399048f"],"state_sha256":"7ce893c25e3f3f8ad9d985e23b5e3bbf61e15a963f7cdfd294a9e23289f7dc93"}