{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WB57OFNLCZK7ZVHKYOJUQVK5MR","short_pith_number":"pith:WB57OFNL","canonical_record":{"source":{"id":"1005.1684","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T22:41:10Z","cross_cats_sorted":["cs.AI","cs.MM","cs.SD","math.IT"],"title_canon_sha256":"b6cea2d9d1921f285e3536288b4d06ae009b9c0c48badaea058d6a0be117fee8","abstract_canon_sha256":"52f2a0efbcab52ce28554101ff8d0920a0d270849b07ee4731840435dbd907fe"},"schema_version":"1.0"},"canonical_sha256":"b07bf715ab1655fcd4eac39348555d64494db1b8ab7475f25d5076391825c8e0","source":{"kind":"arxiv","id":"1005.1684","version":12},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1684","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1684v12","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1684","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"WB57OFNLCZK7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WB57OFNLCZK7ZVHK","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WB57OFNL","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WB57OFNLCZK7ZVHKYOJUQVK5MR","target":"record","payload":{"canonical_record":{"source":{"id":"1005.1684","kind":"arxiv","version":12},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T22:41:10Z","cross_cats_sorted":["cs.AI","cs.MM","cs.SD","math.IT"],"title_canon_sha256":"b6cea2d9d1921f285e3536288b4d06ae009b9c0c48badaea058d6a0be117fee8","abstract_canon_sha256":"52f2a0efbcab52ce28554101ff8d0920a0d270849b07ee4731840435dbd907fe"},"schema_version":"1.0"},"canonical_sha256":"b07bf715ab1655fcd4eac39348555d64494db1b8ab7475f25d5076391825c8e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:45.095643Z","signature_b64":"LZiRcIQ6i5ZdHUfltmrFu2TjjetFDPsou3oLiYeYzcJ465SJjfHeyOfKlClzP7pP4/YkfVCJRTwF191A3gmwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07bf715ab1655fcd4eac39348555d64494db1b8ab7475f25d5076391825c8e0","last_reissued_at":"2026-05-18T04:18:45.095059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:45.095059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.1684","source_version":12,"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-18T04:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Au/4F1LcwmGZX7oKJqJj/efAbMWtLtz5E8C5Pa1qZRG2JUisJhFFZGPJepycQJwWNuSGHvoT47j06efpV0BzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:11:46.638450Z"},"content_sha256":"253ac99d7045b12d7fbfc6f8caa61508591f8962eef65da7a4d76234958fad0d","schema_version":"1.0","event_id":"sha256:253ac99d7045b12d7fbfc6f8caa61508591f8962eef65da7a4d76234958fad0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WB57OFNLCZK7ZVHKYOJUQVK5MR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Macroscopic Complexity and Perceptual Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MM","cs.SD","math.IT"],"primary_cat":"cs.IT","authors_text":"John Scoville","submitted_at":"2010-05-10T22:41:10Z","abstract_excerpt":"The theoretical limits of 'lossy' data compression algorithms are considered. The complexity of an object as seen by a macroscopic observer is the size of the perceptual code which discards all information that can be lost without altering the perception of the specified observer. The complexity of this macroscopically observed state is the simplest description of any microstate comprising that macrostate. Inference and pattern recognition based on macrostate rather than microstate complexities will take advantage of the complexity of the macroscopic observer to ignore irrelevant noise."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1684","kind":"arxiv","version":12},"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-18T04:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uy04/+QQjFjEQdYj7ywMKboTKa79KT/aP4gkRRjRgrDtI5SuLYnOk38WYGUi3ddlKuDqhsBF0goT5bMFgjFYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:11:46.638791Z"},"content_sha256":"58d5917c140fe01b8f3942c585f9770e11a6ef9df95c319810537c1ec8389e5d","schema_version":"1.0","event_id":"sha256:58d5917c140fe01b8f3942c585f9770e11a6ef9df95c319810537c1ec8389e5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR/bundle.json","state_url":"https://pith.science/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR/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-06-06T19:11:46Z","links":{"resolver":"https://pith.science/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR","bundle":"https://pith.science/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR/bundle.json","state":"https://pith.science/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WB57OFNLCZK7ZVHKYOJUQVK5MR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WB57OFNLCZK7ZVHKYOJUQVK5MR","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":"52f2a0efbcab52ce28554101ff8d0920a0d270849b07ee4731840435dbd907fe","cross_cats_sorted":["cs.AI","cs.MM","cs.SD","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T22:41:10Z","title_canon_sha256":"b6cea2d9d1921f285e3536288b4d06ae009b9c0c48badaea058d6a0be117fee8"},"schema_version":"1.0","source":{"id":"1005.1684","kind":"arxiv","version":12}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1684","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1684v12","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1684","created_at":"2026-05-18T04:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"WB57OFNLCZK7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WB57OFNLCZK7ZVHK","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WB57OFNL","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:58d5917c140fe01b8f3942c585f9770e11a6ef9df95c319810537c1ec8389e5d","target":"graph","created_at":"2026-05-18T04:18:45Z","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 theoretical limits of 'lossy' data compression algorithms are considered. The complexity of an object as seen by a macroscopic observer is the size of the perceptual code which discards all information that can be lost without altering the perception of the specified observer. The complexity of this macroscopically observed state is the simplest description of any microstate comprising that macrostate. Inference and pattern recognition based on macrostate rather than microstate complexities will take advantage of the complexity of the macroscopic observer to ignore irrelevant noise.","authors_text":"John Scoville","cross_cats":["cs.AI","cs.MM","cs.SD","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T22:41:10Z","title":"On Macroscopic Complexity and Perceptual Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1684","kind":"arxiv","version":12},"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:253ac99d7045b12d7fbfc6f8caa61508591f8962eef65da7a4d76234958fad0d","target":"record","created_at":"2026-05-18T04:18:45Z","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":"52f2a0efbcab52ce28554101ff8d0920a0d270849b07ee4731840435dbd907fe","cross_cats_sorted":["cs.AI","cs.MM","cs.SD","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T22:41:10Z","title_canon_sha256":"b6cea2d9d1921f285e3536288b4d06ae009b9c0c48badaea058d6a0be117fee8"},"schema_version":"1.0","source":{"id":"1005.1684","kind":"arxiv","version":12}},"canonical_sha256":"b07bf715ab1655fcd4eac39348555d64494db1b8ab7475f25d5076391825c8e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b07bf715ab1655fcd4eac39348555d64494db1b8ab7475f25d5076391825c8e0","first_computed_at":"2026-05-18T04:18:45.095059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:45.095059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LZiRcIQ6i5ZdHUfltmrFu2TjjetFDPsou3oLiYeYzcJ465SJjfHeyOfKlClzP7pP4/YkfVCJRTwF191A3gmwAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:45.095643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1684","source_kind":"arxiv","source_version":12}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:253ac99d7045b12d7fbfc6f8caa61508591f8962eef65da7a4d76234958fad0d","sha256:58d5917c140fe01b8f3942c585f9770e11a6ef9df95c319810537c1ec8389e5d"],"state_sha256":"29193dcb3e64edcd4dfee9736c7d173df8617cbe2034f5f0e4ec8551cc32e0f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPTL5YRrEO6cC88olIUGqrDB9QtmaH+2YF3TNdsxQKF76klgUnaISnURShxD7sAsWeAky6LgqE/ZfRn6INUrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:11:46.640917Z","bundle_sha256":"66ee7909437dcc0283f1e7b881db951effb0d56f66d3554687152bb8cb476062"}}