{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:ZFKMB2XPHTHBXS3W2OBYINZN2H","short_pith_number":"pith:ZFKMB2XP","canonical_record":{"source":{"id":"math/0401269","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2004-01-21T07:29:45Z","cross_cats_sorted":[],"title_canon_sha256":"cc5489cad3b71a223bf7564d351b9de4af0c5d07047f1cb2a196c9aa17c042a6","abstract_canon_sha256":"7ad346286eef0dd757ffbd144fceea4601515832497fe3a18034f66e3fa4c544"},"schema_version":"1.0"},"canonical_sha256":"c954c0eaef3cce1bcb76d38384372dd1e9c31ecdd0e87dd49a32bd7dce71bdfa","source":{"kind":"arxiv","id":"math/0401269","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:ZFKMB2XPHTHBXS3W2OBYINZN2H","target":"record","payload":{"canonical_record":{"source":{"id":"math/0401269","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2004-01-21T07:29:45Z","cross_cats_sorted":[],"title_canon_sha256":"cc5489cad3b71a223bf7564d351b9de4af0c5d07047f1cb2a196c9aa17c042a6","abstract_canon_sha256":"7ad346286eef0dd757ffbd144fceea4601515832497fe3a18034f66e3fa4c544"},"schema_version":"1.0"},"canonical_sha256":"c954c0eaef3cce1bcb76d38384372dd1e9c31ecdd0e87dd49a32bd7dce71bdfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.850537Z","signature_b64":"ZwXm6OWwWpxulg9eFmgfIr8JwxwKq3ZrdF5cVxD+PLUeI88ZYcjRwz+DUOXPIe3Zec+6BvTKK6ec/3VUf0AxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c954c0eaef3cce1bcb76d38384372dd1e9c31ecdd0e87dd49a32bd7dce71bdfa","last_reissued_at":"2026-05-18T04:23:11.850000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.850000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0401269","source_version":3,"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-18T04:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NG/R7zJ9E5l2ijumpl7nSG03tLKRt0zP/6D1w1uV349aIiJopg5HuTOBWUr2BDfb/1I3hF4x3vlC6wRw8i0mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:51:46.579535Z"},"content_sha256":"0321d8347017c96cdae7d6cc59813a8111b89272ed249c694a968143ee0b78aa","schema_version":"1.0","event_id":"sha256:0321d8347017c96cdae7d6cc59813a8111b89272ed249c694a968143ee0b78aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:ZFKMB2XPHTHBXS3W2OBYINZN2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tighter bound for the number of words of minimum length in an automorphic orbit","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2004-01-21T07:29: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 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). "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0401269","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"},"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-18T04:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEN4j439h6m79wHB92QoPYxFnPK2RuS2b+BVeFoV+YjLm13AP1uxqszFVpI13eHiXxhtjBMeiT4iS95X1r7vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:51:46.579892Z"},"content_sha256":"81355afa6910c7d9d712d30881256cfc71ed96a68666f3f8ff1c96bc4c535f4f","schema_version":"1.0","event_id":"sha256:81355afa6910c7d9d712d30881256cfc71ed96a68666f3f8ff1c96bc4c535f4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H/bundle.json","state_url":"https://pith.science/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H/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-23T08:51:46Z","links":{"resolver":"https://pith.science/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H","bundle":"https://pith.science/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H/bundle.json","state":"https://pith.science/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFKMB2XPHTHBXS3W2OBYINZN2H/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYJc/h7KSKa+vOyf1JNu6mE7oUUV8sh5gT77bdbpMprF8sTKXVMe+4w48BULbcbRAdb8c3YqdOtQ1Hd3U6rNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:51:46.581949Z","bundle_sha256":"d1948b556f433b9810feda92ef0e9d7a1fd0ef06452c77769f5cbb5983c746eb"}}