{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GEKU5RND3A3Z4J6337NXJ5PA6P","short_pith_number":"pith:GEKU5RND","canonical_record":{"source":{"id":"1102.1650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-02-08T16:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"141b84aaca4fd638b2e239c5c1a75797ea0e4a06f264f44438c6e95a893218aa","abstract_canon_sha256":"901f6599c98045de80e6ff6dcb14a2e747b23af4289329ee944196e49447c4e0"},"schema_version":"1.0"},"canonical_sha256":"31154ec5a3d8379e27dbdfdb74f5e0f3c9032417da1c7e451c27a32998b2e2af","source":{"kind":"arxiv","id":"1102.1650","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1650","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1650v2","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1650","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"GEKU5RND3A3Z","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GEKU5RND3A3Z4J63","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GEKU5RND","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GEKU5RND3A3Z4J6337NXJ5PA6P","target":"record","payload":{"canonical_record":{"source":{"id":"1102.1650","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-02-08T16:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"141b84aaca4fd638b2e239c5c1a75797ea0e4a06f264f44438c6e95a893218aa","abstract_canon_sha256":"901f6599c98045de80e6ff6dcb14a2e747b23af4289329ee944196e49447c4e0"},"schema_version":"1.0"},"canonical_sha256":"31154ec5a3d8379e27dbdfdb74f5e0f3c9032417da1c7e451c27a32998b2e2af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:44.273070Z","signature_b64":"GfSpz7ZK0fyDRMqMH9KGRE1gzB4M9O1nx171W6LOdAVPhClpCaBJTsUMb5AqF99WPtib/Rr1LHaLDNCfLUVmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31154ec5a3d8379e27dbdfdb74f5e0f3c9032417da1c7e451c27a32998b2e2af","last_reissued_at":"2026-05-18T04:29:44.272449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:44.272449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.1650","source_version":2,"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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9eQ+iwvcPamhPSVnbiTcZwb1iMJ3WcHBspXrbQjIWO26RkkicjMhHN7Z2y4WhIVyf2UpLiTUa3KtMv8iEOwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:13:55.699845Z"},"content_sha256":"e6490a09370de4ce362b8b96d85d7e2fa8fb162ad8b65953f0f926533cfd958c","schema_version":"1.0","event_id":"sha256:e6490a09370de4ce362b8b96d85d7e2fa8fb162ad8b65953f0f926533cfd958c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GEKU5RND3A3Z4J6337NXJ5PA6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refined solvable presentations for polycyclic groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Gunnar Traustason, Ren\\'e Hartung","submitted_at":"2011-02-08T16:41:36Z","abstract_excerpt":"We describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These presentations can be described effectively by presentation maps which yield the basis data structure to define a polycyclic group in computer-algebra-systems like {\\scshape Gap} or {\\scshape Magma}. We study refined solvable presentations and, in particular, we obtain consistency criteria for them. This consistency implementation demonstrates that it is often faster tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1650","kind":"arxiv","version":2},"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:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+v2IoWeSyoRYXRPAq7O+DgAHlRa/NGie/Eop6P/1+uHXx8JDw1u2ZgM9K1g3eDWykVY49UUCvRdQGxFMAQrPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:13:55.700185Z"},"content_sha256":"b16997d695914f2b423f7496cbe37854e2b6539ae40b3a901260253cd447fbcd","schema_version":"1.0","event_id":"sha256:b16997d695914f2b423f7496cbe37854e2b6539ae40b3a901260253cd447fbcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEKU5RND3A3Z4J6337NXJ5PA6P/bundle.json","state_url":"https://pith.science/pith/GEKU5RND3A3Z4J6337NXJ5PA6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEKU5RND3A3Z4J6337NXJ5PA6P/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-23T18:13:55Z","links":{"resolver":"https://pith.science/pith/GEKU5RND3A3Z4J6337NXJ5PA6P","bundle":"https://pith.science/pith/GEKU5RND3A3Z4J6337NXJ5PA6P/bundle.json","state":"https://pith.science/pith/GEKU5RND3A3Z4J6337NXJ5PA6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEKU5RND3A3Z4J6337NXJ5PA6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GEKU5RND3A3Z4J6337NXJ5PA6P","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":"901f6599c98045de80e6ff6dcb14a2e747b23af4289329ee944196e49447c4e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-02-08T16:41:36Z","title_canon_sha256":"141b84aaca4fd638b2e239c5c1a75797ea0e4a06f264f44438c6e95a893218aa"},"schema_version":"1.0","source":{"id":"1102.1650","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1650","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1650v2","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1650","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"GEKU5RND3A3Z","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GEKU5RND3A3Z4J63","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GEKU5RND","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:b16997d695914f2b423f7496cbe37854e2b6539ae40b3a901260253cd447fbcd","target":"graph","created_at":"2026-05-18T04:29:44Z","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 describe a new type of polycyclic presentations, that we will call refined solvable presentations, for polycyclic groups. These presentations are obtained by refining a series of normal subgroups with abelian sections. These presentations can be described effectively by presentation maps which yield the basis data structure to define a polycyclic group in computer-algebra-systems like {\\scshape Gap} or {\\scshape Magma}. We study refined solvable presentations and, in particular, we obtain consistency criteria for them. This consistency implementation demonstrates that it is often faster tha","authors_text":"Gunnar Traustason, Ren\\'e Hartung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-02-08T16:41:36Z","title":"Refined solvable presentations for polycyclic groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1650","kind":"arxiv","version":2},"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:e6490a09370de4ce362b8b96d85d7e2fa8fb162ad8b65953f0f926533cfd958c","target":"record","created_at":"2026-05-18T04:29:44Z","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":"901f6599c98045de80e6ff6dcb14a2e747b23af4289329ee944196e49447c4e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2011-02-08T16:41:36Z","title_canon_sha256":"141b84aaca4fd638b2e239c5c1a75797ea0e4a06f264f44438c6e95a893218aa"},"schema_version":"1.0","source":{"id":"1102.1650","kind":"arxiv","version":2}},"canonical_sha256":"31154ec5a3d8379e27dbdfdb74f5e0f3c9032417da1c7e451c27a32998b2e2af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31154ec5a3d8379e27dbdfdb74f5e0f3c9032417da1c7e451c27a32998b2e2af","first_computed_at":"2026-05-18T04:29:44.272449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:44.272449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GfSpz7ZK0fyDRMqMH9KGRE1gzB4M9O1nx171W6LOdAVPhClpCaBJTsUMb5AqF99WPtib/Rr1LHaLDNCfLUVmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:44.273070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1650","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6490a09370de4ce362b8b96d85d7e2fa8fb162ad8b65953f0f926533cfd958c","sha256:b16997d695914f2b423f7496cbe37854e2b6539ae40b3a901260253cd447fbcd"],"state_sha256":"f3833f29a6c5273025072f0d69582597a6d66bba7d40069263e8e6fb3a267048"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StOZaVw4rToBfxWQDnB7DIBW6VJ592Xl+4iNeQj2vCCINJ3IEf6ehLCYfxpbz8aNPEqd5WauEU3iIRaZG7FfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:13:55.702130Z","bundle_sha256":"9922b1bf9fe7d8ec2673e5d2edfe2a736571526d2a94113bf58557fc2151ce81"}}