{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:D3JMLEZSXDCV5GCB7AIDX3ZFS2","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":"5b4c6c7e5988082ee4232ee3be1a958ea918fb41dc5b95bd6052dee9501f1baf","cross_cats_sorted":[],"license":"","primary_cat":"math.GR","submitted_at":"2003-11-24T01:38:45Z","title_canon_sha256":"16841b97f161ff9d2b0786ba903fdab50b1db5948ab343a2ab7f16f6a52e9b1f"},"schema_version":"1.0","source":{"id":"math/0311410","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0311410","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"math/0311410v3","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0311410","created_at":"2026-05-18T04:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"D3JMLEZSXDCV","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"D3JMLEZSXDCV5GCB","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"D3JMLEZS","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:9791ddb6348e08e479e9b7b431eea555193e42479257e6c3478a070bcdb5057f","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 \\text {Aut}F_n}. In this paper, we prove that N(u) is bounded by a polynomial function 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. A complete proof without the hypothesis would yield the polynomial time complexity of Whitehe","authors_text":"Donghi Lee","cross_cats":[],"headline":"","license":"","primary_cat":"math.GR","submitted_at":"2003-11-24T01:38:45Z","title":"Counting words of minimum length in an automorphic orbit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311410","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:126025b388ce71d6331216cd8074b42f035460c49c8c0972093424d69384bfbe","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":"5b4c6c7e5988082ee4232ee3be1a958ea918fb41dc5b95bd6052dee9501f1baf","cross_cats_sorted":[],"license":"","primary_cat":"math.GR","submitted_at":"2003-11-24T01:38:45Z","title_canon_sha256":"16841b97f161ff9d2b0786ba903fdab50b1db5948ab343a2ab7f16f6a52e9b1f"},"schema_version":"1.0","source":{"id":"math/0311410","kind":"arxiv","version":3}},"canonical_sha256":"1ed2c59332b8c55e9841f8103bef259682d9687b2fb2fd9704000f8e7d4e2af3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ed2c59332b8c55e9841f8103bef259682d9687b2fb2fd9704000f8e7d4e2af3","first_computed_at":"2026-05-18T04:23:11.857371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:11.857371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pgsw+qYGTm7J7OyqA7pENkW8moRsAYbgHzZwvaFrGDsMTvYFqVg8VvJbW82YPrM9we7TztF6c2wUkovusEOGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:11.857898Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0311410","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:126025b388ce71d6331216cd8074b42f035460c49c8c0972093424d69384bfbe","sha256:9791ddb6348e08e479e9b7b431eea555193e42479257e6c3478a070bcdb5057f"],"state_sha256":"0be286fe6ba5290af3b00d3b20057d64a1546af9dca62ac2cbbd1a9563310681"}