{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FP6IKGNJCIB3TW3QKWP3BJIVYH","short_pith_number":"pith:FP6IKGNJ","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"},"canonical_sha256":"2bfc8519a91203b9db70559fb0a515c1d781aeff0265727b7752a17f13ceb5ab","source":{"kind":"arxiv","id":"1307.8216","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8216","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8216v2","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8216","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"FP6IKGNJCIB3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FP6IKGNJCIB3TW3Q","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FP6IKGNJ","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FP6IKGNJCIB3TW3QKWP3BJIVYH","target":"record","payload":{"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"},"canonical_sha256":"2bfc8519a91203b9db70559fb0a515c1d781aeff0265727b7752a17f13ceb5ab","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"},"source_kind":"arxiv","source_id":"1307.8216","source_version":2,"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-18T02:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6A01TgMyZkUwgPUSrOOKmxUMdTwu57njmOqXAfYNUGjV1pyiyXjT3rWBPYBDb/AviNQ57NmKdUjc8BTA5OiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:10:07.604153Z"},"content_sha256":"13f94c9ca2590e34fc6e9fcb9282872cd161cbe8b3015dfb48931d6376a185ac","schema_version":"1.0","event_id":"sha256:13f94c9ca2590e34fc6e9fcb9282872cd161cbe8b3015dfb48931d6376a185ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FP6IKGNJCIB3TW3QKWP3BJIVYH","target":"graph","payload":{"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"},"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-18T02:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDi1dKYSqa0SgpK/UGVvDuhMeJzKkZNVTHgwTxt2HTQR1IREvevnbZFOq53ybCTEWpqPw8EeDF6MNV4AHDFaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:10:07.604914Z"},"content_sha256":"d244e8205363532feb103999b890355b30cb724138e89975b9338b153690f1f5","schema_version":"1.0","event_id":"sha256:d244e8205363532feb103999b890355b30cb724138e89975b9338b153690f1f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/bundle.json","state_url":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/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-09T09:10:07Z","links":{"resolver":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH","bundle":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/bundle.json","state":"https://pith.science/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FP6IKGNJCIB3TW3QKWP3BJIVYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FP6IKGNJCIB3TW3QKWP3BJIVYH","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":"5992352bb755215b698f9fbfb8a163bcf51873c40a0d9b9cec9c5a6a23390359","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-07-31T03:39:22Z","title_canon_sha256":"851f586c004ff5865e146ad42b9397ff2caca1c9e63154607a0ffc886fd334d9"},"schema_version":"1.0","source":{"id":"1307.8216","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8216","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8216v2","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8216","created_at":"2026-05-18T02:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"FP6IKGNJCIB3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FP6IKGNJCIB3TW3Q","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FP6IKGNJ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:d244e8205363532feb103999b890355b30cb724138e89975b9338b153690f1f5","target":"graph","created_at":"2026-05-18T02:25:26Z","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":"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.","authors_text":"Bobbe Cooper, Eric Rowland","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-07-31T03:39:22Z","title":"Classification of automorphic conjugacy classes in the free group on two generators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8216","kind":"arxiv","version":2},"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:13f94c9ca2590e34fc6e9fcb9282872cd161cbe8b3015dfb48931d6376a185ac","target":"record","created_at":"2026-05-18T02:25:26Z","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":"5992352bb755215b698f9fbfb8a163bcf51873c40a0d9b9cec9c5a6a23390359","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-07-31T03:39:22Z","title_canon_sha256":"851f586c004ff5865e146ad42b9397ff2caca1c9e63154607a0ffc886fd334d9"},"schema_version":"1.0","source":{"id":"1307.8216","kind":"arxiv","version":2}},"canonical_sha256":"2bfc8519a91203b9db70559fb0a515c1d781aeff0265727b7752a17f13ceb5ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bfc8519a91203b9db70559fb0a515c1d781aeff0265727b7752a17f13ceb5ab","first_computed_at":"2026-05-18T02:25:26.732964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:26.732964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ETy84qaQhn0SikMENRI8dQ9o9lpSvp+Us78YqUtxo7uGajObcraWEmlsiJABWjrJExk7tEYt49zslFn0oVlyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:26.733501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8216","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f94c9ca2590e34fc6e9fcb9282872cd161cbe8b3015dfb48931d6376a185ac","sha256:d244e8205363532feb103999b890355b30cb724138e89975b9338b153690f1f5"],"state_sha256":"ba6099a82889877f246759ea05841d6d855c02397deea5d528adb93e7bd4768d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gb6xIj8dwrBMpjEHJ4dmcc8t6WEQPneaYPWBXRC52v1BYU/r3RCo9LzHjQlP2EKmu8bV602NVn3EX4AyhNf5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:10:07.608850Z","bundle_sha256":"083f191256c826969d768fad13222c865e7eb77ad1d1dc9b0939482243539c05"}}