{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QUEDVH2ZSWNMN5WPWU5VP2SPPB","short_pith_number":"pith:QUEDVH2Z","canonical_record":{"source":{"id":"1702.04779","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-02-15T21:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"4bad7b809c0fb3b63675fe18ae181ab7b0efa3dbdf4aa4057d461fc072126ac0","abstract_canon_sha256":"97f5085f7023b5179ffecfeacbc4b6b431c379e99f8e72a8d870016cfd7a6895"},"schema_version":"1.0"},"canonical_sha256":"85083a9f59959ac6f6cfb53b57ea4f7866e4ee4c461aaee45aeeccb11f8267ea","source":{"kind":"arxiv","id":"1702.04779","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04779","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04779v1","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04779","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"QUEDVH2ZSWNM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUEDVH2ZSWNMN5WP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUEDVH2Z","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QUEDVH2ZSWNMN5WPWU5VP2SPPB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04779","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-02-15T21:21:34Z","cross_cats_sorted":[],"title_canon_sha256":"4bad7b809c0fb3b63675fe18ae181ab7b0efa3dbdf4aa4057d461fc072126ac0","abstract_canon_sha256":"97f5085f7023b5179ffecfeacbc4b6b431c379e99f8e72a8d870016cfd7a6895"},"schema_version":"1.0"},"canonical_sha256":"85083a9f59959ac6f6cfb53b57ea4f7866e4ee4c461aaee45aeeccb11f8267ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:37.115192Z","signature_b64":"78lEWz0hC03M8Jatf6bsHJMJdneWKix9Xm5AK7Yx+GnGRBNq+VUh8jdfD15hlWRSmizyDKu2z0kUoznvsKT6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85083a9f59959ac6f6cfb53b57ea4f7866e4ee4c461aaee45aeeccb11f8267ea","last_reissued_at":"2026-05-18T00:50:37.114686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:37.114686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04779","source_version":1,"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:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4uxIXCdHUwV339uBs6nYgpIPabHDFW6IcsoQzdEuQVREZeiqM2RZcrByfuF0D9bf/4twoWwMZyH0PIYWevhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:56:02.069136Z"},"content_sha256":"97b5feca98c5c4adb1dd21296e6f06de49bdcafadf3f3de83e38cc582284ca7b","schema_version":"1.0","event_id":"sha256:97b5feca98c5c4adb1dd21296e6f06de49bdcafadf3f3de83e38cc582284ca7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QUEDVH2ZSWNMN5WPWU5VP2SPPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compression Complexity","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lance Fortnow, Stephen Fenner","submitted_at":"2017-02-15T21:21:34Z","abstract_excerpt":"The Kolmogorov complexity of x, denoted C(x), is the length of the shortest program that generates x. For such a simple definition, Kolmogorov complexity has a rich and deep theory, as well as applications to a wide variety of topics including learning theory, complexity lower bounds and SAT algorithms.\n  Kolmogorov complexity typically focuses on decompression, going from the compressed program to the original string. This paper develops a dual notion of compression, the mapping from a string to its compressed version. Typical lossless compression algorithms such as Lempel-Ziv or Huffman Enco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04779","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"},"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:50:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPrGfTGKlClX31QpzrNBDzHKPT13tnlyWVw+VYZE+fknfZasivJEMWVt1jXubNtG9uwVwkYcgwfXBLYcl1UjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:56:02.069765Z"},"content_sha256":"ca9d327e7959b88ecb1f8f43bd4842548961536711ee76c66e93205ec475b8b7","schema_version":"1.0","event_id":"sha256:ca9d327e7959b88ecb1f8f43bd4842548961536711ee76c66e93205ec475b8b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB/bundle.json","state_url":"https://pith.science/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB/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-27T09:56:02Z","links":{"resolver":"https://pith.science/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB","bundle":"https://pith.science/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB/bundle.json","state":"https://pith.science/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUEDVH2ZSWNMN5WPWU5VP2SPPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QUEDVH2ZSWNMN5WPWU5VP2SPPB","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":"97f5085f7023b5179ffecfeacbc4b6b431c379e99f8e72a8d870016cfd7a6895","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-02-15T21:21:34Z","title_canon_sha256":"4bad7b809c0fb3b63675fe18ae181ab7b0efa3dbdf4aa4057d461fc072126ac0"},"schema_version":"1.0","source":{"id":"1702.04779","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04779","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04779v1","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04779","created_at":"2026-05-18T00:50:37Z"},{"alias_kind":"pith_short_12","alias_value":"QUEDVH2ZSWNM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUEDVH2ZSWNMN5WP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUEDVH2Z","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:ca9d327e7959b88ecb1f8f43bd4842548961536711ee76c66e93205ec475b8b7","target":"graph","created_at":"2026-05-18T00:50:37Z","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":"The Kolmogorov complexity of x, denoted C(x), is the length of the shortest program that generates x. For such a simple definition, Kolmogorov complexity has a rich and deep theory, as well as applications to a wide variety of topics including learning theory, complexity lower bounds and SAT algorithms.\n  Kolmogorov complexity typically focuses on decompression, going from the compressed program to the original string. This paper develops a dual notion of compression, the mapping from a string to its compressed version. Typical lossless compression algorithms such as Lempel-Ziv or Huffman Enco","authors_text":"Lance Fortnow, Stephen Fenner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-02-15T21:21:34Z","title":"Compression Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04779","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:97b5feca98c5c4adb1dd21296e6f06de49bdcafadf3f3de83e38cc582284ca7b","target":"record","created_at":"2026-05-18T00:50:37Z","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":"97f5085f7023b5179ffecfeacbc4b6b431c379e99f8e72a8d870016cfd7a6895","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-02-15T21:21:34Z","title_canon_sha256":"4bad7b809c0fb3b63675fe18ae181ab7b0efa3dbdf4aa4057d461fc072126ac0"},"schema_version":"1.0","source":{"id":"1702.04779","kind":"arxiv","version":1}},"canonical_sha256":"85083a9f59959ac6f6cfb53b57ea4f7866e4ee4c461aaee45aeeccb11f8267ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85083a9f59959ac6f6cfb53b57ea4f7866e4ee4c461aaee45aeeccb11f8267ea","first_computed_at":"2026-05-18T00:50:37.114686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:37.114686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"78lEWz0hC03M8Jatf6bsHJMJdneWKix9Xm5AK7Yx+GnGRBNq+VUh8jdfD15hlWRSmizyDKu2z0kUoznvsKT6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:37.115192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04779","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97b5feca98c5c4adb1dd21296e6f06de49bdcafadf3f3de83e38cc582284ca7b","sha256:ca9d327e7959b88ecb1f8f43bd4842548961536711ee76c66e93205ec475b8b7"],"state_sha256":"20d63034eb76c417de730954602f4aa583c0afe48770c20ace7cf75d753ddbd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPG6nEToKOyzMMGxakFzZTtPCUX7HgmdfgPlQkF3Y7n6VlSbWbD01nNxHcCaL0Cre/KfhX9cta6R3thfzrF8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:56:02.073113Z","bundle_sha256":"f4bac40660eb6f43aa640410da16dc7e0fdf5642c36b054ab7324ee6075fa5c1"}}