{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HMDDDOI34SDGOPDGTW347J6SOG","short_pith_number":"pith:HMDDDOI3","schema_version":"1.0","canonical_sha256":"3b0631b91be486673c669db7cfa7d271bcba471a8444582214a4241cdefe0ac6","source":{"kind":"arxiv","id":"1005.2254","version":9},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1005.2254","created_at":"2026-05-18T04:12:55.056986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2254v9","created_at":"2026-05-18T04:12:55.056986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2254","created_at":"2026-05-18T04:12:55.056986+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMDDDOI34SDG","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMDDDOI34SDGOPDG","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMDDDOI3","created_at":"2026-05-18T12:26:07.630475+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/HMDDDOI34SDGOPDGTW347J6SOG","json":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG.json","graph_json":"https://pith.science/api/pith-number/HMDDDOI34SDGOPDGTW347J6SOG/graph.json","events_json":"https://pith.science/api/pith-number/HMDDDOI34SDGOPDGTW347J6SOG/events.json","paper":"https://pith.science/paper/HMDDDOI3"},"agent_actions":{"view_html":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG","download_json":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG.json","view_paper":"https://pith.science/paper/HMDDDOI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2254&json=true","fetch_graph":"https://pith.science/api/pith-number/HMDDDOI34SDGOPDGTW347J6SOG/graph.json","fetch_events":"https://pith.science/api/pith-number/HMDDDOI34SDGOPDGTW347J6SOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/action/storage_attestation","attest_author":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/action/author_attestation","sign_citation":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/action/citation_signature","submit_replication":"https://pith.science/pith/HMDDDOI34SDGOPDGTW347J6SOG/action/replication_record"}},"created_at":"2026-05-18T04:12:55.056986+00:00","updated_at":"2026-05-18T04:12:55.056986+00:00"}