{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OCCZZB6GIDZIXTOHV6WGHSPPEB","short_pith_number":"pith:OCCZZB6G","canonical_record":{"source":{"id":"1207.6944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-07-30T14:30:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac40bea6d156147b5eff88221937800b4affee7b5bc127a5fe5bc63106c8f787","abstract_canon_sha256":"df5d3a855d969f95eadc880f3544b0256e915ddd774589555c0a6bb8ffeef71c"},"schema_version":"1.0"},"canonical_sha256":"70859c87c640f28bcdc7afac63c9ef2067668b68c663b6f8afe5fc16504b6c36","source":{"kind":"arxiv","id":"1207.6944","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6944","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6944v2","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6944","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"OCCZZB6GIDZI","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OCCZZB6GIDZIXTOH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OCCZZB6G","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OCCZZB6GIDZIXTOHV6WGHSPPEB","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-07-30T14:30:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac40bea6d156147b5eff88221937800b4affee7b5bc127a5fe5bc63106c8f787","abstract_canon_sha256":"df5d3a855d969f95eadc880f3544b0256e915ddd774589555c0a6bb8ffeef71c"},"schema_version":"1.0"},"canonical_sha256":"70859c87c640f28bcdc7afac63c9ef2067668b68c663b6f8afe5fc16504b6c36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:10.005605Z","signature_b64":"5ksE5DVr9hC0kXv6loBIR8uJuTjfWSKaxPNvRI98vqyL/hbS8tR9cc9bdAR9l+1Dz09meruZmMia7XcH19qABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70859c87c640f28bcdc7afac63c9ef2067668b68c663b6f8afe5fc16504b6c36","last_reissued_at":"2026-05-18T03:49:10.005033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:10.005033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6944","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vz0knTArBkYgmBjNGJex94QLJ0jZcaXY1ov/A8ozCVt+2T8TbNSWXcOCIB7jkjq4uoe0QXrmKggAWwbuo8/bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:43:04.656020Z"},"content_sha256":"9db31d9539c1e378e26f9a15afb1540e0974cdc4c9b8159aca9edf72d982511d","schema_version":"1.0","event_id":"sha256:9db31d9539c1e378e26f9a15afb1540e0974cdc4c9b8159aca9edf72d982511d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OCCZZB6GIDZIXTOHV6WGHSPPEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in P","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.GR","authors_text":"J\\\"urn Laun","submitted_at":"2012-07-30T14:30:58Z","abstract_excerpt":"This paper continues the 2012 STACS contribution by Diekert, Ushakov, and the author. We extend the results published in the proceedings in two ways.\n  First, we show that the data structure of power circuits can be generalized to work with arbitrary bases q>=2. This results in a data structure that can hold huge integers, arising by iteratively forming powers of q. We show that the properties of power circuits known for q=2 translate to the general case. This generalization is non-trivial and additional techniques are required to preserve the time bounds of arithmetic operations that were sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6944","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4F3knGkekDZsGNdTkj9MmQFDQuY7iAvZBMkeIg/0XNhSN+nEQM3Vuz0eKVAtz8IBren4J2tIBnp8xJKviSOUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:43:04.656385Z"},"content_sha256":"91096832465383dd73b34af3d19aa12c62cc36bbe66774403a60751399518eaa","schema_version":"1.0","event_id":"sha256:91096832465383dd73b34af3d19aa12c62cc36bbe66774403a60751399518eaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB/bundle.json","state_url":"https://pith.science/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB/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-22T23:43:04Z","links":{"resolver":"https://pith.science/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB","bundle":"https://pith.science/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB/bundle.json","state":"https://pith.science/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCCZZB6GIDZIXTOHV6WGHSPPEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OCCZZB6GIDZIXTOHV6WGHSPPEB","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":"df5d3a855d969f95eadc880f3544b0256e915ddd774589555c0a6bb8ffeef71c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-07-30T14:30:58Z","title_canon_sha256":"ac40bea6d156147b5eff88221937800b4affee7b5bc127a5fe5bc63106c8f787"},"schema_version":"1.0","source":{"id":"1207.6944","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6944","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6944v2","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6944","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"OCCZZB6GIDZI","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OCCZZB6GIDZIXTOH","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OCCZZB6G","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:91096832465383dd73b34af3d19aa12c62cc36bbe66774403a60751399518eaa","target":"graph","created_at":"2026-05-18T03:49:10Z","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":"This paper continues the 2012 STACS contribution by Diekert, Ushakov, and the author. We extend the results published in the proceedings in two ways.\n  First, we show that the data structure of power circuits can be generalized to work with arbitrary bases q>=2. This results in a data structure that can hold huge integers, arising by iteratively forming powers of q. We show that the properties of power circuits known for q=2 translate to the general case. This generalization is non-trivial and additional techniques are required to preserve the time bounds of arithmetic operations that were sho","authors_text":"J\\\"urn Laun","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-07-30T14:30:58Z","title":"Efficient algorithms for highly compressed data: The Word Problem in Generalized Higman Groups is in P"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6944","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:9db31d9539c1e378e26f9a15afb1540e0974cdc4c9b8159aca9edf72d982511d","target":"record","created_at":"2026-05-18T03:49:10Z","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":"df5d3a855d969f95eadc880f3544b0256e915ddd774589555c0a6bb8ffeef71c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-07-30T14:30:58Z","title_canon_sha256":"ac40bea6d156147b5eff88221937800b4affee7b5bc127a5fe5bc63106c8f787"},"schema_version":"1.0","source":{"id":"1207.6944","kind":"arxiv","version":2}},"canonical_sha256":"70859c87c640f28bcdc7afac63c9ef2067668b68c663b6f8afe5fc16504b6c36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70859c87c640f28bcdc7afac63c9ef2067668b68c663b6f8afe5fc16504b6c36","first_computed_at":"2026-05-18T03:49:10.005033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:10.005033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ksE5DVr9hC0kXv6loBIR8uJuTjfWSKaxPNvRI98vqyL/hbS8tR9cc9bdAR9l+1Dz09meruZmMia7XcH19qABg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:10.005605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6944","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9db31d9539c1e378e26f9a15afb1540e0974cdc4c9b8159aca9edf72d982511d","sha256:91096832465383dd73b34af3d19aa12c62cc36bbe66774403a60751399518eaa"],"state_sha256":"5fde541520f313456565f382c302342fcfadd3eb16f6a16027283d5072fc0304"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ri25FExXxPCikolhBeKAHGtWB3mFHOonhYAfve1QEBizxWcJJ5aURoTEgV6mTpwKXiQ/XXY2MfFJCl2h9nGSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:43:04.658379Z","bundle_sha256":"f769a4a17bf1abec73b23e952a30cf58b9bf7f8c43aac89e17b600a10624f988"}}