{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:YW3KR6SVNMFULYYQII4WVUO3NK","short_pith_number":"pith:YW3KR6SV","schema_version":"1.0","canonical_sha256":"c5b6a8fa556b0b45e31042396ad1db6ab64e776731577d4df39a8a9aef181018","source":{"kind":"arxiv","id":"math/0610833","version":1},"attestation_state":"computed","paper":{"title":"An algorithm that decides translation equivalence in a free group of rank two","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2006-10-27T10:18:57Z","abstract_excerpt":"Let F_2 be a free group of rank 2. We prove that there is an algorithm that decides whether or not, for given two elements u, v of F_2, u and v are translation equivalent in F_2, that is, whether or not u and v have the property that the cyclic length of phi(u) equals the cyclic length of phi(v) for every automorphism phi of F_2. This gives an affirmative solution to problem F38a in the online version (http://www.grouptheory.info) of [1] for the case of F_2."},"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/0610833","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2006-10-27T10:18:57Z","cross_cats_sorted":[],"title_canon_sha256":"e8358348ceefe42b9554d5bc110e6a624f24dc0a792152f7a802b926f237f6f4","abstract_canon_sha256":"37f8700552b502bf1dc1ac697bad31404f32b91e478f27eb256c76a337cff639"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.835693Z","signature_b64":"VkpmJCDzxpDFF/FSYNXZgmmd+/azPMZa6ewiroTubUlLTh7Q7r6q19DL/BwWPe/KuQ+Yl4UGxENY6detj50iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5b6a8fa556b0b45e31042396ad1db6ab64e776731577d4df39a8a9aef181018","last_reissued_at":"2026-05-18T04:23:11.835164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.835164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm that decides translation equivalence in a free group of rank two","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2006-10-27T10:18:57Z","abstract_excerpt":"Let F_2 be a free group of rank 2. We prove that there is an algorithm that decides whether or not, for given two elements u, v of F_2, u and v are translation equivalent in F_2, that is, whether or not u and v have the property that the cyclic length of phi(u) equals the cyclic length of phi(v) for every automorphism phi of F_2. This gives an affirmative solution to problem F38a in the online version (http://www.grouptheory.info) of [1] for the case of F_2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610833","kind":"arxiv","version":1},"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/0610833","created_at":"2026-05-18T04:23:11.835257+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0610833v1","created_at":"2026-05-18T04:23:11.835257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610833","created_at":"2026-05-18T04:23:11.835257+00:00"},{"alias_kind":"pith_short_12","alias_value":"YW3KR6SVNMFU","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"YW3KR6SVNMFULYYQ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"YW3KR6SV","created_at":"2026-05-18T12:25:54.717736+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/YW3KR6SVNMFULYYQII4WVUO3NK","json":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK.json","graph_json":"https://pith.science/api/pith-number/YW3KR6SVNMFULYYQII4WVUO3NK/graph.json","events_json":"https://pith.science/api/pith-number/YW3KR6SVNMFULYYQII4WVUO3NK/events.json","paper":"https://pith.science/paper/YW3KR6SV"},"agent_actions":{"view_html":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK","download_json":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK.json","view_paper":"https://pith.science/paper/YW3KR6SV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0610833&json=true","fetch_graph":"https://pith.science/api/pith-number/YW3KR6SVNMFULYYQII4WVUO3NK/graph.json","fetch_events":"https://pith.science/api/pith-number/YW3KR6SVNMFULYYQII4WVUO3NK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK/action/storage_attestation","attest_author":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK/action/author_attestation","sign_citation":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK/action/citation_signature","submit_replication":"https://pith.science/pith/YW3KR6SVNMFULYYQII4WVUO3NK/action/replication_record"}},"created_at":"2026-05-18T04:23:11.835257+00:00","updated_at":"2026-05-18T04:23:11.835257+00:00"}