{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UXGZCTPAOJDZWEJJXYZORZQ2XL","short_pith_number":"pith:UXGZCTPA","canonical_record":{"source":{"id":"1412.0639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T20:45:25Z","cross_cats_sorted":[],"title_canon_sha256":"8ef4061c7996d00a26e2240bdcda95c04cce0c8eb382306d3f183a54fd5b9e9e","abstract_canon_sha256":"0e1e4253893bf0ec0f9cc4bcc1a17df4314bef2ad2149578a4be049a9c534158"},"schema_version":"1.0"},"canonical_sha256":"a5cd914de072479b1129be32e8e61abae2869d628526399764975754a759bf21","source":{"kind":"arxiv","id":"1412.0639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0639","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0639v1","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0639","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"UXGZCTPAOJDZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UXGZCTPAOJDZWEJJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UXGZCTPA","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UXGZCTPAOJDZWEJJXYZORZQ2XL","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T20:45:25Z","cross_cats_sorted":[],"title_canon_sha256":"8ef4061c7996d00a26e2240bdcda95c04cce0c8eb382306d3f183a54fd5b9e9e","abstract_canon_sha256":"0e1e4253893bf0ec0f9cc4bcc1a17df4314bef2ad2149578a4be049a9c534158"},"schema_version":"1.0"},"canonical_sha256":"a5cd914de072479b1129be32e8e61abae2869d628526399764975754a759bf21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:22.938133Z","signature_b64":"nFm3H1iPjS8OLSeTuzBrzCAyTVnynUO1MASfdz9BXxtA5A3wzjGOJTNOd/3eq25bFNfqhgUJFk1nwuPb0xN8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5cd914de072479b1129be32e8e61abae2869d628526399764975754a759bf21","last_reissued_at":"2026-05-18T02:32:22.937615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:22.937615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0639","source_version":1,"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-18T02:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hF7sfsAwDpvEimCVBxU8v/Ja4WEFY+FqrRyLRqgC9rSPWHp41xy49lY6Q9mDtXlV6N0SVp/N8LUAmfpC+xsPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:11.704492Z"},"content_sha256":"1e41adecd497af99c09092233acbcacde7e179ce7ef73715b94aa38c7856b7df","schema_version":"1.0","event_id":"sha256:1e41adecd497af99c09092233acbcacde7e179ce7ef73715b94aa38c7856b7df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UXGZCTPAOJDZWEJJXYZORZQ2XL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David J. Rosenbaum","submitted_at":"2014-12-01T20:45:25Z","abstract_excerpt":"We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work with Fabian Wagner, we showed an n^((1 / 2) log_p n + O(log n / log log n)) time algorithm for testing isomorphism of p-groups by building graphs with degree bounded by p + O(1) that represent composition series for the groups and applying Luks' algorithm for testing isomorphism of bounded degree graphs.\n  In this work, we extend this improvement to the more g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0639","kind":"arxiv","version":1},"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-18T02:32:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBwvDDzBzwgdlSUxnzLps/2oHxDNxQvFLuTn8JLaDt/YqqUk2XPwLQmZW+gxU8cYGjJbozxwsfz0Q++Cy9hzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:11.704845Z"},"content_sha256":"2a0904a0acdaa4ca6aa036dae25e83fd2cf01914226a6cffba53665def8d93de","schema_version":"1.0","event_id":"sha256:2a0904a0acdaa4ca6aa036dae25e83fd2cf01914226a6cffba53665def8d93de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL/bundle.json","state_url":"https://pith.science/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL/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:34:11Z","links":{"resolver":"https://pith.science/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL","bundle":"https://pith.science/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL/bundle.json","state":"https://pith.science/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UXGZCTPAOJDZWEJJXYZORZQ2XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UXGZCTPAOJDZWEJJXYZORZQ2XL","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":"0e1e4253893bf0ec0f9cc4bcc1a17df4314bef2ad2149578a4be049a9c534158","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T20:45:25Z","title_canon_sha256":"8ef4061c7996d00a26e2240bdcda95c04cce0c8eb382306d3f183a54fd5b9e9e"},"schema_version":"1.0","source":{"id":"1412.0639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0639","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0639v1","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0639","created_at":"2026-05-18T02:32:22Z"},{"alias_kind":"pith_short_12","alias_value":"UXGZCTPAOJDZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UXGZCTPAOJDZWEJJ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UXGZCTPA","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:2a0904a0acdaa4ca6aa036dae25e83fd2cf01914226a6cffba53665def8d93de","target":"graph","created_at":"2026-05-18T02:32:22Z","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 consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work with Fabian Wagner, we showed an n^((1 / 2) log_p n + O(log n / log log n)) time algorithm for testing isomorphism of p-groups by building graphs with degree bounded by p + O(1) that represent composition series for the groups and applying Luks' algorithm for testing isomorphism of bounded degree graphs.\n  In this work, we extend this improvement to the more g","authors_text":"David J. Rosenbaum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T20:45:25Z","title":"Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0639","kind":"arxiv","version":1},"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:1e41adecd497af99c09092233acbcacde7e179ce7ef73715b94aa38c7856b7df","target":"record","created_at":"2026-05-18T02:32:22Z","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":"0e1e4253893bf0ec0f9cc4bcc1a17df4314bef2ad2149578a4be049a9c534158","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T20:45:25Z","title_canon_sha256":"8ef4061c7996d00a26e2240bdcda95c04cce0c8eb382306d3f183a54fd5b9e9e"},"schema_version":"1.0","source":{"id":"1412.0639","kind":"arxiv","version":1}},"canonical_sha256":"a5cd914de072479b1129be32e8e61abae2869d628526399764975754a759bf21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5cd914de072479b1129be32e8e61abae2869d628526399764975754a759bf21","first_computed_at":"2026-05-18T02:32:22.937615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:22.937615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nFm3H1iPjS8OLSeTuzBrzCAyTVnynUO1MASfdz9BXxtA5A3wzjGOJTNOd/3eq25bFNfqhgUJFk1nwuPb0xN8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:22.938133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e41adecd497af99c09092233acbcacde7e179ce7ef73715b94aa38c7856b7df","sha256:2a0904a0acdaa4ca6aa036dae25e83fd2cf01914226a6cffba53665def8d93de"],"state_sha256":"14b094132cc130c1adee58fee1ceb337fd13b2d26ad9027335b29b34da46e26d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UxKtqwxPl/vEfNGJtI6A+qgxn608RUFjhZQTFQ/M7NZhNvTP4Tl3VTjWuCnUuOdsotmJtNATLhouHeNUPwZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:34:11.706786Z","bundle_sha256":"f8ad03b81e6d37cd54e898b18b5f9518faede10e28b84e6355ed12f02063e216"}}