{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:D3JMLEZSXDCV5GCB7AIDX3ZFS2","short_pith_number":"pith:D3JMLEZS","schema_version":"1.0","canonical_sha256":"1ed2c59332b8c55e9841f8103bef259682d9687b2fb2fd9704000f8e7d4e2af3","source":{"kind":"arxiv","id":"math/0311410","version":3},"attestation_state":"computed","paper":{"title":"Counting words of minimum length in an automorphic orbit","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2003-11-24T01:38:45Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0311410","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2003-11-24T01:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"16841b97f161ff9d2b0786ba903fdab50b1db5948ab343a2ab7f16f6a52e9b1f","abstract_canon_sha256":"5b4c6c7e5988082ee4232ee3be1a958ea918fb41dc5b95bd6052dee9501f1baf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.857898Z","signature_b64":"pgsw+qYGTm7J7OyqA7pENkW8moRsAYbgHzZwvaFrGDsMTvYFqVg8VvJbW82YPrM9we7TztF6c2wUkovusEOGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ed2c59332b8c55e9841f8103bef259682d9687b2fb2fd9704000f8e7d4e2af3","last_reissued_at":"2026-05-18T04:23:11.857371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.857371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting words of minimum length in an automorphic orbit","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2003-11-24T01:38:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311410","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0311410","created_at":"2026-05-18T04:23:11.857455+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0311410v3","created_at":"2026-05-18T04:23:11.857455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0311410","created_at":"2026-05-18T04:23:11.857455+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3JMLEZSXDCV","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3JMLEZSXDCV5GCB","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3JMLEZS","created_at":"2026-05-18T12:25:51.375804+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2","json":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2.json","graph_json":"https://pith.science/api/pith-number/D3JMLEZSXDCV5GCB7AIDX3ZFS2/graph.json","events_json":"https://pith.science/api/pith-number/D3JMLEZSXDCV5GCB7AIDX3ZFS2/events.json","paper":"https://pith.science/paper/D3JMLEZS"},"agent_actions":{"view_html":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2","download_json":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2.json","view_paper":"https://pith.science/paper/D3JMLEZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0311410&json=true","fetch_graph":"https://pith.science/api/pith-number/D3JMLEZSXDCV5GCB7AIDX3ZFS2/graph.json","fetch_events":"https://pith.science/api/pith-number/D3JMLEZSXDCV5GCB7AIDX3ZFS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2/action/storage_attestation","attest_author":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2/action/author_attestation","sign_citation":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2/action/citation_signature","submit_replication":"https://pith.science/pith/D3JMLEZSXDCV5GCB7AIDX3ZFS2/action/replication_record"}},"created_at":"2026-05-18T04:23:11.857455+00:00","updated_at":"2026-05-18T04:23:11.857455+00:00"}