{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:ZFKMB2XPHTHBXS3W2OBYINZN2H","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":"7ad346286eef0dd757ffbd144fceea4601515832497fe3a18034f66e3fa4c544","cross_cats_sorted":[],"license":"","primary_cat":"math.GR","submitted_at":"2004-01-21T07:29:45Z","title_canon_sha256":"cc5489cad3b71a223bf7564d351b9de4af0c5d07047f1cb2a196c9aa17c042a6"},"schema_version":"1.0","source":{"id":"math/0401269","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0401269","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"math/0401269v3","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0401269","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZFKMB2XPHTHB","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZFKMB2XPHTHBXS3W","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZFKMB2XP","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:81355afa6910c7d9d712d30881256cfc71ed96a68666f3f8ff1c96bc4c535f4f","target":"graph","created_at":"2026-05-18T04:23:11Z","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":"Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v=\\phi(u) for some \\phi \\in AutF_n}. In this paper, we prove that N(u) is bounded by a polynomial function of degree 2n-3 with respect to |u| under the hypothesis that if two letters x, y occur in u, then the total number of x and x^{-1} occurring in u is not equal to the total number of y and y^{-1} occurring in u. We also prove that 2n-3 is the sharp bound on the degree of polynomials bounding N(u). ","authors_text":"Donghi Lee","cross_cats":[],"headline":"","license":"","primary_cat":"math.GR","submitted_at":"2004-01-21T07:29:45Z","title":"A tighter bound for the number of words of minimum length in an automorphic orbit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0401269","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:0321d8347017c96cdae7d6cc59813a8111b89272ed249c694a968143ee0b78aa","target":"record","created_at":"2026-05-18T04:23:11Z","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":"7ad346286eef0dd757ffbd144fceea4601515832497fe3a18034f66e3fa4c544","cross_cats_sorted":[],"license":"","primary_cat":"math.GR","submitted_at":"2004-01-21T07:29:45Z","title_canon_sha256":"cc5489cad3b71a223bf7564d351b9de4af0c5d07047f1cb2a196c9aa17c042a6"},"schema_version":"1.0","source":{"id":"math/0401269","kind":"arxiv","version":3}},"canonical_sha256":"c954c0eaef3cce1bcb76d38384372dd1e9c31ecdd0e87dd49a32bd7dce71bdfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c954c0eaef3cce1bcb76d38384372dd1e9c31ecdd0e87dd49a32bd7dce71bdfa","first_computed_at":"2026-05-18T04:23:11.850000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:11.850000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZwXm6OWwWpxulg9eFmgfIr8JwxwKq3ZrdF5cVxD+PLUeI88ZYcjRwz+DUOXPIe3Zec+6BvTKK6ec/3VUf0AxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:11.850537Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0401269","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0321d8347017c96cdae7d6cc59813a8111b89272ed249c694a968143ee0b78aa","sha256:81355afa6910c7d9d712d30881256cfc71ed96a68666f3f8ff1c96bc4c535f4f"],"state_sha256":"ff8f87d2fd3cbd92b8a6fc7f42142b032eab4a87ec83bd6402e752c5881edc40"}