{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UFTV4IP2YZ4DA7R5NRSQYHXTCM","short_pith_number":"pith:UFTV4IP2","canonical_record":{"source":{"id":"1401.0489","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-02T18:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"53144e24af30ba1e55c380dc2a1bea28887fb055e3ee9b820d95b56bd8c64f11","abstract_canon_sha256":"47911cfba57b6f0072c195185e26a58672ff50a2b11605187b5256ed660ed145"},"schema_version":"1.0"},"canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","source":{"kind":"arxiv","id":"1401.0489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0489","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0489v1","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0489","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"UFTV4IP2YZ4D","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFTV4IP2YZ4DA7R5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFTV4IP2","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UFTV4IP2YZ4DA7R5NRSQYHXTCM","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0489","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-02T18:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"53144e24af30ba1e55c380dc2a1bea28887fb055e3ee9b820d95b56bd8c64f11","abstract_canon_sha256":"47911cfba57b6f0072c195185e26a58672ff50a2b11605187b5256ed660ed145"},"schema_version":"1.0"},"canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:23.088292Z","signature_b64":"imVj17XPqRUaPnPDzLeI6sjLKf6Ukx52/gIrcXvklGSegIpQI/LwIXMwO+U3cg3l2T76QNCH9/6T0s+et9QHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","last_reissued_at":"2026-05-18T03:03:23.087702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:23.087702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0489","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-18T03:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBXHvl4AMgu1rUbkDL5deHD3MRzmx1Ns3aMi8RoSWwqEyIMbHwIVl83oQam3oYmEUtUT6R+LkfJrWlSfSJHcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:06:23.859835Z"},"content_sha256":"15f470b3d693a78efe4f86bf74bf55039c59dc1de62ef7d44e3a3df1f3301f5e","schema_version":"1.0","event_id":"sha256:15f470b3d693a78efe4f86bf74bf55039c59dc1de62ef7d44e3a3df1f3301f5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UFTV4IP2YZ4DA7R5NRSQYHXTCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Element order versus minimal degree in permutation groups: an old lemma with new applications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"\\'Akos Seress, L\\'aszl\\'o Babai","submitted_at":"2014-01-02T18:07:54Z","abstract_excerpt":"In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\\alpha}$ then some non-identity power of the permutation has support size less than $n/{\\alpha}$. The original version made an unnecessary additional assumption on the cycle structure of the permutation; the proof of the present cleaner version follows the original proof verbatim. Application areas include parallel and sequential algorithms for permutation groups, the diameter of C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0489","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-18T03:03:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNdcnimyI8tGkr9mYXllWs4WV1d1cB8mu2Uq0nQpE+7HpOqiZ2RlvhfQur5KyfNRYGKFO/HipN1k5qDZspF2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:06:23.860172Z"},"content_sha256":"bc127fb5f86cf54002c9b21b2ae7cbebdb5fe3124e32f58b27b3bc136dbe18fd","schema_version":"1.0","event_id":"sha256:bc127fb5f86cf54002c9b21b2ae7cbebdb5fe3124e32f58b27b3bc136dbe18fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/bundle.json","state_url":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/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-29T13:06:23Z","links":{"resolver":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM","bundle":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/bundle.json","state":"https://pith.science/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFTV4IP2YZ4DA7R5NRSQYHXTCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UFTV4IP2YZ4DA7R5NRSQYHXTCM","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":"47911cfba57b6f0072c195185e26a58672ff50a2b11605187b5256ed660ed145","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-02T18:07:54Z","title_canon_sha256":"53144e24af30ba1e55c380dc2a1bea28887fb055e3ee9b820d95b56bd8c64f11"},"schema_version":"1.0","source":{"id":"1401.0489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0489","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0489v1","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0489","created_at":"2026-05-18T03:03:23Z"},{"alias_kind":"pith_short_12","alias_value":"UFTV4IP2YZ4D","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UFTV4IP2YZ4DA7R5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UFTV4IP2","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:bc127fb5f86cf54002c9b21b2ae7cbebdb5fe3124e32f58b27b3bc136dbe18fd","target":"graph","created_at":"2026-05-18T03:03:23Z","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":"In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\\alpha}$ then some non-identity power of the permutation has support size less than $n/{\\alpha}$. The original version made an unnecessary additional assumption on the cycle structure of the permutation; the proof of the present cleaner version follows the original proof verbatim. Application areas include parallel and sequential algorithms for permutation groups, the diameter of C","authors_text":"\\'Akos Seress, L\\'aszl\\'o Babai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-02T18:07:54Z","title":"Element order versus minimal degree in permutation groups: an old lemma with new applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0489","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:15f470b3d693a78efe4f86bf74bf55039c59dc1de62ef7d44e3a3df1f3301f5e","target":"record","created_at":"2026-05-18T03:03:23Z","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":"47911cfba57b6f0072c195185e26a58672ff50a2b11605187b5256ed660ed145","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-01-02T18:07:54Z","title_canon_sha256":"53144e24af30ba1e55c380dc2a1bea28887fb055e3ee9b820d95b56bd8c64f11"},"schema_version":"1.0","source":{"id":"1401.0489","kind":"arxiv","version":1}},"canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1675e21fac678307e3d6c650c1ef31338e4ff02ad78b7988f26d37a71a2e8ef","first_computed_at":"2026-05-18T03:03:23.087702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:23.087702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"imVj17XPqRUaPnPDzLeI6sjLKf6Ukx52/gIrcXvklGSegIpQI/LwIXMwO+U3cg3l2T76QNCH9/6T0s+et9QHBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:23.088292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f470b3d693a78efe4f86bf74bf55039c59dc1de62ef7d44e3a3df1f3301f5e","sha256:bc127fb5f86cf54002c9b21b2ae7cbebdb5fe3124e32f58b27b3bc136dbe18fd"],"state_sha256":"4647842dcf2fb87900d4bfffede07ab109a1deb1504208731558f7eac0946201"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NLwk+ZW3+LrrtLMRfkzzQoy2fwNpeV+VwyhkyqV/57T8m0rBnZeCIH7NORXhgIBSdHlYwMk/qTCwjcUgozxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:06:23.862073Z","bundle_sha256":"736179091149a0598523201c0e5d385721ff7c7a4f5fb42b359ecc83df14179a"}}