{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GSO35N4H5VI6WPSWYH727S3ABV","short_pith_number":"pith:GSO35N4H","canonical_record":{"source":{"id":"1512.03729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-12-11T17:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"cf16a8e60ad88e23f91503f3c37a818fe5b3a121da634524e3068ee85131f9c8","abstract_canon_sha256":"8154e4e6e105c61261cf034bf6a13dddda9736146b9d74036c1943803e817191"},"schema_version":"1.0"},"canonical_sha256":"349dbeb787ed51eb3e56c1ffafcb600d44ccf2aeaaaa488164035fee87398c9e","source":{"kind":"arxiv","id":"1512.03729","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03729","created_at":"2026-05-18T01:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03729v3","created_at":"2026-05-18T01:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03729","created_at":"2026-05-18T01:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"GSO35N4H5VI6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GSO35N4H5VI6WPSW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GSO35N4H","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GSO35N4H5VI6WPSWYH727S3ABV","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-12-11T17:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"cf16a8e60ad88e23f91503f3c37a818fe5b3a121da634524e3068ee85131f9c8","abstract_canon_sha256":"8154e4e6e105c61261cf034bf6a13dddda9736146b9d74036c1943803e817191"},"schema_version":"1.0"},"canonical_sha256":"349dbeb787ed51eb3e56c1ffafcb600d44ccf2aeaaaa488164035fee87398c9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:59.899599Z","signature_b64":"7soEwaaPN9umRDEeYX8sCTbO8F+oLjVszNxHsgwCMXXdI6YBw/KMtAAkRVUQWPmc57K4eT3AhxMMtxuxfbrHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"349dbeb787ed51eb3e56c1ffafcb600d44ccf2aeaaaa488164035fee87398c9e","last_reissued_at":"2026-05-18T01:16:59.898919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:59.898919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03729","source_version":3,"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-18T01:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RhILlhAYKBvIGEqSEWTTDYJNb06ehr7iPDjiiFFZNH1RtDYw1gYysJspqD9Y3krYWnll4q2/NaHeSqNF/WULBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:33:40.206422Z"},"content_sha256":"07021d0f7e899de69990ebf7f3e66f0c6addd30bc5a51192bbf6a465339c8d1f","schema_version":"1.0","event_id":"sha256:07021d0f7e899de69990ebf7f3e66f0c6addd30bc5a51192bbf6a465339c8d1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GSO35N4H5VI6WPSWYH727S3ABV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Describing Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Meng-Che Ho","submitted_at":"2015-12-11T17:23:09Z","abstract_excerpt":"We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J. Knight et al. determined the complexity of index sets of various structures. In this paper, we focus on finding the complexity of computable Scott sentences and index sets of various groups, generalizing methods that was previously used by J. Knight et al. We found computable Scott sentences for various different groups or class of groups, including nilpotent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03729","kind":"arxiv","version":3},"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-18T01:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAet1Z2TRs2AYpDw3kJ/0AIhaXy8yEyd6zUDjw056v7ypxhNsKsxK0DcNVph1B5jTgOc8EfY08ErWCnYuKWoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:33:40.206772Z"},"content_sha256":"745ace765f128134155c6ae19fc98122fa707134296892481d624922e76b9d8a","schema_version":"1.0","event_id":"sha256:745ace765f128134155c6ae19fc98122fa707134296892481d624922e76b9d8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSO35N4H5VI6WPSWYH727S3ABV/bundle.json","state_url":"https://pith.science/pith/GSO35N4H5VI6WPSWYH727S3ABV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSO35N4H5VI6WPSWYH727S3ABV/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-03T06:33:40Z","links":{"resolver":"https://pith.science/pith/GSO35N4H5VI6WPSWYH727S3ABV","bundle":"https://pith.science/pith/GSO35N4H5VI6WPSWYH727S3ABV/bundle.json","state":"https://pith.science/pith/GSO35N4H5VI6WPSWYH727S3ABV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSO35N4H5VI6WPSWYH727S3ABV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GSO35N4H5VI6WPSWYH727S3ABV","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":"8154e4e6e105c61261cf034bf6a13dddda9736146b9d74036c1943803e817191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-12-11T17:23:09Z","title_canon_sha256":"cf16a8e60ad88e23f91503f3c37a818fe5b3a121da634524e3068ee85131f9c8"},"schema_version":"1.0","source":{"id":"1512.03729","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03729","created_at":"2026-05-18T01:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03729v3","created_at":"2026-05-18T01:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03729","created_at":"2026-05-18T01:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"GSO35N4H5VI6","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GSO35N4H5VI6WPSW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GSO35N4H","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:745ace765f128134155c6ae19fc98122fa707134296892481d624922e76b9d8a","target":"graph","created_at":"2026-05-18T01:16:59Z","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 study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J. Knight et al. determined the complexity of index sets of various structures. In this paper, we focus on finding the complexity of computable Scott sentences and index sets of various groups, generalizing methods that was previously used by J. Knight et al. We found computable Scott sentences for various different groups or class of groups, including nilpotent","authors_text":"Meng-Che Ho","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-12-11T17:23:09Z","title":"Describing Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03729","kind":"arxiv","version":3},"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:07021d0f7e899de69990ebf7f3e66f0c6addd30bc5a51192bbf6a465339c8d1f","target":"record","created_at":"2026-05-18T01:16:59Z","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":"8154e4e6e105c61261cf034bf6a13dddda9736146b9d74036c1943803e817191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-12-11T17:23:09Z","title_canon_sha256":"cf16a8e60ad88e23f91503f3c37a818fe5b3a121da634524e3068ee85131f9c8"},"schema_version":"1.0","source":{"id":"1512.03729","kind":"arxiv","version":3}},"canonical_sha256":"349dbeb787ed51eb3e56c1ffafcb600d44ccf2aeaaaa488164035fee87398c9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"349dbeb787ed51eb3e56c1ffafcb600d44ccf2aeaaaa488164035fee87398c9e","first_computed_at":"2026-05-18T01:16:59.898919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:59.898919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7soEwaaPN9umRDEeYX8sCTbO8F+oLjVszNxHsgwCMXXdI6YBw/KMtAAkRVUQWPmc57K4eT3AhxMMtxuxfbrHBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:59.899599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03729","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07021d0f7e899de69990ebf7f3e66f0c6addd30bc5a51192bbf6a465339c8d1f","sha256:745ace765f128134155c6ae19fc98122fa707134296892481d624922e76b9d8a"],"state_sha256":"0473672f7b03bd2abc32e2dad589d004fdf195d7a97a4493ba465b9396bf326e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEDmRI8avH01lYMklu9o8BAHvPt0/j+iFEvQBFdBW7+cNkv/tQNrl6717TD0mHOvz6a7evBIW/0HgeGp1dDHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:33:40.208837Z","bundle_sha256":"887b7cc453a601a5e8914b9423463c73eb0c2f403e11f0a99d6fe4e1ddb62897"}}