{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FP6IKGNJCIB3TW3QKWP3BJIVYH","short_pith_number":"pith:FP6IKGNJ","schema_version":"1.0","canonical_sha256":"2bfc8519a91203b9db70559fb0a515c1d781aeff0265727b7752a17f13ceb5ab","source":{"kind":"arxiv","id":"1307.8216","version":2},"attestation_state":"computed","paper":{"title":"Classification of automorphic conjugacy classes in the free group on two generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Bobbe Cooper, Eric Rowland","submitted_at":"2013-07-31T03:39:22Z","abstract_excerpt":"We associate a finite directed graph with each equivalence class of words in $F_2$ under $\\operatorname*{Aut} F_2$, and we completely classify these graphs, giving a structural classification of the automorphic conjugacy classes of $F_2$. This classification refines work of Khan and proves a conjecture of Myasnikov and Shpilrain on the number of minimal words in an automorphic conjugacy class whose minimal words have length $n$, which in turn implies a sharp upper bound on the running time of Whitehead's algorithm for determining whether two words in $F_2$ are automorphic conjugates."},"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":"1307.8216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-07-31T03:39:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"851f586c004ff5865e146ad42b9397ff2caca1c9e63154607a0ffc886fd334d9","abstract_canon_sha256":"5992352bb755215b698f9fbfb8a163bcf51873c40a0d9b9cec9c5a6a23390359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:26.733501Z","signature_b64":"ETy84qaQhn0SikMENRI8dQ9o9lpSvp+Us78YqUtxo7uGajObcraWEmlsiJABWjrJExk7tEYt49zslFn0oVlyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bfc8519a91203b9db70559fb0a515c1d781aeff0265727b7752a17f13ceb5ab","last_reissued_at":"2026-05-18T02:25:26.732964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:26.732964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of automorphic conjugacy classes in the free group on two generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Bobbe Cooper, Eric Rowland","submitted_at":"2013-07-31T03:39:22Z","abstract_excerpt":"We associate a finite directed graph with each equivalence class of words in $F_2$ under $\\operatorname*{Aut} F_2$, and we completely classify these graphs, giving a structural classification of the automorphic conjugacy classes of $F_2$. This classification refines work of Khan and proves a conjecture of Myasnikov and Shpilrain on the number of minimal words in an automorphic conjugacy class whose minimal words have length $n$, which in turn implies a sharp upper bound on the running time of Whitehead's algorithm for determining whether two words in $F_2$ are automorphic conjugates."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8216","kind":"arxiv","version":2},"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":"1307.8216","created_at":"2026-05-18T02:25:26.733044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.8216v2","created_at":"2026-05-18T02:25:26.733044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8216","created_at":"2026-05-18T02:25:26.733044+00:00"},{"alias_kind":"pith_short_12","alias_value":"FP6IKGNJCIB3","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FP6IKGNJCIB3TW3Q","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FP6IKGNJ","created_at":"2026-05-18T12:27:45.050594+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/FP6IKGNJCIB3TW3QKWP3BJIVYH","json":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH.json","graph_json":"https://pith.science/api/pith-number/FP6IKGNJCIB3TW3QKWP3BJIVYH/graph.json","events_json":"https://pith.science/api/pith-number/FP6IKGNJCIB3TW3QKWP3BJIVYH/events.json","paper":"https://pith.science/paper/FP6IKGNJ"},"agent_actions":{"view_html":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH","download_json":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH.json","view_paper":"https://pith.science/paper/FP6IKGNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.8216&json=true","fetch_graph":"https://pith.science/api/pith-number/FP6IKGNJCIB3TW3QKWP3BJIVYH/graph.json","fetch_events":"https://pith.science/api/pith-number/FP6IKGNJCIB3TW3QKWP3BJIVYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/action/storage_attestation","attest_author":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/action/author_attestation","sign_citation":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/action/citation_signature","submit_replication":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/action/replication_record"}},"created_at":"2026-05-18T02:25:26.733044+00:00","updated_at":"2026-05-18T02:25:26.733044+00:00"}