{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:KBLUHYP5DDE4QMCH7KRZU5TR4I","short_pith_number":"pith:KBLUHYP5","schema_version":"1.0","canonical_sha256":"505743e1fd18c9c83047faa39a7671e236531c2bfb1ec0fe5760ede1bd0d8370","source":{"kind":"arxiv","id":"math/0103108","version":1},"attestation_state":"computed","paper":{"title":"On certain C-test words for free groups","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2001-03-16T23:08:15Z","abstract_excerpt":"Let F_m be a free group of a finite rank m > 1 and X_i, Y_j be elements in F_m. A non-empty word w(x_1,..., x_n) is called a C-test word in n letters for F_m if, whenever w(X_1,..., X_n)=w(Y_1,..., Y_n) not equal to 1, the two n-tuples (X_1,..., X_n) and (Y_1,..., Y_n) are conjugate in F_m. In this paper we construct, for each n > 1, a C-test word v_n(x_1,..., x_n) with the additional property that v_n(X_1,..., X_n)=1 if and only if the subgroup of F_m generated by X_1,..., X_n is cyclic. Making use of such words v_m(x_1,..., x_m) and v_{m+1}(x_1,..., x_{m+1}), we provide a positive solution t"},"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/0103108","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2001-03-16T23:08:15Z","cross_cats_sorted":[],"title_canon_sha256":"44157519d6592c6a610800ad35340cc8a510a73529d6a3927a75ceafe12aad6a","abstract_canon_sha256":"327fb4ce5babb068bccd342adcf29073ed141b25cc6cbe4d4c6e3709482ff1e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.873503Z","signature_b64":"nnyZX2wbH6SW3iJ0+VIUJKmDOTxa9u80k6YyGPGhYLDlEHL+Y7VWr0Ds02yA3rD5ZAwLP2vdfCOUN4eqKOa3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"505743e1fd18c9c83047faa39a7671e236531c2bfb1ec0fe5760ede1bd0d8370","last_reissued_at":"2026-05-18T04:23:11.873019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.873019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On certain C-test words for free groups","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Donghi Lee","submitted_at":"2001-03-16T23:08:15Z","abstract_excerpt":"Let F_m be a free group of a finite rank m > 1 and X_i, Y_j be elements in F_m. A non-empty word w(x_1,..., x_n) is called a C-test word in n letters for F_m if, whenever w(X_1,..., X_n)=w(Y_1,..., Y_n) not equal to 1, the two n-tuples (X_1,..., X_n) and (Y_1,..., Y_n) are conjugate in F_m. In this paper we construct, for each n > 1, a C-test word v_n(x_1,..., x_n) with the additional property that v_n(X_1,..., X_n)=1 if and only if the subgroup of F_m generated by X_1,..., X_n is cyclic. Making use of such words v_m(x_1,..., x_m) and v_{m+1}(x_1,..., x_{m+1}), we provide a positive solution t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0103108","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/0103108","created_at":"2026-05-18T04:23:11.873101+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0103108v1","created_at":"2026-05-18T04:23:11.873101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0103108","created_at":"2026-05-18T04:23:11.873101+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBLUHYP5DDE4","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBLUHYP5DDE4QMCH","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBLUHYP5","created_at":"2026-05-18T12:25:50.254431+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/KBLUHYP5DDE4QMCH7KRZU5TR4I","json":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I.json","graph_json":"https://pith.science/api/pith-number/KBLUHYP5DDE4QMCH7KRZU5TR4I/graph.json","events_json":"https://pith.science/api/pith-number/KBLUHYP5DDE4QMCH7KRZU5TR4I/events.json","paper":"https://pith.science/paper/KBLUHYP5"},"agent_actions":{"view_html":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I","download_json":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I.json","view_paper":"https://pith.science/paper/KBLUHYP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0103108&json=true","fetch_graph":"https://pith.science/api/pith-number/KBLUHYP5DDE4QMCH7KRZU5TR4I/graph.json","fetch_events":"https://pith.science/api/pith-number/KBLUHYP5DDE4QMCH7KRZU5TR4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I/action/storage_attestation","attest_author":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I/action/author_attestation","sign_citation":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I/action/citation_signature","submit_replication":"https://pith.science/pith/KBLUHYP5DDE4QMCH7KRZU5TR4I/action/replication_record"}},"created_at":"2026-05-18T04:23:11.873101+00:00","updated_at":"2026-05-18T04:23:11.873101+00:00"}