{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HMDDDOI34SDGOPDGTW347J6SOG","short_pith_number":"pith:HMDDDOI3","canonical_record":{"source":{"id":"1005.2254","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-13T03:45:44Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"79b6cc115d471e94b7191f7fdbc2c31a0d12d37bc2f0ff3aa5717949eedfa8e3","abstract_canon_sha256":"2a043e5c000c4638e6ccd3207422aa1adc89a89baf7c7d866219ead8a5e85753"},"schema_version":"1.0"},"canonical_sha256":"3b0631b91be486673c669db7cfa7d271bcba471a8444582214a4241cdefe0ac6","source":{"kind":"arxiv","id":"1005.2254","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2254","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2254v9","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2254","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"pith_short_12","alias_value":"HMDDDOI34SDG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HMDDDOI34SDGOPDG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HMDDDOI3","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HMDDDOI34SDGOPDGTW347J6SOG","target":"record","payload":{"canonical_record":{"source":{"id":"1005.2254","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-13T03:45:44Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"79b6cc115d471e94b7191f7fdbc2c31a0d12d37bc2f0ff3aa5717949eedfa8e3","abstract_canon_sha256":"2a043e5c000c4638e6ccd3207422aa1adc89a89baf7c7d866219ead8a5e85753"},"schema_version":"1.0"},"canonical_sha256":"3b0631b91be486673c669db7cfa7d271bcba471a8444582214a4241cdefe0ac6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:55.057393Z","signature_b64":"KOWcLzMIljMY7ycHEQwr0pwBWFvrxyztEhMqF/1NC6DihXMzu9Kyx+AjhinqIRjbovfDGj7PmpTii2Dg4OwPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0631b91be486673c669db7cfa7d271bcba471a8444582214a4241cdefe0ac6","last_reissued_at":"2026-05-18T04:12:55.056915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:55.056915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.2254","source_version":9,"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:12:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Sbktcf2qug/EZZRvrY6P8wz8odSMJ0KAGqfu9ypYIGkaZyUrZsckENgIzpE+0QfEomZ1HeoW8Pq5oKPPcqdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:36:36.859350Z"},"content_sha256":"0b46d0bcab2685e9b8f2266a650cd1a0fe54f9c1a6e54388566d5bdf4e0b3cd2","schema_version":"1.0","event_id":"sha256:0b46d0bcab2685e9b8f2266a650cd1a0fe54f9c1a6e54388566d5bdf4e0b3cd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HMDDDOI34SDGOPDGTW347J6SOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Universal Complexity Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"John Scoville","submitted_at":"2010-05-13T03:45:44Z","abstract_excerpt":"We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A binary string is classified as a fixed point of its automorphism group; the irreducible representation of this group is the string's universal covering group. Such a measure may be used to test the quasi-randomness of binary sequences with regard to first-order set membership. Next, strings over general alphabets are considered. The complexity of a general str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2254","kind":"arxiv","version":9},"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:12:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nIxBD4Woc2vjQIOlAM4ap7oGcke+iM8dGF9Ir0r5LmvY2HPtV+qcgPuQPOeCk+HhmKuSsH+gQYtaigKffx3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:36:36.859748Z"},"content_sha256":"71c03955a415ff71acfe821f003e78558de32079cba2520bb2ce20eb25813d00","schema_version":"1.0","event_id":"sha256:71c03955a415ff71acfe821f003e78558de32079cba2520bb2ce20eb25813d00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/bundle.json","state_url":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMDDDOI34SDGOPDGTW347J6SOG/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-07T04:36:36Z","links":{"resolver":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG","bundle":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/bundle.json","state":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMDDDOI34SDGOPDGTW347J6SOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HMDDDOI34SDGOPDGTW347J6SOG","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":"2a043e5c000c4638e6ccd3207422aa1adc89a89baf7c7d866219ead8a5e85753","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-13T03:45:44Z","title_canon_sha256":"79b6cc115d471e94b7191f7fdbc2c31a0d12d37bc2f0ff3aa5717949eedfa8e3"},"schema_version":"1.0","source":{"id":"1005.2254","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2254","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2254v9","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2254","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"pith_short_12","alias_value":"HMDDDOI34SDG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HMDDDOI34SDGOPDG","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HMDDDOI3","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:71c03955a415ff71acfe821f003e78558de32079cba2520bb2ce20eb25813d00","target":"graph","created_at":"2026-05-18T04:12:55Z","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 relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A binary string is classified as a fixed point of its automorphism group; the irreducible representation of this group is the string's universal covering group. Such a measure may be used to test the quasi-randomness of binary sequences with regard to first-order set membership. Next, strings over general alphabets are considered. The complexity of a general str","authors_text":"John Scoville","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-13T03:45:44Z","title":"On Universal Complexity Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2254","kind":"arxiv","version":9},"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:0b46d0bcab2685e9b8f2266a650cd1a0fe54f9c1a6e54388566d5bdf4e0b3cd2","target":"record","created_at":"2026-05-18T04:12:55Z","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":"2a043e5c000c4638e6ccd3207422aa1adc89a89baf7c7d866219ead8a5e85753","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-13T03:45:44Z","title_canon_sha256":"79b6cc115d471e94b7191f7fdbc2c31a0d12d37bc2f0ff3aa5717949eedfa8e3"},"schema_version":"1.0","source":{"id":"1005.2254","kind":"arxiv","version":9}},"canonical_sha256":"3b0631b91be486673c669db7cfa7d271bcba471a8444582214a4241cdefe0ac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b0631b91be486673c669db7cfa7d271bcba471a8444582214a4241cdefe0ac6","first_computed_at":"2026-05-18T04:12:55.056915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:55.056915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOWcLzMIljMY7ycHEQwr0pwBWFvrxyztEhMqF/1NC6DihXMzu9Kyx+AjhinqIRjbovfDGj7PmpTii2Dg4OwPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:55.057393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2254","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b46d0bcab2685e9b8f2266a650cd1a0fe54f9c1a6e54388566d5bdf4e0b3cd2","sha256:71c03955a415ff71acfe821f003e78558de32079cba2520bb2ce20eb25813d00"],"state_sha256":"16c9641e73869658ff61c907ca8e04f83988ec4092fdcd4539c3ef5802fcaa6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqD0NTzTY0+wyjfRh+G5PNzeQCVWp7JCvSFD2UJpVK6QtE5fRRPBN45Lg+wzrEDD1gQ4B6IusQxZOaVDjUryCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:36:36.861617Z","bundle_sha256":"d8916f3f8aba56ce72d3639840129c1958467c6691fbd7e20dbd4ebbe33eed9b"}}